Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
No abstract available.
DOI 10.1007/11817963_15
Related papers
- Predicate abstraction for software verification POPL 2002
- Path invariants PLDI 2007
- Probabilistic Abstractions with Arbitrary Domains SAS 2011
- Predicate Abstraction for Linked Data Structures VMCAI 2016
- Control-flow refinement and progress invariants for bound analysis PLDI 2009
- Modular Abstractions of Reactive Nodes Using Disjunctive Invariants APLAS 2011
- Simplifying Loop Invariant Generation Using Splitter Predicates CAV 2011
- Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference TACAS 2011