The unwind property for programs with bounded memory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3858392 (Why is no real title available?)
- scientific article; zbMATH DE number 3890697 (Why is no real title available?)
- scientific article; zbMATH DE number 3778723 (Why is no real title available?)
- scientific article; zbMATH DE number 3788603 (Why is no real title available?)
- scientific article; zbMATH DE number 3789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3492141 (Why is no real title available?)
- scientific article; zbMATH DE number 3892551 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
- Definability by programs in first-order structures
- Deterministic dynamic logic is strictly weaker than dynamic logic
- Nontrivial definability by flow-chart programs
- Theory of program structures: Schemes, semantics, verification
This page was built for publication: The unwind property for programs with bounded memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067771)