Pages that link to "Item:Q1035700"
From MaRDI portal
The following pages link to Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700):
Displaying 12 items.
- Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- On finite linear systems containing strict inequalities (Q2401512) (← links)
- Not necessarily closed convex polyhedra and the double description method (Q2576576) (← links)
- Parametric verification and test coverage for hybrid automata using the inverse method (Q2841997) (← links)
- Efficient Elimination of Redundancies in Polyhedra by Raytracing (Q2961577) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- Revisiting polyhedral analysis for hybrid systems (Q6536287) (← links)
