Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra

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

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

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

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

Related Items

Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Stratified Static Analysis Based on Variable Dependencies ⋮ Counterexample Guided Path Reduction for Static Program Analysis ⋮ Automatically Refining Abstract Interpretations

Uses Software

• CESAR

This page was built for publication: Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra