Logahedra: A New Weakly Relational Domain

  • Jacob M. Howe
  • Andy King
Conference paper

DOI: 10.1007/978-3-642-04761-9_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5799)
Cite this paper as:
Howe J.M., King A. (2009) Logahedra: A New Weakly Relational Domain. In: Liu Z., Ravn A.P. (eds) Automated Technology for Verification and Analysis. ATVA 2009. Lecture Notes in Computer Science, vol 5799. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jacob M. Howe
    • 1
  • Andy King
    • 2
    • 3
  1. 1.Department of ComputingCity University LondonUK
  2. 2.Portcullis Computer Security LimitedPinnerUK
  3. 3.Computing LaboratoryUniversity of KentCanterburyUK

Personalised recommendations