TreeKs: A Functor to Make Numerical Abstract Domains Scalable

DOI10.1016/j.entcs.2012.09.005zbMath1294.68051OpenAlexW2094838107WikidataQ113318060 ScholiaQ113318060MaRDI QIDQ5170170

Mehdi Bouaziz

Publication date: 22 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2012.09.005

zbMATH Keywords

abstract interpretationabstract numerical domainsweakly relational domains

Mathematics Subject Classification ID

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

Related Items

Sparsity preserving algorithms for octagons

Uses Software

• ASTREE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Why does Astrée scale up?
• The octagon abstract domain
• The octahedron abstract domain
• Abstract interpretation of mobile systems
• Relational Abstract Domain of Weighted Hexagons
• Two Variables per Linear Inequality as an Abstract Domain
• Logahedra: A New Weakly Relational Domain
• Verification, Model Checking, and Abstract Interpretation