Please use this identifier to cite or link to this item:
|Title:||A specialization calculus for pruning disjunctive predicates to support verification||Authors:||Chin, W.-N.
|Issue Date:||2011||Citation:||Chin, W.-N.,Gherghina, C.,Voicu, R.,Le, Q.L.,Craciun, F.,Qin, S. (2011). A specialization calculus for pruning disjunctive predicates to support verification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6806 LNCS : 293-309. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-22110-1_23||Abstract:||Separation logic-based abstraction mechanisms, enhanced with user-defined inductive predicates, represent a powerful, expressive means of specifying heap-based data structures with strong invariant properties. However, expressive power comes at a cost: the manipulation of such logics typically requires the unfolding of disjunctive predicates which may lead to expensive proof search. We address this problem by proposing a predicate specialization technique that allows efficient symbolic pruning of infeasible disjuncts inside each predicate instance. Our technique is presented as a calculus whose derivations preserve the satisfiability of formulas, while reducing the subsequent cost of their manipulation. Initial experimental results have confirmed significant speed gains from the deployment of predicate specialization. While specialization is a familiar technique for code optimization, its use in program verification is new. © 2011 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/42073||ISBN:||9783642221095||ISSN:||03029743||DOI:||10.1007/978-3-642-22110-1_23|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 21, 2020
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.