The following pages link to Enea Zaffanella (Q281282):
Displaying 15 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)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- Synthesis of P-stable abstractions (Q2038042) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Precise widening operators for convex polyhedra (Q2568443) (← links)
- Not necessarily closed convex polyhedra and the double description method (Q2576576) (← links)
- (Q2767017) (← links)
- Boolean Functions for Finite-Tree Dependencies (Q2996195) (← links)
- Decomposing non-redundant sharing by complementation (Q4452616) (← links)
