Pages that link to "Item:Q3079912"
From MaRDI portal
The following pages link to Two Variables per Linear Inequality as an Abstract Domain (Q3079912):
Displaying 28 items.
- Discovering invariants via simple component analysis (Q435979) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- The octagon abstract domain (Q853733) (← 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)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Completeness of string analysis for dynamic languages (Q2051812) (← links)
- Experimental evaluation of numerical domains for inferring ranges (Q2130561) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Range and Set Abstraction using SAT (Q2814098) (← links)
- Relational Abstract Domain of Weighted Hexagons (Q2814105) (← links)
- Quadtrees as an Abstract Domain (Q2814109) (← links)
- A Note on the Inversion Join for Polyhedral Analysis (Q2814111) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- Logahedra: A New Weakly Relational Domain (Q3648708) (← links)
- TreeKs: A Functor to Make Numerical Abstract Domains Scalable (Q5170170) (← links)
- Generic Abstraction of Dictionaries and Arrays (Q5170171) (← links)
- Sweeping in Abstract Interpretation (Q5170178) (← links)
- Narrowing Operators on Template Abstract Domains (Q5206948) (← links)
