On the Hoare theory of monadic recursion schemes

DOI10.1145/2603088.2603157zbMATH Open1401.68045OpenAlexW2084414320MaRDI QIDQ4635654FDOQ4635654

Authors: Konstantinos Mamouras 

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

Recommendations

• The Hoare logic of deterministic and nondeterministic monadic recursion schemes
• The complexity of monadic recursion schemes: Exponential time bounds
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• scientific article; zbMATH DE number 1670473
• scientific article; zbMATH DE number 4124985

zbMATH Keywords

Hoare logicmonadic recursion schemespropositional Hoare logicmonadic program schemessound and complete Hoare calculus

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cited In (6)

• Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism
• Title not available (Why is that?)
• Semantic Foundations for Deterministic Dataflow and Stream Processing
• Equational Theories of Abnormal Termination Based on Kleene Algebra
• Title not available (Why is that?)
• The complexity of monadic recursion schemes: Exponential time bounds

This page was built for publication: On the Hoare theory of monadic recursion schemes

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