Abstract Counterexample-Based Refinement for Powerset Domains

DOI10.1007/978-3-540-71322-7_13MaRDI QIDQ3593078zbMATH OpenOpenAlexFDO

Authors Roman Manevich, John Field, G. Ramalingam, Mooly Sagiv, Thomas A. Henzinger

Publication date 24 September 2007

Published in Program Analysis and Compilation, Theory and Practice (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71322-7_13

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Abstract Counterexamples for Non-disjunctive Abstractions
• Partial predicate abstraction and counter-example guided refinement
• scientific article; zbMATH DE number 1670775
• Fixpoint-Guided Abstraction Refinements
• Probabilistic CEGAR

Cited in

(5)

• Loop summarization using state and transition invariants
• Example-guided abstraction simplification
• Abstract Counterexamples for Non-disjunctive Abstractions
• Counterexample-guided Cartesian abstraction refinement for classical planning
• A Forward-Backward Abstraction Refinement Algorithm

This page was built for publication: Abstract Counterexample-Based Refinement for Powerset Domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593078)