Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
From MaRDI portal
Publication:988565
DOI10.1016/j.scico.2009.04.004zbMath1197.68035OpenAlexW1974133806MaRDI QIDQ988565
Manuel Fähndrich, Francesco Logozzo
Publication date: 18 August 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2009.04.004
static analysisabstract interpretationabstract domains.NET frameworkbounds checkingnumerical domains
Related Items
Relational string abstract domains, A flow-insensitive-complete program representation, Incremental closure for systems of two variables per inequality, Generalizing the Template Polyhedral Domain, Generic Abstraction of Dictionaries and Arrays, Sweeping in Abstract Interpretation, Exact join detection for convex polyhedra and other numerical abstractions, Widening and narrowing operators for abstract interpretation, Static Contract Checking with Abstract Interpretation, Template polyhedra and bilinear optimization
Uses Software
Cites Work
- Some ways to reduce the space dimension in polyhedra computations
- The octagon abstract domain
- The octahedron abstract domain
- Affine relationships among variables of a program
- Two Variables per Linear Inequality as an Abstract Domain
- Grammar Analysis and Parsing by Abstract Interpretation
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Static Analysis of String Manipulations in Critical Embedded C Programs
- Verification: Theory and Practice
- Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes
- The Constraint Database Approach to Software Verification
- Verification, Model Checking, and Abstract Interpretation
- Static Analysis by Policy Iteration on Relational Domains
- Static Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
