Relational 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 Papers
Published on 18. April 2006
Book
Paperback/Softback
VIII, 262 pages
978-3-540-33339-5 (ISBN)
Description
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. The 17 revised full papers presented together with 3 invited papers address foundational and methodological aspects of the calculi of relations and Kleene algebra, and their application in various areas of computer science and information processing.
More details
Series
Edition
2006 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 262 p.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
870 gr
ISBN-13
978-3-540-33339-5 (9783540333395)
DOI
10.1007/11734673
Schweitzer Classification
Content
Invited Papers.- Topological Representation of Precontact Algebras.- Relational Semantics Through Duality.- Duality Theory for Projective Algebras.- Contributed Papers.- Relational Approach to Boolean Logic Problems.- Static Analysis of Programs Using Omega Algebra with Tests.- Weak Contact Structures.- On Relational Cycles.- A Framework for Kleene Algebra with an Embedded Structure.- Non-termination in Unifying Theories of Programming.- Towards an Algebra of Hybrid Systems.- Relational Correspondences for Lattices with Operators.- Control-Flow Semantics for Assembly-Level Data-Flow Graphs.- Relational Implementation of Simple Parallel Evolutionary Algorithms.- Lattice-Based Paraconsistent Logic.- Verification of Pushdown Systems Using Omega Algebra with Domain.- wp Is wlp.- Relational Representability for Algebras of Substructural Logics.- Knuth-Bendix Completion as a Data Structure.- Quantifier Elimination in Elementary Set Theory.- Time-Dependent Contact Structures in Goguen Categories.