Combining relational calculus and the Dijkstra-Gries method for deriving relational programs

DOI10.1016/S0020-0255(99)00012-2zbMath0943.68032OpenAlexW1970275691MaRDI QIDQ1961862

Rudolf Berghammer

Publication date: 30 January 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00012-2

zbMATH Keywords

imperative programsDijkstra-Gries method

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Second-order properties of undirected graphs ⋮ Relational characterisations of paths ⋮ Applying relation algebra and RelView to solve problems on orders and lattices ⋮ Cardinality of relations and relational approximation algorithms

Uses Software

• RelView

Cites Work

• Computing kernels in directed bichromatic graphs
• Towards pointer algebra
• Relational heuristics for the design of deterministic programs
• Calculating path algorithms
• Shorter paths to graph algorithms
• A relational approach to the design of deterministic programs
• Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
• Finite Differencing of Computable Expressions
• Guarded commands, nondeterminacy and formal derivation of programs
• Programming as a Discipline of Mathematical Nature
• A Theorem on Boolean Matrices
• Boolean Algebras with Operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item