On the zero-inequivalence problem for loop programs

DOI10.1016/0022-0000(83)90020-XMaRDI QIDQ1171383zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra, Brian S. Leininger

Publication date 1983

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(83)90020-x

zbMATH Keywords

NP-completenessdecision problemssimple classes of loop programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)

Cites work

• scientific article; zbMATH DE number 3713182 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
• Complexity of automaton identification from given data
• On the Computational Complexity of Program Scheme Equivalence
• On the complexity of simple arithmetic expressions
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Some simplified undecidable and NP-hard problems for simple programs
• The Complexity of the Equivalence Problem for Simple Programs
• The Equivalence Problem of Simple Programs
• The complexity of theorem-proving procedures

Cited in

(1)

• On the complexity of commutativity analysis

This page was built for publication: On the zero-inequivalence problem for loop programs

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