Detecting Equality of Variables in Programs

@inproceedings{Alpern1988DetectingEO,
  title={Detecting Equality of Variables in Programs},
  author={Bowen Alpern and Mark N. Wegman and F. Kenneth Zadeck},
  booktitle={POPL},
  year={1988}
}
paper presents an algorithm for detecting when two computations produce equivalent values. The equivalence of programs, and hence the equivalence of values, is in general undecidable. Thus, the best one can hope to do is to give an efficient algorithm that detects a large subclass of all the possible equivalences in a program. Two variables are said to be equivalent at a point p if those variables contain the same values whenever control reaches p during any possible execution of the program… CONTINUE READING
Highly Influential
This paper has highly influenced 57 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 437 citations. REVIEW CITATIONS
300 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 300 extracted citations

437 Citations

0102030'89'95'02'09'16
Citations per Year
Semantic Scholar estimates that this publication has 437 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

on Principles of Programming Languages

  • B. K. R osen, M. N. Wegman, F. K. Zadeck. Global value numbers, redundant computations. Conf. Rec. Fifteenth ACM Symp
  • Jantiary
  • 1988
Highly Influential
4 Excerpts

Technical Report CA-7002-1432

  • R. M. Shapiro, H. Saint. The Representation of Algorithms
  • Massachusetts Computer Associates, February
  • 1970
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…