Some ways to reduce the space dimension in polyhedra computations

DOI10.1007/s10703-006-0013-2zbMath1105.68107OpenAlexW2149546641MaRDI QIDQ853727

D. Merchat, Laure Gonnord, Nicolas Halbwachs

Publication date: 17 November 2006

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-006-0013-2

zbMATH Keywords

Program analysisCartesian product of polyhedraConvex polyhedraDouble descriptionLinear relation analysis

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Complexity reduction of explicit MPC based on fuzzy reshaped polyhedrons for use in industrial controllers ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ The two variable per inequality abstract domain ⋮ Timed discrete event control of parallel production lines with continuous outputs ⋮ Stratified Static Analysis Based on Variable Dependencies ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ Speeding up Polyhedral Analysis by Identifying Common Constraints ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ Incrementally closing octagons

Uses Software

• HyTech
• PPL
• PolyLib
• ASTREE
• FAST

Cites Work

• Affine relationships among variables of a program
• Automatic generation of invariants and intermediate assertions
• HyTech: A model checker for hybrid systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Algorithm for discovering the set of all the solutions of a linear programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some ways to reduce the space dimension in polyhedra computations