Abstraction Refinement via Inductive Learning

@inproceedings{Loginov2005AbstractionRV,
  title={Abstraction Refinement via Inductive Learning},
  author={Alexey Loginov and Thomas W. Reps and Shmuel Sagiv},
  booktitle={CAV},
  year={2005}
}
ion Refinement via Inductive Learning Alexey Loginov, Thomas Reps , and Mooly Sagiv 1 Comp. Sci. Dept., University of Wisconsin; {alexey,reps }@cs.wisc.edu 2 School of Comp. Sci., Tel-Aviv University; msagiv@post.ta u. c.il Abstract. This paper concerns how to automatically create abstractio ns 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 prob lem. An advantage of an approach… CONTINUE READING
BETA

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 49 CITATIONS

Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata

VIEW 5 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Refinement-Based Verification for Possibly-Cyclic Lists

  • Program Analysis and Compilation
  • 2006
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Parametric shape analysis via 3-valued logic

  • ACM Trans. Program. Lang. Syst.
  • 2002
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Abst rac ions from proofs

T. Henzinger, R. Jhala, R. Majumdar, K. McMillan
  • InPOPL, pages 232–244,
  • 2004
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

and G

N. Immerman, A. Rabinovich, T. Reps, M. Sagiv
  • Yorsh . The boundary between decidability and undecidability for transitive closure lo gics. InCSL, pages 160–174,
  • 2004
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…