The unwind property for programs with bounded memory

DOI10.1016/0020-0190(85)90090-0zbMath0581.68012OpenAlexW2021724803MaRDI QIDQ1067771

A. J. Kfoury

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90090-0

zbMATH Keywords

recursionlogics of programsprogram schemesdefinability by programsflowchart programstruth-table propertyunbounded memoryunwind property

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Definability by programs in first-order structures
• Theory of program structures: Schemes, semantics, verification
• Deterministic dynamic logic is strictly weaker than dynamic logic
• Nontrivial definability by flow-chart programs
• Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The unwind property for programs with bounded memory