CONCUR 2010 - Concurrency Theory [electronic resource] : 21st International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010, Proceedings /
International Conference on Concurrency Theory(21st :2010 :Paris, France)
Gastin, Paul.editor.
Laroussinie, Francois.editor.
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references and index.
Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis -- Applications of Shellable Complexes to Distributed Computing -- Concurrency and Composition in a Stochastic World -- Taming Distributed Asynchronous Systems -- Trust in Anonymity Networks -- Learning I/O Automata -- Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification -- Information Flow in Interactive Systems -- From Multi to Single Stack Automata -- A Geometric Approach to the Problem of Unique Decomposition of Processes -- A Logic for True Concurrency -- A Theory of Design-by-Contract for Distributed Multiparty Interactions -- Bisimilarity of One-Counter Processes Is PSPACE-Complete -- Nash Equilibria for Reachability Objectives in Multi-player Timed Games -- Stochastic Real-Time Games with Qualitative Timed Automata Objectives -- Session Types as Intuitionistic Linear Propositions -- Session Types for Access and Information Flow Control -- Simulation Distances -- Mean-Payoff Automaton Expressions -- Obliging Games -- Multipebble Simulations for Alternating Automata -- Parameterized Verification of Ad Hoc Networks -- Termination in Impure Concurrent Languages -- Buffered Communication Analysis in Distributed Multiparty Sessions -- Efficient Bisimilarities from Second-Order Reaction Semantics for ?-Calculus -- On the Use of Non-deterministic Automata for Presburger Arithmetic -- Reasoning about Optimistic Concurrency Using a Program Logic for History -- Theory by Process -- On the Compositionality of Round Abstraction -- A Linear Account of Session Types in the Pi Calculus -- Generic Forward and Backward Simulations II: Probabilistic Simulation -- Kleene, Rabin, and Scott Are Available -- Reversing Higher-Order Pi -- Modal Logic over Higher Dimensional Automata -- A Communication Based Model for Games of Imperfect Information -- Flat Coalgebraic Fixed Point Logics -- Conditional Automata: A Tool for Safe Removal of Negligible Events -- Representations of Petri Net Interactions -- Communicating Transactions -- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations.
Software engineering.
Computer logic.
Computer communication systems.
Programming languages (Electronic computers).
Application software.
Software Engineering/Programming and Operating Systems.
Software Engineering.
Logics and Meanings of Programs.
Computer Communication Networks.
Programming Languages, Compilers, Interpreters.
Information Systems Applications (incl. Internet).

Lecture Notes in Computer Science