A specialization calculus for pruning disjunctive predicates to support verification

Authors:
Wei-Ngan Chin;Cristian Gherghina;Răzvan Voicu;Quang Loc Le;Florin Craciun;Shengchao Qin
Affiliations:
Department of Computer Science, National University of Singapore;Department of Computer Science, National University of Singapore;Department of Computer Science, National University of Singapore;Department of Computer Science, National University of Singapore;Department of Computer Science, National University of Singapore;School of Computing, Teesside University
Venue:
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Year:
2011

Citing 19
Cited 0

A practical algorithm for exact array dependence analysis

Communications of the ACM
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract specialization and its applications

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A framework for the integration of partial evaluation and abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Shape analysis with inductive recursion synthesis

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Relational inductive shape analysis

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enhancing Program Verification with Lemmas

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Scalable Shape Analysis for Systems Code

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Counterexample-guided focus

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular shape analysis for dynamically encapsulated programs

ESOP'07 Proceedings of the 16th European conference on Programming
Automated verification of shape and size properties via separation logic

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Shape analysis by graph decomposition

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Shape analysis for composite data structures

CAV'07 Proceedings of the 19th international conference on Computer aided verification
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Separating shape graphs

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.