Relational algebraic semantics of deterministic and nondeterministic programs

DOI10.1016/0304-3975(86)90172-6zbMATH Open0596.68019OpenAlexW2035306406MaRDI QIDQ1079010FDOQ1079010

Authors: Rudolf Berghammer, Hans Zierer 

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90172-6

Recommendations

• scientific article; zbMATH DE number 956827
• The algebra of non-deterministic programs: demonic operations, orders and axioms
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• scientific article; zbMATH DE number 1086633
• Deterministic and nondeterministic flowchart interpretations

zbMATH Keywords

correctnessprogram transformationfunctional languagedenotational semantics of programming languagesAbstract relational algebradeterministic and nondeterministic programsdeterministic language DFPnondeterministic functional language NFPrelational algebraic semantics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Relational algebraic semantics of deterministic and nondeterministic programs
• Programs as partial graphs. I: Flow equivalence and correctness
• A lattice-theoretical fixpoint theorem and its applications
• Title not available (Why is that?)
• Chain-complete posets and directed sets with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relation algebras: Concept of points and representability
• Can programming be liberated from the von Neumann style?
• On the Development of the Algebra of Functional Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (45)

• Monomorphic characterization of \(n\)-ary direct products
• A Relation-Algebraic Treatment of the Dedekind Recursion Theorem
• Title not available (Why is that?)
• Lazy Relations
• On the Structure of Demonic Refinement Algebras with Enabledness and Termination
• Nondeterministic semantics of compound diagrams
• An algebraic characterization of semantic independence
• Relations into algebras of probabilistic distributions
• Relational demonic fuzzy refinement
• Nondeterministic Fuzzy Operators
• The algebra of non-deterministic programs: demonic operations, orders and axioms
• Embedding a demonic semilattice in a relation algebra
• Kleene under a modal demonic star
• A relation-algebraic approach to multirelations and predicate transformers
• Weak \(n\)-ary relational products in allegories
• Relational heuristics for the design of deterministic programs
• Relational algebraic semantics of deterministic and nondeterministic programs
• Multi-random relation and its applications
• Title not available (Why is that?)
• Relation-algebraic semantics
• An algebraic approach to computations with progress
• A relation algebraic model of robust correctness
• Relational computation of sets of relations
• Algebras for iteration and infinite computations
• Deterministic and nondeterministic flowchart interpretations
• Abstract representation theorems for demonic refinement algebras
• Relational semantics revisited
• Normal design algebra
• Relation-algebraic verification of disjoint-set forests
• Title not available (Why is that?)
• Finite representability of semigroups with demonic refinement
• Relational concurrent refinement. II: Internal operations and outputs
• Relation algebraic domain constructions
• 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
• On Automating the Calculus of Relations
• Infinite executions of lazy and strict computations
• Parallel composition and decomposition of specifications
• 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
• Demonic operators and monotype factors
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• 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)