Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra

DOI10.1007/978-3-540-73368-3_40MaRDI QIDQ5429329zbMATH OpenOpenAlexFDO

Authors Chao Wang, Zijiang Yang, 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

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

Recommendations

• Counterexample-Guided Refinement of Template Polyhedra
• Reachability computation for polynomial dynamical systems
• Reachability analysis of polynomial systems using linear programming relaxations
• Tools and Algorithms for the Construction and Analysis of Systems
• Using redundant constraints for refinement

Cited in

(5)

• Counterexample guided path reduction for static program analysis
• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• Stratified static analysis based on variable dependencies
• Counterexample-Guided Refinement of Template Polyhedra
• Automatically Refining Abstract Interpretations

Describes a project that uses

Uses Software

• CESAR

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

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