Relational and Kleene-algebraic methods in computer science : 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Germany, May 12-17, 2003 : revised selected pa

This book constitutes the thoroughly refereed joint postproceedings of the 7th International Seminar on Relational Methods in Computer Science and the 2nd International Workshop on Applications of Kleene Algebra held in Bad Malente, Germany in May 2003. The 21 revised full papers presented were carefully selected during two rounds of reviewing and improvement. The papers address foundational and methodological aspects of the calculi of relations and Kleene algebra as well as applications of such methods in various areas of computer science and information processing. Front Matter....Pages - Choice Procedures in Pairwise Comparison Multiple-Attribute Decision Making Methods....Pages 1-7 Kleene Algebra with Relations....Pages 8-20 Integrating Model Checking and Theorem Proving for Relational Reasoning....Pages 21-33 Fixed-Point Characterisation of Winning Strategies in Impartial Games....Pages 34-47 Checking the Shape Safety of Pointer Manipulations....Pages 48-61 Applying Relational Algebra in 3D Graphical Software Design....Pages 62-73 Investigating Discrete Controllability with Kleene Algebra....Pages 74-85 Tracing Relations Probabilistically....Pages 86-98 Pointer Kleene Algebra....Pages 99-111 Kleene Modules....Pages 112-123 The Categories of Kleene Algebras, Action Algebras and Action Lattices Are Related by Adjunctions....Pages 124-136 Towards a Formalisation of Relational Database Theory in Constructive Type Theory....Pages 137-148 SCAN Is Complete for All Sahlqvist Formulae....Pages 149-162 Relations and GUHA-Style Data Mining II....Pages 163-170 A Note on Complex Algebras of Semigroups....Pages 171-177 Calculational Relation-Algebraic Proofs in Isabelle/Isar....Pages 178-190 A Calculus of Typed Relations....Pages 191-201 Greedy-Like Algorithms in Modal Kleene Algebra....Pages 202-214 Rasiowa-Sikorski Style Relational Elementary Set Theory....Pages 215-226 Relational Data Analysis....Pages 227-237 Two Proof Systems for Peirce Algebras....Pages 238-251 An Institution Isomorphism for Planar Graph Colouring....Pages 252-264 Decomposing Relations into Orderings....Pages 265-277 Back Matter....Pages - This volume contains the proceedings of the 7th International Seminar on - lational Methods in Computer Science (RelMiCS 7) and the 2nd International Workshop onApplications ofKleeneAlgebra.Thecommonmeetingtookplacein Bad Malente (near Kiel), Germany,from May May 12-17,2003.Its purpose was to bring together researchers from various subdisciplines of Computer Science, Mathematics and related ?elds who use the calculi of relations and/or Kleene algebra as methodological and conceptual tools in their work. This meeting is the joint continuation of two di?erent series of meetings. Previous RelMiCS seminars were held in Schloss Dagstuhl (Germany) in J- uary 1994, Parati (Brazil) in July 1995, Hammamet (Tunisia) in January 1997, Warsaw (Poland) in September 1998, Quebec (Canada) in January 2000, and Oisterwijk (The Netherlands) in October 2001. The ?rst workshop on appli- tions of Kleene algebra was also held in Schloss Dagstuhl in February 2001. To join these two events in a common meeting was mainly motivated by the s- stantialcommoninterestsandoverlapofthetwocommunities.Wehopethatthis leads to fruitful interactions and opens new and interesting research directions We consider a pair wise comparison multiple-attribute decision making procedure that assigns to each ordered pair (x,y) ,x, y  A (the set of alternatives) a global degree of preference R(x, y).