REGULAR EXPRESSIONS AND THE EQUIVALENCE OF PROGRAMS,
Abstract
The strong equivalence of ALGOL-like programs is, in general, an undecidable property. Several mechanical procedures are discussed which nevertheless are useful in the detection of strong equivalence. These methods depend on a regular expression representation of programs. An unorthodox semantics for these expressions is introduced which appreciably adds to the ability to detect strong equivalence. Several other methods of extending this ability are also discussed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1968
- Accession Number
- AD0675648
Entities
People
- Donald M. Kaplan
Organizations
- Stanford University