Sparsity preserving algorithms for octagons

DOI10.1016/j.entcs.2017.02.004zbMath1412.68040arXiv1612.00277OpenAlexW2597111350WikidataQ113317603 ScholiaQ113317603MaRDI QIDQ1650959

Jacques-Henri Jourdan

Publication date: 16 July 2018

Full work available at URL: https://arxiv.org/abs/1612.00277

zbMATH Keywords

static analysisnumerical abstract domainoctagon abstract domainstatic analyzer

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Verasco

Cites Work

• The two variable per inequality abstract domain
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• Why does Astrée scale up?
• The octagon abstract domain
• Simple and Efficient Algorithms for Octagons
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Static Analysis of Numerical Algorithms
• TreeKs: A Functor to Make Numerical Abstract Domains Scalable
• Static Analysis

This page was built for publication: Sparsity preserving algorithms for octagons