On propositional program equivalence (extended abstract)
From MaRDI portal
Cites work
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- A coalgebraic approach to Kleene algebra with tests
- A comonadic account of behavioural covarieties of coalgebras
- A complete inference system for a class of regular behaviours
- A complete inference system for skip-free guarded Kleene algebra with tests
- A complete proof system for 1-free regular expressions modulo bisimilarity
- A completeness theorem for Kleene algebras and the algebra of regular events
- A cyclic proof system for guarded Kleene algebra with tests
- A general completeness theorem for skip-free star algebras
- BiGKAT: an algebraic framework for relational verification of probabilistic programs
- Completeness theorems for Kleene algebra with tests and top
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Efficiency of a Good But Not Linear Set Union Algorithm
- How to Write a Coequation ((Co)algebraic pearls)
- scientific article; zbMATH DE number 1688351 (Why is no real title available?)
- scientific article; zbMATH DE number 1696821 (Why is no real title available?)
- scientific article; zbMATH DE number 177804 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- scientific article; zbMATH DE number 3341950 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 2208070 (Why is no real title available?)
- Kleene algebra with domain
- Kleene algebra with equations
- Kleene algebra with hypotheses
- Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
- On star expressions and completeness theorems
- On the complexity of reasoning in Kleene algebra with commutativity conditions
- On tools for completeness of Kleene algebra with hypotheses
- Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity
- Programming Techniques: Regular expression search algorithm
- Symbolic algorithms for language equivalence and Kleene algebra with tests
- The Böhm–Jacopini Theorem Is False, Propositionally
- Towards determinism in PDL: relations and proof theory
- Two Complete Axiom Systems for the Algebra of Regular Events
This page was built for publication: On propositional program equivalence (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876470)
