Logahedra: A New Weakly Relational Domain

DOI10.1007/978-3-642-04761-9_23zbMath1262.68122OpenAlexW2153454313MaRDI QIDQ3648708

Jacob M. Howe, Andy King

Publication date: 1 December 2009

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/37591/1/content.pdf

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

On the efficiency of convex polyhedra ⋮ Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration ⋮ Runtime verification of embedded real-time systems ⋮ Incremental closure for systems of two variables per inequality ⋮ Generalizing the Template Polyhedral Domain ⋮ The Abstract Domain of Parallelotopes ⋮ TreeKs: A Functor to Make Numerical Abstract Domains Scalable ⋮ Quadtrees as an Abstract Domain ⋮ A Note on the Inversion Join for Polyhedral Analysis

Uses Software

• HyTech

Cites Work

• Unnamed Item
• The octagon abstract domain
• The octahedron abstract domain
• A linear algorithm for integer programming in the plane
• HyTech: A model checker for hybrid systems
• Two Variables per Linear Inequality as an Abstract Domain
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Static Analysis

This page was built for publication: Logahedra: A New Weakly Relational Domain