Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
We show how to derive imperative programs for relation-based discrete structures by combining relational calculus and the Dijkstra-Gries method. Three examples are given, viz. Warshall's algorithm for transitive closures, a breadth-first-search reachability algorithm, and an algorithm for spanning trees. (C) 1999 Elsevier Science Inc. All rights reserved.
relational programs program derivation relational algebra graph theory