A direct encoding for NNC polyhedra

DOI10.1007/978-3-319-96145-3_13MaRDI QIDQ6045006zbMATH OpenFDO

Authors Anna Becchi, Enea Zaffanella

Publication date 26 May 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-96145-3_13

Mathematics Subject Classification ID

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

Recommendations

• PPLite: zero-overhead encoding of NNC polyhedra
• Not necessarily closed convex polyhedra and the double description method
• An efficient abstract domain for not necessarily closed polyhedra
• scientific article; zbMATH DE number 1304965
• scientific article; zbMATH DE number 1948398

Cited in

(5)

• PPLite: zero-overhead encoding of NNC polyhedra
• Not necessarily closed convex polyhedra and the double description method
• Symbolic analysis of linear hybrid automata -- 25 years later
• Decoupling the ascending and descending phases in abstract interpretation
• Revisiting polyhedral analysis for hybrid systems

This page was built for publication: A direct encoding for NNC polyhedra

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