On the Simplification and Equivalence Problems for Straight-Line Programs

DOI10.1145/2402.322396zbMath0627.68013OpenAlexW1982804716MaRDI QIDQ3763569

Brian S. Leininger, Oscar H. Ibarra

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2402.322396

zbMATH Keywords

undecidabilitydecidabilityHilbert's tenth problemone-equivalence

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35)

Related Items (2)

On the complexity of commutativity analysis ⋮ Straight-line instruction sequence completeness for total calculation on cancellation meadows

This page was built for publication: On the Simplification and Equivalence Problems for Straight-Line Programs