Pages that link to "Item:Q853727"
From MaRDI portal
The following pages link to Some ways to reduce the space dimension in polyhedra computations (Q853727):
Displaying 11 items.
- The two variable per inequality abstract domain (Q656848) (← links)
- Timed discrete event control of parallel production lines with continuous outputs (Q939012) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- Speeding up polyhedral analysis by identifying common constraints (Q2814112) (← links)
- Stratified Static Analysis Based on Variable Dependencies (Q5170182) (← links)
- Complexity reduction of explicit MPC based on fuzzy reshaped polyhedrons for use in industrial controllers (Q6111206) (← links)
- Symbolic analysis of linear hybrid automata -- 25 years later (Q6113970) (← links)
- Clustered relational thread-modular abstract interpretation with local traces (Q6535225) (← links)
- Revisiting polyhedral analysis for hybrid systems (Q6536287) (← links)