A note on the inversion join for polyhedral analysis

DOI10.1016/J.ENTCS.2010.09.010MaRDI QIDQ2814111zbMATH OpenOpenAlexFDO

Authors Axel Simon

Publication date 17 June 2016

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

zbMATH Keywords

abstract interpretationconvex hullpolyhedra analysis

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Exact join detection for convex polyhedra and other numerical abstractions
• Speeding up polyhedral analysis by identifying common constraints
• Generalizing the template polyhedral domain
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cites work

• A canonical form for generalized linear constraints
• Abstract interpretation and application to logic programs
• Logahedra: a new weakly relational domain
• Not necessarily closed convex polyhedra and the double description method
• Programming Languages and Systems
• Splitting the Control Flow with Boolean Flags
• Static Analysis
• The octagon abstract domain
• Two variables per linear inequality as an abstract domain
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(3)

• On the efficiency of convex polyhedra
• Speeding up polyhedral analysis by identifying common constraints
• An accurate join for zonotopes, preserving affine input/output relations

Describes a project that uses

Uses Software

• GLPK

This page was built for publication: A note on the inversion join for polyhedral analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814111)