CONCUR 2010 - Concurrency Theory: 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010. The 35 revised full papers were carefully reviewed and selected from 107 submissions. The topics include: - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics. - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems. - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking and run-time verification.

Author(s): Frank S. de Boer, Mohammad Mahdi Jaghoori (auth.), Paul Gastin, François Laroussinie (eds.)
Series: Lecture Notes in Computer Science 6269 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 600
Tags: Software Engineering; Logics and Meanings of Programs; Computer Communication Networks; Programming Languages, Compilers, Interpreters; Information Systems Applications (incl.Internet); Artificial Intelligence (incl. Robotics)

Front Matter....Pages -
Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis....Pages 1-18
Applications of Shellable Complexes to Distributed Computing....Pages 19-20
Concurrency and Composition in a Stochastic World....Pages 21-39
Taming Distributed Asynchronous Systems....Pages 40-47
Trust in Anonymity Networks....Pages 48-70
Learning I/O Automata....Pages 71-85
Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification....Pages 86-101
Information Flow in Interactive Systems....Pages 102-116
From Multi to Single Stack Automata....Pages 117-131
A Geometric Approach to the Problem of Unique Decomposition of Processes....Pages 132-146
A Logic for True Concurrency....Pages 147-161
A Theory of Design-by-Contract for Distributed Multiparty Interactions....Pages 162-176
Bisimilarity of One-Counter Processes Is PSPACE-Complete....Pages 177-191
Nash Equilibria for Reachability Objectives in Multi-player Timed Games....Pages 192-206
Stochastic Real-Time Games with Qualitative Timed Automata Objectives....Pages 207-221
Session Types as Intuitionistic Linear Propositions....Pages 222-236
Session Types for Access and Information Flow Control....Pages 237-252
Simulation Distances....Pages 253-268
Mean-Payoff Automaton Expressions....Pages 269-283
Obliging Games....Pages 284-296
Multipebble Simulations for Alternating Automata....Pages 297-312
Parameterized Verification of Ad Hoc Networks....Pages 313-327
Termination in Impure Concurrent Languages....Pages 328-342
Buffered Communication Analysis in Distributed Multiparty Sessions....Pages 343-357
Efficient Bisimilarities from Second-Order Reaction Semantics for π -Calculus....Pages 358-372
On the Use of Non-deterministic Automata for Presburger Arithmetic....Pages 373-387
Reasoning about Optimistic Concurrency Using a Program Logic for History....Pages 388-402
Theory by Process....Pages 403-416
On the Compositionality of Round Abstraction....Pages 417-431
A Linear Account of Session Types in the Pi Calculus....Pages 432-446
Generic Forward and Backward Simulations II: Probabilistic Simulation....Pages 447-461
Kleene, Rabin, and Scott Are Available....Pages 462-477
Reversing Higher-Order Pi....Pages 478-493
Modal Logic over Higher Dimensional Automata....Pages 494-508
A Communication Based Model for Games of Imperfect Information....Pages 509-523
Flat Coalgebraic Fixed Point Logics....Pages 524-538
Conditional Automata: A Tool for Safe Removal of Negligible Events....Pages 539-553
Representations of Petri Net Interactions....Pages 554-568
Communicating Transactions....Pages 569-583
Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations....Pages 584-598
Back Matter....Pages -