RELATIONS‚ GRAPHS AND PROGRAMS

Abstract

Much emphasis has been placed in recent years on deriving or calculating programs rather than proving them correct. Adequate calculational frameworks are needed to support such an approach. This thesis explores the use of a calculus of binary relations to express and reason about graph-theoretical concepts in the context of program construction. Since graphs playa prominent role in algorithmics and have applications in many other fields such a calculational treatment of graphs via relations positively benefits the formal program construction field.