Relational algebraic semantics of deterministic and nondeterministic programs
From MaRDI portal
(Redirected from Publication:1079010)
Recommendations
Cites work
- scientific article; zbMATH DE number 3731307 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (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 3322506 (Why is no real title available?)
- scientific article; zbMATH DE number 3378527 (Why is no real title available?)
- scientific article; zbMATH DE number 3070503 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- Can programming be liberated from the von Neumann style?
- Chain-complete posets and directed sets with applications
- On the Development of the Algebra of Functional Programs
- Programs as partial graphs. I: Flow equivalence and correctness
- Relation algebras: Concept of points and representability
- Relational algebraic semantics of deterministic and nondeterministic programs
Cited in
(45)- Monomorphic characterization of \(n\)-ary direct products
- Nondeterministic semantics of compound diagrams
- scientific article; zbMATH DE number 1696900 (Why is no real title available?)
- A Relation-Algebraic Treatment of the Dedekind Recursion Theorem
- Lazy Relations
- On the Structure of Demonic Refinement Algebras with Enabledness and Termination
- An algebraic characterization of semantic independence
- Relations into algebras of probabilistic distributions
- Relational demonic fuzzy refinement
- Nondeterministic Fuzzy Operators
- Embedding a demonic semilattice in a relation algebra
- The algebra of non-deterministic programs: demonic operations, orders and axioms
- Kleene under a modal demonic star
- A relation-algebraic approach to multirelations and predicate transformers
- Relational heuristics for the design of deterministic programs
- Relational algebraic semantics of deterministic and nondeterministic programs
- Weak \(n\)-ary relational products in allegories
- Multi-random relation and its applications
- Relation-algebraic semantics
- scientific article; zbMATH DE number 234027 (Why is no real title available?)
- An algebraic approach to computations with progress
- A relation algebraic model of robust correctness
- Algebras for iteration and infinite computations
- Relational computation of sets of relations
- Deterministic and nondeterministic flowchart interpretations
- Abstract representation theorems for demonic refinement algebras
- Normal design algebra
- Relational semantics revisited
- scientific article; zbMATH DE number 67020 (Why is no real title available?)
- Finite representability of semigroups with demonic refinement
- Relation-algebraic verification of disjoint-set forests
- Relation algebraic domain constructions
- Relational concurrent refinement. II: Internal operations and outputs
- A Non-probabilistic Relational Model of Probabilistic Kleene Algebras
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Parallel constructions of maximal path sets and applications to short superstrings
- Parallel composition and decomposition of specifications
- Infinite executions of lazy and strict computations
- On Automating the Calculus of Relations
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
- Generalizations of algorithms that find invariant relationships in programs over algebra of terms
- A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
- Demonic operators and monotype factors
- Logical analysis of demonic nondeterministic programs
- A generalized notion of semantic independence
This page was built for publication: Relational algebraic semantics of deterministic and nondeterministic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079010)
