Decidable problems for powerful programs

DOI10.1145/3149.3157MaRDI QIDQ3766814zbMATH OpenOpenAlexFDO

Authors Eitan M. Gurari

Publication date 1985

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

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

zbMATH Keywords

computational complexitycounter machinesPSPACE-completeequivalence problemfinite-memory programsPresburger setssolvable decision problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Decidability of NP-complete problems
• Decidability results for primitive recursive algorithms
• Decidable subcases of the equivalence problem for recursive program schemes
• On some decision problems in programming
• A decidable subclass of finitary programs
• Finitely recursive programs: decidability and bottom-up computation
• Publication:3032240
• Strong decidability and strong recognizability
• scientific article; zbMATH DE number 4130360
• Decidable higher-order unification problems

Cited in

(6)

• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• On the edge of decidability in complexity analysis of loop programs
• Temporal specifications with accumulative values
• The equivalence problem and correctness formulas for a simple class of programs
• On some decision problems in programming
• Decidability of the analysis problem for dataflow models of programs

This page was built for publication: Decidable problems for powerful programs

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