Block-wise abstract interpretation by combining abstract domains with SMT
DOI10.1007/978-3-319-52234-0_17zbMATH Open1484.68049OpenAlexW2570631725MaRDI QIDQ2961574FDOQ2961574
Authors: Jiahong Jiang, Liqian Chen, Xueguang Wu, Ji Wang 
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-52234-0_17
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)
Cites Work
- From under-approximations to over-approximations and back
- Why does Astrée scale up?
- The octagon abstract domain
- Boxes: A Symbolic Abstract Domain of Boxes
- Title not available (Why is that?)
- Inferring Min and Max Invariants Using Max-Plus Polyhedra
- Verification, Model Checking, and Abstract Interpretation
- The reduced product of abstract domains and the combination of decision procedures
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Symbolic optimization with SMT solvers
- Verification, Model Checking, and Abstract Interpretation
- Automatic modular abstractions for linear constraints
- Donut domains: efficient non-convex domains for abstract interpretation
- Automatic modular abstractions for template numerical constraints
- Linear absolute value relation analysis
Uses Software
This page was built for publication: Block-wise abstract interpretation by combining abstract domains with SMT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961574)
