The Hoare logic of deterministic and nondeterministic monadic recursion schemes
From MaRDI portal
Recommendations
- On the Hoare theory of monadic recursion schemes
- scientific article; zbMATH DE number 1948157
- The complexity of monadic recursion schemes: Exponential time bounds
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- Hoare's logic for nondeterministic regular programs: A nonstandard approach
Cites work
- \(L(A)=L(B)\)? A simplified decidability proof.
- A completeness theorem for Kleene algebras and the algebra of regular events
- A note on the complexity of propositional Hoare logic
- Alternation
- An axiomatic basis for computer programming
- Decidability of DPDA language equivalence via first-order grammars
- Deterministic context free languages
- Equivalence of deterministic one-counter automata is NL-complete
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- Equivalences of Pushdown Systems Are Hard
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3880670 (Why is no real title available?)
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1984270 (Why is no real title available?)
- scientific article; zbMATH DE number 2038732 (Why is no real title available?)
- scientific article; zbMATH DE number 2081092 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 2086674 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- Infinitary axiomatization of the equational theory of context-free languages
- Kleene algebra with equations
- Kleene algebra with products and iteration theories
- Language equivalence of deterministic real-time one-counter automata is NL-complete
- Netkat, semantic foundations for networks
- On Hoare logic and Kleene algebra with tests
- On the completeness of propositional Hoare logic
- Program schemes, recursion schemes, and formal languages
- Propositional dynamic logic of regular programs
- Recursive unsolvability of a problem of Thue
- Soundness and Completeness of an Axiom System for Program Verification
- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- Ten Years of Hoare's Logic: A Survey—Part I
- The equivalence problem for deterministic pushdown automata is decidable
Cited in
(8)- Scope Logic: An Extension to Hoare Logic for Pointers and Recursive Data Structures
- Synthesis of strategies using the Hoare logic of angelic and demonic nondeterminism
- Equational theories of abnormal termination based on Kleene algebra
- scientific article; zbMATH DE number 4097355 (Why is no real title available?)
- scientific article; zbMATH DE number 1956493 (Why is no real title available?)
- On the Hoare theory of monadic recursion schemes
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- The complexity of monadic recursion schemes: Exponential time bounds
This page was built for publication: The Hoare logic of deterministic and nondeterministic monadic recursion schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277914)
