Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra

DOI10.1007/978-3-540-73368-3_40zbMath1135.68370MaRDI QIDQ5429329

Zi-Jiang Yang, Chao Wang, Aarti Gupta, Franjo Ivančić

Publication date: 29 November 2007

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73368-3_40

Mathematics Subject Classification ID

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Counterexample Guided Path Reduction for Static Program Analysis, Automatically Refining Abstract Interpretations

Uses Software

• CESAR