An efficient abstract domain for not necessarily closed polyhedra

DOI10.1007/978-3-319-99725-4_11zbMath1511.68070MaRDI QIDQ6041169

Anna Becchi, Enea Zaffanella

Publication date: 26 May 2023

Published in: Static Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (4)

Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ Efficient convex zone merging in parametric timed automata

This page was built for publication: An efficient abstract domain for not necessarily closed polyhedra