Relational and Algebraic Methods in Computer Science

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

ISBN: 978-3-319-06250-1 (Print) 978-3-319-06251-8 (Online)

Table of contents (27 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Concurrent Kleene Algebras and Related Formalisms

    1. No Access

      Book Chapter

      Pages 1-18

      Developments in Concurrent Kleene Algebra

    2. No Access

      Book Chapter

      Pages 19-36

      Endowing Concurrent Kleene Algebra with Communication Actions

    3. No Access

      Book Chapter

      Pages 37-48

      Concurrent Kleene Algebra with Tests

    4. No Access

      Book Chapter

      Pages 49-64

      Algebras for Program Correctness in Isabelle/HOL

    5. No Access

      Book Chapter

      Pages 65-82

      Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages

    6. No Access

      Book Chapter

      Pages 83-100

      A Modified Completeness Theorem of KAT and Decidability of Term Reducibility

    7. No Access

      Book Chapter

      Pages 101-118

      Kleene Algebra with Converse

  3. Reasoning About Computations and Programs

    1. No Access

      Book Chapter

      Pages 119-138

      Preparing Relational Algebra for “Just Good Enough” Hardware

    2. No Access

      Book Chapter

      Pages 139-156

      Extended Conscriptions Algebraically

    3. No Access

      Book Chapter

      Pages 157-172

      Abstract Dynamic Frames

    4. No Access

      Book Chapter

      Pages 173-190

      Automated Verification of Relational While-Programs

    5. No Access

      Book Chapter

      Pages 191-207

      On Faults and Faulty Programs

    6. No Access

      Book Chapter

      Pages 208-225

      Parameterised Bisimulations: Some Applications

  4. Heterogeneous and Categorical Approaches

    1. No Access

      Book Chapter

      Pages 226-241

      A Point-Free Relation-Algebraic Approach to General Topology

    2. No Access

      Book Chapter

      Pages 242-260

      A Mechanised Abstract Formalisation of Concept Lattices

    3. No Access

      Book Chapter

      Pages 261-276

      A Sufficient Condition for Liftable Adjunctions between Eilenberg-Moore Categories

    4. No Access

      Book Chapter

      Pages 277-292

      Higher-Order Arrow Categories

    5. No Access

      Book Chapter

      Pages 293-308

      Type-2 Fuzzy Controllers in Arrow Categories

  5. Applications of Relational and Algebraic Methods

    1. No Access

      Book Chapter

      Pages 309-326

      Relation Algebra and RelView Applied to Approval Voting

    2. No Access

      Book Chapter

      Pages 327-343

      Relational Lattices

previous Page of 2