↓ Skip to main content

CONCUR 2010 - Concurrency Theory

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis
  3. Altmetric Badge
    Chapter 2 Applications of Shellable Complexes to Distributed Computing
  4. Altmetric Badge
    Chapter 3 Concurrency and Composition in a Stochastic World
  5. Altmetric Badge
    Chapter 4 Taming Distributed Asynchronous Systems
  6. Altmetric Badge
    Chapter 5 Trust in Anonymity Networks
  7. Altmetric Badge
    Chapter 6 Learning I/O Automata
  8. Altmetric Badge
    Chapter 7 Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification
  9. Altmetric Badge
    Chapter 8 Information Flow in Interactive Systems
  10. Altmetric Badge
    Chapter 9 From Multi to Single Stack Automata
  11. Altmetric Badge
    Chapter 10 A Geometric Approach to the Problem of Unique Decomposition of Processes
  12. Altmetric Badge
    Chapter 11 A Logic for True Concurrency
  13. Altmetric Badge
    Chapter 12 CONCUR 2010 - Concurrency Theory
  14. Altmetric Badge
    Chapter 13 Bisimilarity of One-Counter Processes Is PSPACE-Complete
  15. Altmetric Badge
    Chapter 14 Nash Equilibria for Reachability Objectives in Multi-player Timed Games
  16. Altmetric Badge
    Chapter 15 Stochastic Real-Time Games with Qualitative Timed Automata Objectives
  17. Altmetric Badge
    Chapter 16 Session Types as Intuitionistic Linear Propositions
  18. Altmetric Badge
    Chapter 17 Session Types for Access and Information Flow Control
  19. Altmetric Badge
    Chapter 18 Simulation Distances
  20. Altmetric Badge
    Chapter 19 CONCUR 2010 - Concurrency Theory
  21. Altmetric Badge
    Chapter 20 Obliging Games
  22. Altmetric Badge
    Chapter 21 Multipebble Simulations for Alternating Automata
  23. Altmetric Badge
    Chapter 22 Parameterized Verification of Ad Hoc Networks
  24. Altmetric Badge
    Chapter 23 Termination in Impure Concurrent Languages
  25. Altmetric Badge
    Chapter 24 Buffered Communication Analysis in Distributed Multiparty Sessions
  26. Altmetric Badge
    Chapter 25 Efficient Bisimilarities from Second-Order Reaction Semantics for π -Calculus
  27. Altmetric Badge
    Chapter 26 On the Use of Non-deterministic Automata for Presburger Arithmetic
  28. Altmetric Badge
    Chapter 27 Reasoning about Optimistic Concurrency Using a Program Logic for History
  29. Altmetric Badge
    Chapter 28 Theory by Process
  30. Altmetric Badge
    Chapter 29 On the Compositionality of Round Abstraction
  31. Altmetric Badge
    Chapter 30 A Linear Account of Session Types in the Pi Calculus
  32. Altmetric Badge
    Chapter 31 Generic Forward and Backward Simulations II: Probabilistic Simulation
  33. Altmetric Badge
    Chapter 32 Kleene, Rabin, and Scott Are Available
  34. Altmetric Badge
    Chapter 33 Reversing Higher-Order Pi
  35. Altmetric Badge
    Chapter 34 Modal Logic over Higher Dimensional Automata
  36. Altmetric Badge
    Chapter 35 A Communication Based Model for Games of Imperfect Information
  37. Altmetric Badge
    Chapter 36 CONCUR 2010 - Concurrency Theory
  38. Altmetric Badge
    Chapter 37 Conditional Automata: A Tool for Safe Removal of Negligible Events
  39. Altmetric Badge
    Chapter 38 Representations of Petri Net Interactions
  40. Altmetric Badge
    Chapter 39 Communicating Transactions
  41. Altmetric Badge
    Chapter 40 Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations
Attention for Chapter 29: On the Compositionality of Round Abstraction
Altmetric Badge

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
4 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.
Chapter title
On the Compositionality of Round Abstraction
Chapter number 29
Book title
CONCUR 2010 - Concurrency Theory
Published in
ADS, August 2010
DOI 10.1007/978-3-642-15375-4_29
Book ISBNs
978-3-64-215374-7, 978-3-64-215375-4
Authors

Dan R. Ghica, Mohamed N. Menaa, Ghica, Dan R., Menaa, Mohamed N.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
France 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 50%
Student > Doctoral Student 1 25%
Student > Ph. D. Student 1 25%
Readers by discipline Count As %
Computer Science 4 100%