Pages that link to "Item:Q845242"
From MaRDI portal
The following pages link to Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242):
Displayed 16 items.
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Sparsity preserving algorithms for octagons (Q1650959) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
- Compact Difference Bound Matrices (Q5056006) (← links)
- Access-Based Localization for Octagons (Q5170168) (← links)
- Transfer Function Synthesis without Quantifier Elimination (Q5892491) (← links)
