Two Variables per Linear Inequality as an Abstract Domain

DOI10.1007/3-540-45013-0_7zbMath1278.68072OpenAlexW1957766372MaRDI QIDQ3079912

Jacob M. Howe, Andy King, Axel Simon

Publication date: 4 March 2011

Published in: Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: http://openaccess.city.ac.uk/1709/1/Two_variables_per_linear_inequality_as_an_abstract_domain.pdf

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (28)

Experimental evaluation of numerical domains for inferring ranges ⋮ On the efficiency of convex polyhedra ⋮ The octagon abstract domain ⋮ Descending chains and narrowing on template abstract domains ⋮ Discovering invariants via simple component analysis ⋮ Analyzing fractional Horn constraint systems ⋮ Splitting the Control Flow with Boolean Flags ⋮ A combinatorial algorithm for Horn programs ⋮ The two variable per inequality abstract domain ⋮ Incremental closure for systems of two variables per inequality ⋮ Linear Absolute Value Relation Analysis ⋮ Generalizing the Template Polyhedral Domain ⋮ TreeKs: A Functor to Make Numerical Abstract Domains Scalable ⋮ Generic Abstraction of Dictionaries and Arrays ⋮ Sweeping in Abstract Interpretation ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ On integer closure in a system of unit two variable per inequality constraints ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ Static Contract Checking with Abstract Interpretation ⋮ Narrowing Operators on Template Abstract Domains ⋮ On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems ⋮ Range and Set Abstraction using SAT ⋮ Relational Abstract Domain of Weighted Hexagons ⋮ Quadtrees as an Abstract Domain ⋮ A Note on the Inversion Join for Polyhedral Analysis ⋮ Completeness of string analysis for dynamic languages ⋮ Logahedra: A New Weakly Relational Domain ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems

Uses Software

• Octagon

This page was built for publication: Two Variables per Linear Inequality as an Abstract Domain