TVLA: A system for generating abstract interpreters

TVLA (Three-Valued-Logic Analyzer) is a “YACC”-like framework for automatically constructing abstract interpreters from an operational semantics. The operational semantics is specified as a generic transition system based on first-order logic. TVLA was implemented in Java and successfully used to prove interesting properties of (concurrent) Java programs manipulating dynamically allocated linked data structures.

[1]  Reinhard Wilhelm,et al.  Solving shape-analysis problems in languages with destructive updating , 1998, TOPL.

[2]  Neil Immerman,et al.  Verification via Structure Simulation , 2004, CAV.

[3]  R. Wilhelm,et al.  Parametric Shape Analysis via 3 - valued Logic TOPLAS , 2002 .

[4]  Thomas W. Reps,et al.  Symbolic Implementation of the Best Transformer , 2004, VMCAI.

[5]  Eran Yahav,et al.  Verifying safety properties using separation and heterogeneous abstractions , 2004, PLDI '04.

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

[7]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

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

[9]  Eran Yahav,et al.  Automatically Verifying Concurrent Queue Algorithms , 2003, SoftMC@CAV.

[10]  Eran Yahav,et al.  Verifying Temporal Heap Properties Specified via Evolution Logic , 2006, Log. J. IGPL.

[11]  Thomas W. Reps,et al.  Symbolically Computing Most-Precise Abstract Operations for Shape Analysis , 2004, TACAS.

[12]  Roman Manevich,et al.  Partially Disjunctive Heap Abstraction , 2004, SAS.

[13]  Thomas Reps,et al.  Abstraction Refinement for 3-Valued-Logic Analysis , 2004 .

[14]  Deepak Goyal,et al.  Deriving specialized program analyses for certifying component-client conformance , 2002, PLDI '02.

[15]  Patrick Cousot,et al.  Abstract Interpretation Based Static Analysis Parameterized by Semantics , 1997, SAS.

[16]  Eran Yahav,et al.  Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management , 2003, SAS.

[17]  Noam Rinetzky,et al.  Interprocedural Shape Analysis for Recursive Programs , 2001, CC.

[18]  Ronald Bieber.  Alexsa - Algorithm Explanation by Shape Analysis - Extensions to the TVLA System , 2001 .

[19]  Roman Manevich,et al.  Compactly Representing First-Order Structures for Static Analysis , 2002, SAS.

[20]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[21]  Thomas W. Reps,et al.  Numeric Domains with Summarized Dimensions , 2004, TACAS.