A Note on the Inversion Join for Polyhedral Analysis

DOI10.1016/j.entcs.2010.09.010zbMath1342.68101OpenAlexW2080145430MaRDI QIDQ2814111

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

convex hullabstract interpretationpolyhedra analysis

Mathematics Subject Classification ID

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

Related Items

On the efficiency of convex polyhedra

Uses Software

• GLPK

Cites Work

• The octagon abstract domain
• A canonical form for generalized linear constraints
• Not necessarily closed convex polyhedra and the double description method
• Two Variables per Linear Inequality as an Abstract Domain
• Splitting the Control Flow with Boolean Flags
• Logahedra: A New Weakly Relational Domain
• Abstract interpretation and application to logic programs
• Programming Languages and Systems
• Verification, Model Checking, and Abstract Interpretation
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: A Note on the Inversion Join for Polyhedral Analysis