Abstraction Refinement via Inductive Learning

This paper concerns how to automatically create abstractions for program analysis. We show that inductive learning, the goal of which is to identify general rules from a set of observed instances, provides new leverage on the problem. An advantage of an approach based on inductive learning is that it does not require the use of a theorem prover.

[1]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[2]  Edmund M. Clarke,et al.  Counterexample-Guided Abstraction Refinement , 2000, CAV.

[3]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[4]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 2002, TOPL.

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

[6]  Neil D. Jones,et al.  Program Flow Analysis: Theory and Application , 1981 .

[7]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[8]  Nicolas Halbwachs,et al.  Dynamic Partitioning in Analyses of Numerical Properties , 1999, SAS.

[9]  J. Ross Quinlan,et al.  Learning logical definitions from relations , 1990, Machine Learning.

[10]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[11]  Cormac Flanagan.  Software Model Checking via Iterative Abstraction Refinement of Constraint Logic Queries , 2007 .

[12]  David L. Dill,et al.  Counter-Example Based Predicate Discovery in Predicate Abstraction , 2002, FMCAD.

[13]  Matthew B. Dwyer,et al.  Finding Feasible Counter-examples when Model Checking Abstracted Java Programs , 2001, TACAS.

[14]  Saso Dzeroski,et al.  Inductive Logic Programming: Techniques and Applications , 1993 .

[15]  Jack Mostow,et al.  Learning Logical Definitions from Relations , 1990 .

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

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

[18]  Thomas Reps,et al.  Finite differencing of logical formulas with applications to program analysis , 2003 .

[19]  Thomas Reps,et al.  Learning Abstractions for Verifying Data-Structure Properties , 2004 .

[20]  Roberto Giacobazzi,et al.  Making abstract interpretations complete , 2000, JACM.

[21]  Neil Immerman,et al.  The Boundary Between Decidability and Undecidability for Transitive-Closure Logics , 2004, CSL.

[22]  Thomas W. Reps,et al.  Putting static analysis to work for verification: A case study , 2000, ISSTA '00.

[23]  Sriram K. Rajamani,et al.  Automatically validating temporal safety properties of interfaces , 2001, SPIN '01.

[24]  Mark N. Wegman,et al.  Analysis of pointers and structures , 1990, SIGP.

[25]  Yassine Lakhnech,et al.  Incremental Verification by Abstraction , 2001, TACAS.

[26]  Thomas W. Reps,et al.  Finite Differencing of Logical Formulas for Static Analysis , 2003, ESOP.

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