Interpolant-Based Transition Relation Approximation

@article{Jhala2007InterpolantBasedTR,
  title={Interpolant-Based Transition Relation Approximation},
  author={R. Jhala and K. McMillan},
  journal={Log. Methods Comput. Sci.},
  year={2007},
  volume={3}
}
  • R. Jhala, K. McMillan
  • Published 2007
  • Computer Science
  • Log. Methods Comput. Sci.
  • In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of predicates. We present an interpolant-based method for strengthening the abstract transition relation in case of such failures. This approach guarantees convergence given an… CONTINUE READING
    45 Citations
    Interpolant Strength
    • 108
    • PDF
    Restructuring Resolution Refutations for Interpolation
    • 5
    • PDF
    Nested interpolants
    • 106
    • PDF
    Lemma localization: A practical method for downsizing SMT-interpolants
    • 4
    • PDF
    Efficient Generation of Small Interpolants in CNF
    • 21
    • PDF
    Interpolation Properties and SAT-Based Model Checking
    • 16
    • PDF
    A Parametric Interpolation Framework for First-Order Theories
    • 3
    • PDF
    Program analysis with interpolants
    • 16
    Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic
    • 6
    • PDF

    References

    SHOWING 1-10 OF 20 REFERENCES
    An Interpolating Theorem Prover
    • 230
    • PDF
    Successive approximation of abstract transition relations
    • S. Das, D. Dill
    • Computer Science
    • Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
    • 2001
    • 127
    Counterexample-guided abstraction refinement
    • E. Clarke
    • Computer Science
    • 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.
    • 2003
    • 1,263
    • PDF
    A Symbolic Approach to Predicate Abstraction
    • 116
    • PDF
    Automatic Abstraction without Counterexamples
    • 248
    • PDF
    Abstractions from proofs
    • 264
    • PDF
    Lazy abstraction
    • 1,193
    • PDF
    Interpolation and SAT-Based Model Checking
    • 869
    • PDF