Relation-algebraic semantics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3974258 (Why is no real title available?)
- scientific article; zbMATH DE number 4020448 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 67032 (Why is no real title available?)
- scientific article; zbMATH DE number 67035 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 3537204 (Why is no real title available?)
- scientific article; zbMATH DE number 3551848 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3602653 (Why is no real title available?)
- scientific article; zbMATH DE number 3630737 (Why is no real title available?)
- scientific article; zbMATH DE number 1142325 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- scientific article; zbMATH DE number 3269000 (Why is no real title available?)
- scientific article; zbMATH DE number 3300552 (Why is no real title available?)
- scientific article; zbMATH DE number 3339390 (Why is no real title available?)
- scientific article; zbMATH DE number 3349291 (Why is no real title available?)
- scientific article; zbMATH DE number 3383513 (Why is no real title available?)
- scientific article; zbMATH DE number 3413799 (Why is no real title available?)
- scientific article; zbMATH DE number 3062907 (Why is no real title available?)
- scientific article; zbMATH DE number 3070503 (Why is no real title available?)
- A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
- A lattice-theoretical fixpoint theorem and its applications
- Boolean Algebras with Operators
- Boolean Algebras with Operators. Part I
- Demonic operators and monotype factors
- Guarded commands, nondeterminacy and formal derivation of programs
- Laws of programming
- Programs as partial graphs. I: Flow equivalence and correctness
- Programs as partial graphs. II: Recursion
- Relational algebraic semantics of deterministic and nondeterministic programs
- The origin of relation algebras in the development and axiomatization of the calculus of relations
- Varieties of relation algebras
Cited in
(22)- Nondeterministic semantics of compound diagrams
- Completeness of fair ASM refinement
- Fixpoints for general correctness
- Hyperidentities and related concepts. II
- Algebra of monotonic Boolean transformers
- Relation-algebraic verification of Prim's minimum spanning tree algorithm
- Verifying minimum spanning tree algorithms with Stone relation algebras
- A Relation Algebraic Semantics for a Lazy Functional Logic Language
- Relational semantics revisited
- Positive Fork Graph Calculus
- scientific article; zbMATH DE number 67020 (Why is no real title available?)
- Relation-algebraic verification of disjoint-set forests
- Monoids with tests and the algebra of possibly non-halting programs
- scientific article; zbMATH DE number 4098735 (Why is no real title available?)
- Normal forms for binary relations
- Unifying lazy and strict computations
- An algebraic framework for minimum spanning tree problems
- Relativized relation algebras
- Infinite executions of lazy and strict computations
- On Automating the Calculus of Relations
- Completeness of ASM refinement
- Stone relation algebras
This page was built for publication: Relation-algebraic semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350513)
