Relational and Algebraic Methods in Computer Science

13th International Conference, RAMiCS 2012, Cambridge, UK, September 17-20, 2012. Proceedings

Editors:

ISBN: 978-3-642-33313-2 (Print) 978-3-642-33314-9 (Online)

Table of contents (24 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Applications to Software Specification and Correctness

    1. No Access

      Book Chapter

      Pages 1-16

      Transitive Separation Logic

    2. No Access

      Book Chapter

      Pages 17-32

      Unifying Lazy and Strict Computations

    3. No Access

      Book Chapter

      Pages 33-49

      Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming

    4. No Access

      Book Chapter

      Pages 50-65

      Towards an Algebra for Real-Time Programs

  3. Mechanised Resoning in Relational Algebras

    1. No Access

      Book Chapter

      Pages 66-81

      Automated Reasoning in Higher-Order Regular Algebra

    2. No Access

      Book Chapter

      Pages 82-97

      Towards Certifiable Implementation of Graph Transformation via Relation Categories

    3. No Access

      Book Chapter

      Pages 98-113

      Deciding Regular Expressions (In-)Equivalence in Coq

  4. Algebraic Program Derivation

    1. No Access

      Book Chapter

      Pages 114-129

      Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures

    2. No Access

      Book Chapter

      Pages 130-145

      Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings

    3. No Access

      Book Chapter

      Pages 146-161

      Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

  5. Theoretical Foundations

    1. No Access

      Book Chapter

      Pages 162-178

      Left-Handed Completeness

    2. No Access

      Book Chapter

      Pages 179-194

      On Completeness of Omega-Regular Algebras

    3. No Access

      Book Chapter

      Pages 195-206

      Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings

    4. No Access

      Book Chapter

      Pages 207-218

      Relational Representation Theorem for Powerset Quantales

    5. No Access

      Book Chapter

      Pages 219-234

      Point Axioms in Dedekind Categories

  6. Relations and Algorithms

    1. No Access

      Book Chapter

      Pages 235-247

      Two Observations in Dioid Based Model Refinement

    2. No Access

      Book Chapter

      Pages 248-263

      Relation Algebras, Matrices, and Multi-valued Decision Diagrams

    3. No Access

      Book Chapter

      Pages 264-277

      Incremental Pseudo Rectangular Organization of Information Relative to a Domain

  7. Preference Relations

    1. No Access

      Book Chapter

      Pages 278-293

      Relational Concepts in Social Choice

    2. No Access

      Book Chapter

      Pages 294-309

      An Algebra of Layered Complex Preferences

previous Page of 2