Name
Abstract | ||
|---|---|---|
Separation logic-based abstraction mechanisms, enhanced with userdefined 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. |
Year | Venue | Keywords |
|---|---|---|
2011 | CAV | userdefined inductive predicate,specialization calculus,disjunctive predicate,subsequent cost,expressive mean,abstraction mechanism,pruning disjunctive predicate,familiar technique,expressive power,predicate specialization,predicate instance,predicate specialization technique,separation logic,data structure,satisfiability,code optimization |
Field | DocType | Citations |
Programming language,Abstraction,Computer science,Satisfiability,Heap (data structure),Theoretical computer science,Program optimization,Data structure,Separation logic,Algorithm,Invariant (mathematics),Predicate (grammar),Calculus | Conference | 5 |
PageRank | References | Authors |
0.43 | 19 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Ngan Chin | 1 | 868 | 63.37 |
| Cristian Gherghina | 2 | 85 | 6.60 |
| Răzvan Voicu | 3 | 19 | 2.44 |
| Quang Loc Le | 4 | 65 | 9.48 |
| Florin Craciun | 5 | 40 | 8.19 |
| Shengchao Qin | 6 | 711 | 62.81 |