Automatic modular abstractions for linear constraints
DOI10.1145/1480881.1480899zbMATH Open1315.68102OpenAlexW2140678594MaRDI QIDQ5261513FDOQ5261513
Authors: David Monniaux 
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1480881.1480899
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cited In (17)
- Algebraic program analysis
- Abstract interpretation of microcontroller code: intervals meet congruences
- A minimalistic look at widening operators
- Verification, Model Checking, and Abstract Interpretation
- Title not available (Why is that?)
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT
- Quadtrees as an abstract domain
- Speeding up the Constraint-Based Method in Difference Logic
- Static analysis by abstract interpretation: a mathematical programming approach
- Transfer function synthesis without quantifier elimination
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Multi-prover verification of floating-point programs
- Constructing Specialized Shape Analyses for Uniform Change
- Automatic abstraction for intervals using Boolean formulae
- Improving strategies via SMT solving
- Automatic modular abstractions for template numerical constraints
- Transfer function synthesis without quantifier elimination
Uses Software
This page was built for publication: Automatic modular abstractions for linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261513)
