Refinement of Trace Abstraction

  • Matthias Heizmann
  • Jochen Hoenicke
  • Andreas Podelski
Conference paper

DOI: 10.1007/978-3-642-03237-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Heizmann M., Hoenicke J., Podelski A. (2009) Refinement of Trace Abstraction. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

Abstract

We present a new counterexample-guided abstraction refinement scheme. The scheme refines an over-approximation of the set of possible traces. Each refinement step introduces a finite automaton that recognizes a set of infeasible traces. A central idea enabling our approach is to use interpolants (assertions generated, e.g., by the infeasibility proof for an error trace) in order to automatically construct such an automaton. A data base of interpolant automata has an interesting potential for reuse of theorem proving work (from one program to another).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Matthias Heizmann
    • 1
  • Jochen Hoenicke
    • 1
  • Andreas Podelski
    • 1
  1. 1.University of FreiburgGermany

Personalised recommendations