Augmenting Counterexample-Guided Abstraction Refinement with Proof Templates

Authors:
T. E. Hart;K. Ku;A. Gurfinkel;M. Chechik;D. Lie
Affiliations:
Dept. of Comput. Sci., Univ. of Toronto, Toronto, ON;Dept. of Comput. Sci., Univ. of Toronto, Toronto, ON;-;-;-
Venue:
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Year:
2008

Citing 18
Cited 1

Advanced compiler design and implementation

Advanced compiler design and implementation
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CSSV: towards a realistic tool for statically detecting all buffer overflows in C

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise and efficient static array bound checking for large embedded C programs

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract)

ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Path invariants

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
A buffer overflow benchmark for software model checkers

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Induction in CEGAR for Detecting Counterexamples

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
PtYasm: Software Model Checking with Proof Templates

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Abstraction refinement of linear programs with arrays

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
ACSAR: software model checking with transfinite refinement

Proceedings of the 14th international SPIN conference on Model checking software
Sufficient preconditions for modular assertion checking

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Counterexamples with loops for predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
YASM: a software model-checker for verification and refutation

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
SATABS: SAT-Based predicate abstraction for ANSI-C

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A practical and complete approach to predicate refinement

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

PtYasm: Software Model Checking with Proof Templates

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing software model checkers based on predicate abstraction and refinement typically perform poorly at verifying the absence of buffer overflows, with analyses depending on the sizes of the arrays checked. We observe that many of these analyses can be made efficient by providing proof templates for common array traversal idioms idioms, which guide the model checker towards proofs that are independent of array size. We have integrated this technique into our software model checker, PtYasm, and have evaluated our approach on a set of testcases derived from the Verisec suite, demonstrating that our technique enables verification of the safety of array accesses independently of array size.