Automatic Abstraction without Counterexamples
No abstract available.
Related papers
- Path invariants PLDI 2007
- Automatic Abstraction in SMT-Based Unbounded Software Model Checking CAV 2013
- Counterexample Guided Inductive Synthesis Modulo Theories CAV 2018
- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays TACAS 2021
- Assume-Guarantee Abstraction Refinement for Probabilistic Systems CAV 2012
- SmartCheck: automatic and efficient counterexample reduction and generalization Haskell 2014
- Dependent types from counterexamples POPL 2010
- Checking equivalence in a non-strict language JFP 2025