Abstract
Stratght line programs with assignment statements involving both simple and array variables are considered Two such programs are equivalent if they compute the same values as a function of the inputs. Testing the equivalence of array programs ts shown to be NP-hard If array variables are updated but never subsequently referenced, equivalence can be tested in polynomial time Programs without array varmbles can be tested for equivalence in expected linear time.
Original language | English (US) |
---|---|
Pages (from-to) | 652-666 |
Number of pages | 15 |
Journal | Journal of the ACM (JACM) |
Volume | 25 |
Issue number | 4 |
DOIs | |
State | Published - Oct 1 1978 |
Externally published | Yes |
Keywords
- array asstgnments
- data structures
- NP-complete
- semanttcs
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence