Skip to main content
  • Conference proceedings
  • © 2004

CONCUR 2004 -- Concurrency Theory

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

Editors:

(view affiliations)

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

Conference series link(s): CONCUR: International Conference on Concurrency Theory

Conference proceedings info: CONCUR 2004.

Buying options

eBook
USD 109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-28644-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 139.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. Invited Papers

    1. Zing: Exploiting Program Structure for Model Checking Concurrent Software

      • Tony Andrews, Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof, Yichen Xie
      Pages 1-15
    2. A Semantics for Concurrent Separation Logic

      • Stephen Brookes
      Pages 16-34
    3. A Survey of Regular Model Checking

      • Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
      Pages 35-48
    4. Resources, Concurrency and Local Reasoning

      • Peter W. O’Hearn
      Pages 49-67
  3. Accepted Papers

    1. Resource Control for Synchronous Cooperative Threads

      • Roberto M. Amadio, Silvano Dal Zilio
      Pages 68-82
    2. Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

      • Paolo Baldan, Andrea Corradini, Barbara König
      Pages 83-98
    3. The Pros and Cons of Netcharts

      • Nicolas Baudru, Rémi Morin
      Pages 99-114
    4. Characterizing EF and EX Tree Logics

      • Mikołaj Bojańczyk, Igor Walukiewicz
      Pages 131-145
    5. Message-Passing Automata Are Expressively Equivalent to EMSO Logic

      • Benedikt Bollig, Martin Leucker
      Pages 146-160
    6. Symbolic Bisimulation in the Spi Calculus

      • Johannes Borgström, Sébastien Briais, Uwe Nestmann
      Pages 161-176
    7. A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps

      • Liana Bozga, Cristian Ene, Yassine Lakhnech
      Pages 177-192
    8. Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems

      • Tomáš Brázdil, Antonín Kučera, Oldřich Stražovský
      Pages 193-208
    9. μABC: A Minimal Aspect Calculus

      • Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely
      Pages 209-224
    10. Type Based Discretionary Access Control

      • Michele Bugliesi, Dario Colazzo, Silvia Crafa
      Pages 225-239
    11. Modular Construction of Modal Logics

      • Corina Cîrstea, Dirk Pattinson
      Pages 258-275
    12. Verification by Network Decomposition

      • Edmund Clarke, Muralidhar Talupur, Tayssir Touili, Helmut Veith
      Pages 276-291
    13. Reversible Communicating Systems

      • Vincent Danos, Jean Krivine
      Pages 292-307

Other Volumes

  1. CONCUR 2004 - Concurrency Theory

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

Keywords

  • Algorithms
  • algorithm
  • concurrency
  • distributed programming
  • logic
  • logic programming
  • model checking
  • petri net
  • programming
  • real-time
  • verification

Editors and Affiliations

  • Department of Computing, Imperial College London, London, UK

    Philippa Gardner

  • Department of Computing, Imperial College, London, UK

    Nobuko Yoshida

Bibliographic Information

Buying options

eBook
USD 109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-28644-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 139.00
Price excludes VAT (USA)