The Interprocedural Coincidence Theorem

The Interprocedural Coincidence Theorem (1992)

by Jens Knoop , Bernhard Steffen

Venue:	In Int. Conf. on Comp. Construct
Citations:	82 - 11 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Interprocedural Coincidence Theorem	INFERENCE
AUTHOR NAME	Jens Knoop	SVM HeaderParse 0.1
AUTHOR AFFIL	y	SVM HeaderParse 0.2
AUTHOR NAME	Bernhard Steffen	SVM HeaderParse 0.1
AUTHOR AFFIL	; z; Ullman [KU].; 2	SVM HeaderParse 0.2
ABSTRACT	We present an interprocedural generalization of the well-known (intraprocedural) Coincidence Theorem of Kam and Ullman, which provides a sufficient condition for the equivalence of the meet over all paths (MOP ) solution and the maximal fixed point (MFP ) solution to a data flow analysis problem. This generalization covers arbitrary imperative programs with recursive procedures, global and local variables, and formal value parameters. In the absence of procedures, it reduces to the classical intraprocedural version. In particular, our stack-based approach generalizes the coincidence theorems of Barth and Sharir/Pnueli for the same setup, which do not properly deal with local variables of recursive procedures. 1 Motivation Data flow analysis is a classical method for the static analysis of programs that supports the generation of efficient object code by "optimizing" compilers (cf. [He, MJ]). For imperative languages, it provides information about the program states that may occur at s...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	In Int. Conf. on Comp. Construct	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	125--140	INFERENCE
VOLUME	641	INFERENCE
CITATIONS	20 found	ParsCit 1.0