CONCUR 2004 - Concurrency Theory

15th International Conference, London, UK, August 31 - September 3, 2004. Proceedings

Editors:

ISBN: 978-3-540-22940-7 (Print) 978-3-540-28644-8 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Papers

    1. No Access

      Book Chapter

      Pages 1-15

      Zing: Exploiting Program Structure for Model Checking Concurrent Software

    2. No Access

      Book Chapter

      Pages 16-34

      A Semantics for Concurrent Separation Logic

    3. No Access

      Book Chapter

      Pages 35-48

      A Survey of Regular Model Checking

    4. No Access

      Book Chapter

      Pages 49-67

      Resources, Concurrency and Local Reasoning

  3. Accepted Papers

    1. No Access

      Book Chapter

      Pages 68-82

      Resource Control for Synchronous Cooperative Threads

    2. No Access

      Book Chapter

      Pages 83-98

      Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

    3. No Access

      Book Chapter

      Pages 99-114

      The Pros and Cons of Netcharts

    4. No Access

      Book Chapter

      Pages 115-130

      Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi

    5. No Access

      Book Chapter

      Pages 131-145

      Characterizing EF and EX Tree Logics

    6. No Access

      Book Chapter

      Pages 146-160

      Message-Passing Automata Are Expressively Equivalent to EMSO Logic

    7. No Access

      Book Chapter

      Pages 161-176

      Symbolic Bisimulation in the Spi Calculus

    8. No Access

      Book Chapter

      Pages 177-192

      A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps

    9. No Access

      Book Chapter

      Pages 193-208

      Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems

    10. No Access

      Book Chapter

      Pages 209-224

      μABC: A Minimal Aspect Calculus

    11. No Access

      Book Chapter

      Pages 225-239

      Type Based Discretionary Access Control

    12. No Access

      Book Chapter

      Pages 240-257

      Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency

    13. No Access

      Book Chapter

      Pages 258-275

      Modular Construction of Modal Logics

    14. No Access

      Book Chapter

      Pages 276-291

      Verification by Network Decomposition

    15. No Access

      Book Chapter

      Pages 292-307

      Reversible Communicating Systems

    16. No Access

      Book Chapter

      Pages 308-324

      Parameterised Boolean Equation Systems

previous Page of 2