The octahedron abstract domain
From MaRDI portal
Publication:859963
DOI10.1016/J.SCICO.2006.03.009zbMATH Open1171.68540OpenAlexW1968208713WikidataQ55970408 ScholiaQ55970408MaRDI QIDQ859963FDOQ859963
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cited In (17)
- Geometric construction of basis for octahedron: Modification of Wachspress method
- Incremental closure for systems of two variables per inequality
- TreeKs: A Functor to Make Numerical Abstract Domains Scalable
- Completeness of string analysis for dynamic languages
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Generalizing the Template Polyhedral Domain
- On the efficiency of convex polyhedra
- An extension of lazy abstraction with interpolation for programs with arrays
- Distributed parametric model checking timed automata under non-zenoness assumption
- Template polyhedra and bilinear optimization
- Static Analysis
- Quadtrees as an abstract domain
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Parameter synthesis for hierarchical concurrent real-time systems
- The octagon abstract domain
- Logahedra: a new weakly relational domain
- Grids: A Domain for Analyzing the Distribution of Numerical Values
This page was built for publication: The octahedron abstract domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859963)