Program analysis using binary relations

Authors:
Adam Brooks Webber
Affiliations:
Westerm Illinois University
Venue:
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Year:
1997

Citing 8
Cited 2

Constant propagation with conditional branches

ACM Transactions on Programming Languages and Systems (TOPLAS)
Static analysis of linear congruence equalities among variables of a program

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Abstract interpretation and application to logic programs

Journal of Logic Programming
Improving abstract interpretations by combining domains

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimization of functional programs by grammar thinning

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation

ACM Computing Surveys (CSUR)
Proving Theorems about LISP Functions

Journal of the ACM (JACM)
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

Static caching for incremental computation

ACM Transactions on Programming Languages and Systems (TOPLAS)
What is a class invariant?

PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method called relational constraint for finding binary relations among the variables and constants of a program. The method constructs a table of binary relations and treats the program as a collection of constraints on tuples of relations in the table. An experimental optimizer called Thinner uses this method to analyze programs of size n in O(n2) time.