A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis

Authors:
Helmut Seidl;Vesal Vojdani;Varmo Vene
Affiliations:
Lehrstuhl für Informatik II, Technische Universität München, Garching b. München, Germany D-85748;Lehrstuhl für Informatik II, Technische Universität München, Garching b. München, Germany D-85748;Deptartment of Computer Science, University of Tartu, Tartu, Estonia EE-50409
Venue:
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Year:
2009

Citing 20
Cited 0

The value flow graph: a program representation for optimal program transformations

Proceedings of the third European symposium on programming on ESOP '90
Interprocedural may-alias analysis for pointers: beyond k-limiting

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Interprocedural pointer alias analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Interface Compatibility Checking for Software Modules

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Linear unification

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Precise interprocedural analysis through linear algebra

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Power of 10: Rules for Developing Safety-Critical Code

Computer
Conditional must not aliasing for static race detection

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of modular arithmetic

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
MUVI: automatically inferring multi-variable access correlations and detecting related semantic and concurrency bugs

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Region Analysis for Race Detection

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Computing procedure summaries for interprocedural analysis

ESOP'07 Proceedings of the 16th European conference on Programming
An abstract domain for analyzing heap-manipulating low-level software

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Upper adjoints for fast inter-procedural variable equalities

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Existential label flow inference via CFL reachability

SAS'06 Proceedings of the 13th international conference on Static Analysis
Checking herbrand equalities and beyond

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Interprocedural herbrand equalities

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Assertion checking over combined abstraction of linear arithmetic and uninterpreted functions

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new domain for analyzing must -equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us to describe field accesses and array indexing. While the full combination of uninterpreted functions with affine arithmetics results in intractable assertion checking algorithms, our restricted domain allows us to construct an analysis of address must -equalities that runs in polynomial time. We indicate how this analysis can be applied to infer access patterns in programs manipulating arrays and structs.