On the zero-inequivalence problem for loop programs

DOI10.1016/0022-0000(83)90020-XzbMATH Open0498.68030OpenAlexW1974546986MaRDI QIDQ1171383FDOQ1171383

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

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

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)