Logahedra: A New Weakly Relational Domain

Authors:
Jacob M. Howe;Andy King
Affiliations:
Department of Computing, City University London, UK EC1V 0HB;Portcullis Computer Security Limited, Pinner, UK HA5 2EX and Computing Laboratory, University of Kent, Canterbury, UK CT2 7NF
Venue:
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Year:
2009

Citing 12
Cited 11

Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient verification of real-time systems: compact data structure and state-space reduction

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
An $n^{log n}$ algorithm for the two-variable-per-constraint linear programming satisfiability problem

An $n^{log n}$ algorithm for the two-variable-per-constraint linear programming satisfiability problem
A linear algorithm for integer programming in the plane

Mathematical Programming: Series A and B
The octagon abstract domain

Higher-Order and Symbolic Computation
The octahedron abstract domain

Science of Computer Programming
Pentagons: a weakly relational abstract domain for the efficient validation of array accesses

Proceedings of the 2008 ACM symposium on Applied computing
Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities

Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities
Integer Polyhedra for Program Analysis

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Two variables per linear inequality as an abstract domain

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Scalable analysis of linear systems using mathematical programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Exploiting sparsity in polyhedral analysis

SAS'05 Proceedings of the 12th international conference on Static Analysis

Quadtrees as an Abstract Domain

Electronic Notes in Theoretical Computer Science (ENTCS)
A Note on the Inversion Join for Polyhedral Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
Simple and precise widenings for H-polyhedra

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Generalizing the template polyhedral domain

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Past time LTL runtime verification for microcontroller binary code

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Automatic abstraction for congruences

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
The Abstract Domain of Parallelotopes

Electronic Notes in Theoretical Computer Science (ENTCS)
TreeKs: A Functor to Make Numerical Abstract Domains Scalable

Electronic Notes in Theoretical Computer Science (ENTCS)
Polyhedral analysis using parametric objectives

SAS'12 Proceedings of the 19th international conference on Static Analysis
Abstract acceleration of general linear loops

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Runtime verification of microcontroller binary code

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popular weakly relational domains such as bounded differences and octagons have found application in model checking and abstract interpretation. This paper introduces logahedra, which are more expressiveness than octagons, but less expressive than arbitrary systems of two variable per inequality constraints. Logahedra allow coefficients of inequalities to be powers of two whilst retaining many of the desirable algorithmic properties of octagons.