Algebras for iteration and infinite computations
From MaRDI portal
(Redirected from Publication:715050)
Recommendations
Cites work
- scientific article; zbMATH DE number 1612485 (Why is no real title available?)
- scientific article; zbMATH DE number 3551848 (Why is no real title available?)
- scientific article; zbMATH DE number 3630737 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- A generalized control structure and its formal definition
- Algebraic Notions of Termination
- Algebras of modal operators and partial correctness
- Demonic Algebra with Domain
- Extending Sledgehammer with SMT solvers
- Fixed-point calculus
- Fixpoints for general correctness
- General correctness algebra
- General correctness: A unification of partial and total correctness
- Internal axioms for domain semirings
- Kleene getting lazy
- Kleene under a modal demonic star
- Modal Design Algebra
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- Normal design algebra
- Omega Algebra, Demonic Refinement Algebra and Commands
- On Hoare logic and Kleene algebra with tests
- Partial, total and general correctness
- Reasoning algebraically about loops
- Relational algebraic semantics of deterministic and nondeterministic programs
- The Linear Algebra of UTP
- Towards a refinement algebra
- Unifying Recursion in Partial, Total and General Correctness
- Unifying correctness statements
- Unifying lazy and strict computations
- Unifying theories for logic programming
- Unifying theories of programming that distinguish nontermination and abort
- Verification of sequential and concurrent programs
Cited in
(12)- scientific article; zbMATH DE number 4060752 (Why is no real title available?)
- Multirelations with infinite computations
- An algebraic approach to computations with progress
- Verifying minimum spanning tree algorithms with Stone relation algebras
- scientific article; zbMATH DE number 4056967 (Why is no real title available?)
- Unifying correctness statements
- Unifying lazy and strict computations
- Extended conscriptions algebraically
- Infinite executions of lazy and strict computations
- A Hierarchy of Algebras for Boolean Subsets
- Kleene star, subexponentials without contraction, and infinite computations
- Stone relation algebras
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)
