论文信息 - Infer: An Automatic Program Verifier for Memory Safety of C Programs

Infer: An Automatic Program Verifier for Memory Safety of C Programs

Infer is a new automatic program verification tool aimed at proving memory safety of C programs. It attempts to build a compositional proof of the program at hand by composing proofs of its constituent modules (functions/procedures). Bugs are extracted from failures of proof attempts. We describe the main features of Infer and some of the main ideas behind it.

Cristiano Calcagno | Dino Distefano

[1] Shmuel Sagiv,et al. TVLA: A System for Implementing Static Analyses , 2000, SAS.

[2] John C. Reynolds,et al. Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[3] Patrick Cousot,et al. A static analyzer for large safety-critical software , 2003, PLDI '03.

[4] Thomas A. Henzinger,et al. Abstractions from proofs , 2004, POPL.

[5] Radu Rugina,et al. Region-based shape analysis with tracked locations , 2005, POPL '05.

[6] Peter W. O'Hearn,et al. A Local Shape Analysis Based on Separation Logic , 2006, TACAS.

[7] Peter W. O'Hearn,et al. Footprint Analysis: A Shape Analysis That Discovers Preconditions , 2007, SAS.

[8] George C. Necula,et al. Shape Analysis with Structural Invariant Checkers , 2007, SAS.

[9] Peter W. O'Hearn,et al. Shape Analysis for Composite Data Structures , 2007, CAV.

[10] Peter W. O'Hearn,et al. Scalable Shape Analysis for Systems Code , 2008, CAV.

[11] Shengchao Qin,et al. Enhancing modular OO verification with separation logic , 2008, POPL '08.

[12] Deepak Kapur,et al. Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models , 2008, CC.

[13] Peter W. O'Hearn,et al. Compositional Shape Analysis by Means of Bi-Abduction , 2011, JACM.

[14] Todd Millstein,et al. Automatic predicate abstraction of C programs , 2001, PLDI '01.