An algebraic approach to computations with progress
From MaRDI portal
Publication:299188
DOI10.1016/J.JLAMP.2015.11.009zbMATH Open1344.68076OpenAlexW2252281036WikidataQ128988484 ScholiaQ128988484MaRDI QIDQ299188FDOQ299188
Authors: Walter Guttmann
Publication date: 22 June 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.11.009
Recommendations
- scientific article; zbMATH DE number 1522643
- scientific article; zbMATH DE number 3936520
- An algebra of mixed computation
- Alcuni metodi computazionali in algebra
- scientific article; zbMATH DE number 1751719
- scientific article; zbMATH DE number 3920595
- scientific article; zbMATH DE number 3943977
- scientific article; zbMATH DE number 517393
- Prolongations and Computational Algebra
Cites Work
- Extending Sledgehammer with SMT solvers
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- An algebra of hybrid systems
- Relational algebraic semantics of deterministic and nondeterministic programs
- Isabelle/HOL. A proof assistant for higher-order logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automated verification of refinement laws
- Reasoning algebraically about loops
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Infinite executions of lazy and strict computations
- Completeness results for omega-regular algebras
- Title not available (Why is that?)
- Unifying lazy and strict computations
- Towards a typed omega algebra
- Unifying Recursion in Partial, Total and General Correctness
- Conscriptions: a new relational model for sequential computations
- Unifying theories of programming that distinguish nontermination and abort
- Automated Reasoning in Kleene Algebra
- The Linear Algebra of UTP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kleene algebra with domain
- Retrospective and Prospective for Unifying Theories of Programming
- Extended conscriptions algebraically
- Algebras for iteration and infinite computations
- Normal design algebra
- Kleene getting lazy
- Enabledness and termination in refinement algebra
Cited In (4)
Uses Software
This page was built for publication: An algebraic approach to computations with progress
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299188)