Relational and Kleene-Algebraic Methods in Computer Science : 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, Workshop of COST Action 274: TARSKI, St. Catharines, on, Canada, February 22-26, 2005, Selected Revised Pap

by Maccaull, Wendy; Winter, Michael; Duntsch, Ivo

• ISBN13: 9783540333395
• ISBN10: 3540333398
• Format: Paperback
• Copyright: 2006-05-15
• Publisher: Springer Verlag

Summary

This book constitutes the thoroughly refereed joint postproceedings of the 8th International Seminar on Relational Methods in Computer Science, the 3rd International Workshop on Applications of Kleene Algebra, and the Workshop of COST Action 274: TARSKI, Theory and Application of Relational Structures as Knowledge Instruments, held St. Catharines, Ontario, Canada in February 2005.The 17 revised full papers presented together with 3 invited papers 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 and include such topics as static analysis of programs, representation theory, theories of programming, evolutionary algorithms, verification and quantifier elimination.

Table of Contents

Topological representation of precontact algebras	p. 1
Relational semantics through duality	p. 17
Duality theory for projective algebras	p. 33
Relational approach to Boolean logic problems	p. 48
Static analysis of programs using omega algebra with tests	p. 60
Weak contact structures	p. 73
On relational cycles	p. 83
A framework for Kleene algebra with an embedded structure	p. 96
Non-termination in unifying theories of programming	p. 108
Towards art algebra of hybrid systems	p. 121
Relational correspondences for lattices with operators	p. 134
Control-flow semantics for assembly-level data-flow graphs	p. 147
Relational implementation of simple parallel evolutionary algorithms	p. 161
Lattice-based paraconsistent logic	p. 173
Verification of pushdown systems using omega algebra with domain	p. 188
wp Is wlp	p. 200
Relational representability for algebras of substructural logics	p. 212
Knuth-Bendix completion as a data structure	p. 225
Quantifier elimination in elementary set theory	p. 237
Time-dependent contact structures in Goguen categories	p. 249
Table of Contents provided by Blackwell. All Rights Reserved.