The totality problem for program schemas

DOI10.1007/BF01072151MaRDI QIDQ3675509zbMATH OpenOpenAlexFDO

Authors V. A. Nepomnyashchij

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01072151

zbMATH Keywords

monadic schemasone-way nondeterministic stack automatasolubility of totality problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Program schemata with monotone operators
• scientific article; zbMATH DE number 46687
• Decidability of equivalence in the set of program schema with monotonic and partially commutative operators
• Nondeterministic program schemata and their relation to dynamic logic
• Formal models and free program schemata

Cites work

• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• Intercalation theorems for stack languages
• On formalised computer programs

Cited in

(1)

• Schema-Guided Synthesis of Imperative Programs by Constraint Solving

This page was built for publication: The totality problem for program schemas

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