On the Simplification and Equivalence Problems for Straight-Line Programs

DOI10.1145/2402.322396MaRDI QIDQ3763569zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra, Brian S. Leininger

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

decidabilityundecidabilityHilbert's tenth problemone-equivalence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3883587
• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• scientific article; zbMATH DE number 4172382
• Program schemes with constants
• The equivalence problem and correctness formulas for a simple class of programs

Cited in

(6)

• The Extraordinary Power of Division in Straight Line Programs
• Straight-line instruction sequence completeness for total calculation on cancellation meadows
• On the complexity of commutativity analysis
• scientific article; zbMATH DE number 3883587 (Why is no real title available?)
• On the Shortest Linear Straight-Line Program for Computing Linear Forms
• A note on simple programs with two variables

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763569)