Relational algebraic semantics of deterministic and nondeterministic programs

DOI10.1016/0304-3975(86)90172-6zbMath0596.68019OpenAlexW2035306406MaRDI QIDQ1079010

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

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)

Related Items

Relational algebraic semantics of deterministic and nondeterministic programs, Finite representability of semigroups with demonic refinement, An algebraic approach to computations with progress, Normal design algebra, Relation-algebraic semantics, Nondeterministic Fuzzy Operators, Demonic operators and monotype factors, Parallel constructions of maximal path sets and applications to short superstrings, Abstract representation theorems for demonic refinement algebras, A Relation-Algebraic Approach to Multirelations and Predicate Transformers, A Relation-Algebraic Treatment of the Dedekind Recursion Theorem, On the Structure of Demonic Refinement Algebras with Enabledness and Termination, Lazy Relations, Relations into algebras of probabilistic distributions, Relational computation of sets of relations, Monomorphic characterization of \(n\)-ary direct products, On Automating the Calculus of Relations, Relation algebraic domain constructions, An algebraic characterization of semantic independence, Logical analysis of demonic nondeterministic programs, Embedding a demonic semilattice in a relation algebra, A generalized notion of semantic independence, Algebras for iteration and infinite computations, Relational Semantics Revisited, Relational concurrent refinement. II: Internal operations and outputs, Relational demonic fuzzy refinement, Weak \(n\)-ary relational products in allegories, Infinite executions of lazy and strict computations, Parallel composition and decomposition of specifications, Nondeterministic semantics of compound diagrams, Kleene under a modal demonic star

Cites Work

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