Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem

Science of Computer Programming

Volumn 38, Issue 1, 2000, Pages 1-25

  Berghammer, Rudolf ^a   Hoffmann, Thorsten ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); GRAPH THEORY; MODULA (PROGRAMMING LANGUAGE); PASCAL (PROGRAMMING LANGUAGE); THEOREM PROVING;

DIRECTED GRAPHS; RELATIONAL ALGEBRA; RELATIONAL PROGRAMMING; RICHARDSON'S THEOREM;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0034248929     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(99)00043-X     Document Type: Article

References (19)

1. R. Behnke, Prototyping relational specifications and programs with REL VIEW, in: B. Buth, R. Berg-hammer, J. Peleska, (Eds.), Tools for System Development and Verification, BISS Monographs, Vol. 1, Shaker, 1998, pp. 22-42.
2. R. Behnke, Transformational program development in the framework of relational and sequential algebras, Ph.D. Thesis, Institut für Informatik und Praktische Mathematik, Universität Kiel, 1998, (in German).
3. R. Behnke, R. Berghammer, P. Schneider, Machine support of relational computations, The Kiel RELVIEW system, Report 9711, Institut für Informatik und Praktische Mathematik, Universität Kiel, 1997.
4. Berghammer R. Combining relational calculus and the Dijkstra-Gries method for deriving relational programs. Inform. Sci. 119:1999;155-171.
5. R. Berghammer, T. Gritzne, G. Schmidt, Prototyping relational specifications using higher-order objects, J. Heering, K. Meinke, B. Möller, T. Nipkow (Eds.), Proc. Workshop "Higher Order Algebra, Logic and Term Rewriting", Lecture Notes in Computer Science, Vol. 816, Springer, Berlin, 1994, pp. 56-75.
6. Berghammer R., von Karger B. Algorithms from relational specifications. Brink C., Kahl W., Schmidt G. Relational Methods in Computer Science, Advances in Comput. Sci. 1997;131-149 Springer, Berlin.
7. Berghammer R., von Karger B., Ulke C. Relation-algebraic analysis of Petri nets with REL VIEW. Margaria T., Steffen B. Proc. 2nd Workshop "Tools and Applications for the Construction and Analysis of Systems", Lecture Notes in Computer Science. Vol. 1055:1996;49-69 Springer, Berlin.
8. Berghammer R., von Karger B., Wolf A. Relation-algebraic derivation of spanning tree algorithms. Jeuring J. Proc. 4th Conf. "Mathematics of Program Construction" Lecture Notes in Comput. Sci. 1422:1998;23-43 Springer, Berlin.
9. C. Brink, W. Kahl, G. Schmidt (Eds.), Relational methods in Computer Science, Advances in Comput. Sci., Springer, Berlin, 1997.
10. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
11. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall, Englewood Cliffs, NJ.
12. Gries D. The Science of Computer Programming. 1981. Springer, Berlin.
13. Hoare C.A.R., von Karger B. Sequential calculus. Inform. Process. Lett. 53:1995;123-130.
14. van Karger B., Berghammer R. Computing kernels in directed bichromatic graphs. Inform. Process. Lett. 62:1997;5-11.
15. F. Lindecke, Relation-algebraic investigation of problems on finite automata (in German). M.Sc. Thesis, Institut für Informatik und Praktische Mathematik, Universität Kiel, 1999.
16. von Neumann J., Morgenstern O. Theory of Games and Economic Behaviour. 1944;Princeton University Press, Princeton.
17. Richardson M. Solutions of irreflexive relations. Ann. Math. 58:1953;573-590.
18. Schmidt G., Ströhlein T. On kernels of graphs and solutions of games: a synopsis based on relations and fixpoints. SIAM J. Alg. Discrete Meth. 6:1985;54-65.
19. Schmidt G., Ströhlein T. Relations and graphs, Discr. Math. Comput. Sci., EATCS Monographs on Theoret. Comput. Sci. 1993;Springer, Berlin.