An array content static analysis based on non-contiguous partitions
From MaRDI portal
Publication:681352
DOI10.1016/j.cl.2016.01.005zbMath1379.68096OpenAlexW2292277329MaRDI QIDQ681352
Publication date: 30 January 2018
Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01399837/file/Liu-Rival-ComputersLanguages-2016.pdf
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Lightweight shape analysis based on physical types ⋮ Relational abstract interpretation of arrays in assembly code
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision procedures for flat array properties
- The octagon abstract domain
- Constructive versions of Tarski's fixed point theorems
- Definability of Accelerated Relations in a Theory of Arrays and Its Applications
- QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
- Reduced Product Combination of Abstract Domains for Shapes
- Lifting abstract interpreters to quantified logical domains
- Relational inductive shape analysis
- Abstraction Refinement for Quantified Array Assertions
- Scalable Shape Analysis for Systems Code
- Fluid Updates: Beyond Strong vs. Weak Updates
- Grammar Analysis and Parsing by Abstract Interpretation
- Abstraction of Arrays Based on Non Contiguous Partitions
- A framework for numeric analysis of array operations
- Tools and Algorithms for the Construction and Analysis of Systems
- A parametric segmentation functor for fully automatic and scalable array content analysis
- Precise reasoning for programs using containers
- Array Abstractions from Proofs
- Invariant Synthesis for Combined Theories
This page was built for publication: An array content static analysis based on non-contiguous partitions
