@inproceedings{e1ef0f1b38614719ac4c173d95771a9c,
title = "A specialization calculus for pruning disjunctive predicates to support verification",
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.",
author = "Chin, {Wei Ngan} and Cristian Gherghina and Rǎzvan Voicu and Le, {Quang Loc} and Florin Craciun and Shengchao Qin",
year = "2011",
month = jul,
day = "20",
doi = "10.1007/978-3-642-22110-1_23",
language = "English",
isbn = "9783642221095",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "293--309",
editor = "{ Gopalakrishnan}, G and S Qadeer",
booktitle = "Computer aided verification",
note = "23rd International Conference on Computer Aided Verification, CAV 2011 ; Conference date: 14-07-2011 Through 20-07-2011",
}