Algebras for iteration and infinite computations
From MaRDI portal
Publication:715050
DOI10.1007/S00236-012-0162-2zbMATH Open1279.68078OpenAlexW2149537518WikidataQ128988552 ScholiaQ128988552MaRDI QIDQ715050FDOQ715050
Publication date: 15 October 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0162-2
Recommendations
Cites Work
- Extending Sledgehammer with SMT Solvers
- Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
- Relational algebraic semantics of deterministic and nondeterministic programs
- A generalized control structure and its formal definition
- Title not available (Why is that?)
- Kleene under a modal demonic star
- Fixed-point calculus
- Reasoning algebraically about loops
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Title not available (Why is that?)
- Unifying theories for logic programming
- Unifying Lazy and Strict Computations
- Unifying Recursion in Partial, Total and General Correctness
- Unifying Theories of Programming That Distinguish Nontermination and Abort
- The Linear Algebra of UTP
- Title not available (Why is that?)
- On Hoare logic and Kleene algebra with tests
- Internal axioms for domain semirings
- Normal design algebra
- Kleene getting lazy
- Title not available (Why is that?)
- General correctness: A unification of partial and total correctness
- Algebraic Notions of Termination
- Fixpoints for general correctness
- Algebras of modal operators and partial correctness
- Verification of sequential and concurrent programs
- Partial, Total and General Correctness
- General correctness algebra
- Title not available (Why is that?)
- Demonic Algebra with Domain
- Omega Algebra, Demonic Refinement Algebra and Commands
- Title not available (Why is that?)
- Unifying Correctness Statements
- Modal Design Algebra
Cited In (10)
- Title not available (Why is that?)
- Multirelations with infinite computations
- Verifying minimum spanning tree algorithms with Stone relation algebras
- An algebraic approach to computations with progress
- Title not available (Why is that?)
- Stone Relation Algebras
- Infinite executions of lazy and strict computations
- A Hierarchy of Algebras for Boolean Subsets
- Kleene star, subexponentials without contraction, and infinite computations
- Unifying Lazy and Strict Computations
Uses Software
This page was built for publication: Algebras for iteration and infinite computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715050)
