Diese Seite auf deutsch
SearchDevelopment of Graph Algorithms in Formal Calculi(inactive)
| Start date: | 01.01.2001 |
| End date: | 31.12.2002 |
| Duration: | 01.01.2001 - 31.12.2002 |
| Funded by: | Universität Augsburg |
| Local project leader: | Prof. Dr. Bernhard Möller (project leader) |
| External scientists / cooperations: |
Prof. Dr. Marcelo F. Frias (Universidad de Buenos Aires) Prof. Dr. Rudolf Berghammer (Universität zu Kiel) and others |
| Publications: | Publication list |
Abstract
The goal of the project was to find a manageable algebraic calculus that is particularly applicable to the derivation of generic and hence highly re-usable graph algorithms from their formal specifications. It turned out that, besides classical relational calculus, Kleene algebra with domain and codomain operators is very well suited for this.