Access-Based Localization for Octagons

DOI10.1016/j.entcs.2012.09.004zbMath1294.68050OpenAlexW2029947984WikidataQ113318061 ScholiaQ113318061MaRDI QIDQ5170168

Eva Beckschulze, Jörg Brauer, Stefan Kowalewski

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.004

zbMATH Keywords

interprocedural analysisaccess-based localizationoctagon domain

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 (2)

Compact Difference Bound Matrices ⋮ Incrementally closing octagons

Uses Software

• ASTREE

Cites Work

• Unnamed Item
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• The octagon abstract domain
• Access Analysis-Based Tight Localization of Abstract Memories
• A Scalable Segmented Decision Tree Abstract Domain
• Iterating Octagons

This page was built for publication: Access-Based Localization for Octagons