Advertisement

© 2014

Relational and Algebraic Methods in Computer Science

14th International Conference, RAMiCS 2014, Marienstatt, Germany, April 28–May 1, 2014. Proceedings

  • Peter Höfner
  • Peter Jipsen
  • Wolfram Kahl
  • Martin Eric Müller
Conference proceedings RAMICS 2014

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8428)

Table of contents

  1. Front Matter
    PDF

  2. Concurrent Kleene Algebras and Related Formalisms

    1. Developments in Concurrent Kleene Algebra
      Tony Hoare, Stephan van Staden, Bernhard Möller, Georg Struth, Jules Villard, Huibiao Zhu et al.
      Pages 1-18
    2. Endowing Concurrent Kleene Algebra with Communication Actions
      Jason Jaskolka, Ridha Khedri, Qinglei Zhang
      Pages 19-36
    3. Concurrent Kleene Algebra with Tests
      Peter Jipsen
      Pages 37-48
    4. Algebras for Program Correctness in Isabelle/HOL
      Alasdair Armstrong, Victor B. F. Gomes, Georg Struth
      Pages 49-64
    5. Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
      Michael R. Laurence, Georg Struth
      Pages 65-82
    6. A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
      Takeo Uramoto
      Pages 83-100
    7. Kleene Algebra with Converse
      Paul Brunet, Damien Pous
      Pages 101-118

  3. Reasoning About Computations and Programs

    1. Preparing Relational Algebra for “Just Good Enough” Hardware
      José N. Oliveira
      Pages 119-138
    2. Extended Conscriptions Algebraically
      Walter Guttmann
      Pages 139-156
    3. Abstract Dynamic Frames
      Han-Hing Dang
      Pages 157-172
    4. Automated Verification of Relational While-Programs
      Rudolf Berghammer, Peter Höfner, Insa Stucke
      Pages 173-190
    5. On Faults and Faulty Programs
      Ali Mili, Marcelo F. Frias, Ali Jaoua
      Pages 191-207
    6. Parameterised Bisimulations: Some Applications
      S. Arun-Kumar, Divyanshu Bagga
      Pages 208-225

  4. Heterogeneous and Categorical Approaches

    1. A Point-Free Relation-Algebraic Approach to General Topology
      Gunther Schmidt
      Pages 226-241
    2. A Mechanised Abstract Formalisation of Concept Lattices
      Wolfram Kahl
      Pages 242-260
    3. A Sufficient Condition for Liftable Adjunctions between Eilenberg-Moore Categories
      Koki Nishizawa, Hitoshi Furusawa
      Pages 261-276
    4. Higher-Order Arrow Categories
      Michael Winter
      Pages 277-292
    5. Type-2 Fuzzy Controllers in Arrow Categories
      Michael Winter, Ethan Jackson, Yuki Fujiwara
      Pages 293-308

  5. Applications of Relational and Algebraic Methods

    1. Relation Algebra and RelView Applied to Approval Voting
      Rudolf Berghammer, Nikita Danilenko, Henning Schnoor
      Pages 309-326

About these proceedings

Introduction

This book constitutes the proceedings of the 14th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2014 held in Marienstatt, Germany, in April/May 2014.
The 25 revised full papers presented were carefully selected from 37 submissions. The papers are structured in specific fields on concurrent Kleene algebras and related formalisms, reasoning about computations and programs, heterogeneous and categorical approaches, applications of relational and algebraic methods, and developments related to modal logics and lattices.

Keywords

algebraic topology combinatorial optimization concurrent algorithms database theory functional constructs modal and temporal logics optimization algorithms relational database model software fault tolerance

Editors and affiliations

  • Peter Höfner
    • 1
  • Peter Jipsen
    • 2
  • Wolfram Kahl
    • 3
  • Martin Eric Müller
    • 4
  1. 1.NICTA and UNSWKensingtonAustralia
  2. 2.School of Computational SciencesChapman UniversityOrangeUSA
  3. 3.Department of Computing and SoftwareMcMaster UniversityHamiltonCanada
  4. 4.Department of Computer ScienceUniversity of AugsburgAugsburgGermany

Bibliographic information