论文信息 - Bi-abductive Resource Invariant Synthesis

Bi-abductive Resource Invariant Synthesis

We describe an algorithm for synthesizing resource invariants that are used in the verification of concurrent programs. This synthesis employs bi-abductive inference to identify the footprints of different parts of the program and decide what invariant each lock protects. We demonstrate our algorithm on several small (yet intricate) examples which are out of the reach of other automatic analyses in the literature.

[1] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[2] Peter W. O'Hearn,et al. Resources, concurrency, and local reasoning , 2007 .

[3] Peter W. O'Hearn,et al. Symbolic Execution with Separation Logic , 2005, APLAS.

[4] Frank D. Valencia,et al. Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[5] Eran Yahav,et al. Verifying safety properties of concurrent Java programs using 3-valued logic , 2001, POPL '01.

[6] Brian Campbell,et al. Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[7] Jeffrey S. Foster,et al. LOCKSMITH: context-sensitive correlation analysis for race detection , 2006, PLDI '06.

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

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

[10] Peter W. O'Hearn,et al. Smallfoot: Modular Automatic Assertion Checking with Separation Logic , 2005, FMCO.

[11] Shmuel Sagiv. Thread-Modular Shape Analysis , 2009, VMCAI.

[12] Roman Manevich,et al. Abstract Transformers for Thread Correlation Analysis , 2009, APLAS.

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

[14] Supratik Chakraborty,et al. Bottom-Up Shape Analysis , 2009, SAS.