Speeding up Polyhedral Analysis by Identifying Common Constraints

DOI10.1016/j.entcs.2010.09.011zbMath1342.68102OpenAlexW2003059679MaRDI QIDQ2814112

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

zbMATH Keywords

convex hullabstract interpretationfactoringpolyhedra analysis

Mathematics Subject Classification ID

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

Uses Software

• GLPK

Cites Work

• Unnamed Item
• Some ways to reduce the space dimension in polyhedra computations
• A canonical form for generalized linear constraints
• Not necessarily closed convex polyhedra and the double description method
• Analyzing String Buffers in C
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• A combination framework for tracking partition sizes
• Static Analysis

This page was built for publication: Speeding up Polyhedral Analysis by Identifying Common Constraints