Efficient Strongly Relational Polyhedral Analysis

Sriram Sankaranarayanan, Henny B. Sipma, Zohar Manna.

Polyhedral analysis infers invariant linear equalities and inequalities of imperative programs. However, the exponential complexity of polyhedral operations such as image computation and convex hull limits the applicability of polyhedral analysis. Weakly relational domains such as intervals and octagons address the scalability issue by considering polyhedra whose constraints are drawn from a restricted, user-specified class. On the other hand, these domains rely solely on candidate expressions provided by the user. Therefore, they often fail to produce strong invariants.

We propose a polynomial time approach to strongly relational analysis. We provide efficient implementations of join and post condition operations, achieving a trade off between performance and accuracy. We have implemented a strongly relational polyhedral analyzer for a subset of the C language. Initial experimental results on benchmark examples are encouraging.

In Proc.of Verification, Model Checking and Abstract Interpretation (VMCAI'06), LNCS 3855, pp 111-125, Springer Verlag, 2006.

BibTex, Postscript, PDF. © 2006, Springer Verlag.

© Henny Sipma / sipma@cs.stanford.edu
Last modified: April 7 14:40:50 PDT 2005