The octahedron abstract domain

DOI10.1016/j.scico.2006.03.009zbMath1171.68540OpenAlexW1968208713WikidataQ55970408 ScholiaQ55970408MaRDI QIDQ859963

Robert Clarisó, Jordi Cortadella

Publication date: 22 January 2007

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10609/109823

zbMATH Keywords

convex polyhedraabstract interpretationnumerical abstract domainsrelational abstract domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

On the efficiency of convex polyhedra ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ An extension of lazy abstraction with interpolation for programs with arrays ⋮ Incremental closure for systems of two variables per inequality ⋮ Parameter synthesis for hierarchical concurrent real-time systems ⋮ Generalizing the Template Polyhedral Domain ⋮ TreeKs: A Functor to Make Numerical Abstract Domains Scalable ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ Quadtrees as an Abstract Domain ⋮ Completeness of string analysis for dynamic languages ⋮ AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA ⋮ Logahedra: A New Weakly Relational Domain ⋮ Template polyhedra and bilinear optimization