↓ Skip to main content

CONCUR 2004 - Concurrency Theory

Overview of attention for book
Cover of 'CONCUR 2004 - Concurrency Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Zing: Exploiting Program Structure for Model Checking Concurrent Software
  3. Altmetric Badge
    Chapter 2 A Semantics for Concurrent Separation Logic
  4. Altmetric Badge
    Chapter 3 A Survey of Regular Model Checking
  5. Altmetric Badge
    Chapter 4 Resources, Concurrency and Local Reasoning
  6. Altmetric Badge
    Chapter 5 Resource Control for Synchronous Cooperative Threads
  7. Altmetric Badge
    Chapter 6 Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
  8. Altmetric Badge
    Chapter 7 The Pros and Cons of Netcharts
  9. Altmetric Badge
    Chapter 8 Basic Theory of Reduction Congruence forTwo Timed Asynchronous π -Calculi
  10. Altmetric Badge
    Chapter 9 Characterizing EF and EX Tree Logics
  11. Altmetric Badge
    Chapter 10 Message-Passing Automata Are Expressively Equivalent to EMSO Logic
  12. Altmetric Badge
    Chapter 11 Symbolic Bisimulation in the Spi Calculus
  13. Altmetric Badge
    Chapter 12 A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps
  14. Altmetric Badge
    Chapter 13 Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems
  15. Altmetric Badge
    Chapter 14 μ ABC: A Minimal Aspect Calculus
  16. Altmetric Badge
    Chapter 15 Type Based Discretionary Access Control
  17. Altmetric Badge
    Chapter 16 Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency
  18. Altmetric Badge
    Chapter 17 Modular Construction of Modal Logics
  19. Altmetric Badge
    Chapter 18 Verification by Network Decomposition
  20. Altmetric Badge
    Chapter 19 Reversible Communicating Systems
  21. Altmetric Badge
    Chapter 20 Parameterised Boolean Equation Systems
  22. Altmetric Badge
    Chapter 21 An Extensional Spatial Logic for Mobile Processes
  23. Altmetric Badge
    Chapter 22 Timed vs. Time-Triggered Automata
  24. Altmetric Badge
    Chapter 23 Extended Process Rewrite Systems: Expressiveness and Reachability
  25. Altmetric Badge
    Chapter 24 A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
  26. Altmetric Badge
    Chapter 25 Model Checking Timed Automata with One or Two Clocks
  27. Altmetric Badge
    Chapter 26 On Flatness for 2-Dimensional Vector Addition Systems with States
  28. Altmetric Badge
    Chapter 27 Compiling Pattern Matching in Join-Patterns
  29. Altmetric Badge
    Chapter 28 Model Checking Restricted Sets of Timed Paths
  30. Altmetric Badge
    Chapter 29 Asynchronous Games 2: The True Concurrency of Innocence
  31. Altmetric Badge
    Chapter 30 Open Maps, Alternating Simulations and Control Synthesis
  32. Altmetric Badge
    Chapter 31 CONCUR 2004 - Concurrency Theory
  33. Altmetric Badge
    Chapter 32 Session Types for Functional Multithreading
  34. Altmetric Badge
    Chapter 33 A Higher Order Modal Fixed Point Logic
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
34 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
CONCUR 2004 - Concurrency Theory
Published by
Springer Berlin Heidelberg, March 2011
DOI 10.1007/b100113
ISBNs
978-3-54-022940-7, 978-3-54-028644-8
Editors

Gardner, Philippa, Yoshida, Nobuko