Abstract Counterexample-Based Refinement for Powerset Domains

DOI10.1007/978-3-540-71322-7_13zbMath1149.68357OpenAlexW1607111701MaRDI QIDQ3593078

G. Ramalingam, Mooly Sagiv, Roman Manevich, John Field, 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

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

Related Items (2)

Loop summarization using state and transition invariants ⋮ A Forward-Backward Abstraction Refinement Algorithm

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