Peter Pepper

Learn More
The basic idea of the Schorr-Waite graph-marking algorithm can be precisely formulated, explained, and verified in a completely applicative (functional) programming style. Graphs are specified algebraically as objects of an abstract data type. When formulating recursive programs over such types, one can combine algebraic and algorithmic reasoning: An(More)
Source-to-source transformations have been advocated as a methodological tool for program development (cf. e.g. [Bauer 73], [Knuth 74], [Burstall, Darlington 75], [Gerhart 75], [Bauer 76], [Standish et al. 76]). Once an exact specification of a given problem has replaced an informal description of i t , a "contract" is settled. This contract version(More)