default search action
21st CONCUR 2010: Paris, France
- Paul Gastin, François Laroussinie:
CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Lecture Notes in Computer Science 6269, Springer 2010, ISBN 978-3-642-15374-7 - Frank S. de Boer, Mohammad Mahdi Jaghoori, Einar Broch Johnsen
:
Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis. 1-18 - Maurice Herlihy:
Applications of Shellable Complexes to Distributed Computing - (Invited Talk). 19-20 - Christian Eisentraut, Holger Hermanns, Lijun Zhang:
Concurrency and Composition in a Stochastic World. 21-39 - Anca Muscholl:
Taming Distributed Asynchronous Systems. 40-47 - Vladimiro Sassone, Sardaouna Hamadou, Mu Yang:
Trust in Anonymity Networks. 48-70 - Fides Aarts, Frits W. Vaandrager:
Learning I/O Automata. 71-85 - Parosh Aziz Abdulla, Yu-Fang Chen
Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification. 86-101 - Mário S. Alvim
Information Flow in Interactive Systems. 102-116 - Mohamed Faouzi Atig:
From Multi to Single Stack Automata. 117-131 - Thibaut Balabonski, Emmanuel Haucourt:
A Geometric Approach to the Problem of Unique Decomposition of Processes. 132-146 - Paolo Baldan, Silvia Crafa:
A Logic for True Concurrency. 147-161 - Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Yoshida
A Theory of Design-by-Contract for Distributed Multiparty Interactions. 162-176 - Stanislav Böhm, Stefan Göller, Petr Jancar
Bisimilarity of One-Counter Processes Is PSPACE-Complete. 177-191 - Patricia Bouyer, Romain Brenguier, Nicolas Markey
Nash Equilibria for Reachability Objectives in Multi-player Timed Games. 192-206 - Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák:
Stochastic Real-Time Games with Qualitative Timed Automata Objectives. 207-221 - Luís Caires, Frank Pfenning:
Session Types as Intuitionistic Linear Propositions. 222-236 - Sara Capecchi
Session Types for Access and Information Flow Control. 237-252 - Pavol Cerný, Thomas A. Henzinger, Arjun Radhakrishna:
Simulation Distances. 253-268 - Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou:
Mean-Payoff Automaton Expressions. 269-283 - Krishnendu Chatterjee, Florian Horn, Christof Löding:
Obliging Games. 284-296 - Lorenzo Clemente, Richard Mayr:
Multipebble Simulations for Alternating Automata - (Extended Abstract). 297-312 - Giorgio Delzanno, Arnaud Sangnier
Parameterized Verification of Ad Hoc Networks. 313-327 - Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Impure Concurrent Languages. 328-342 - Pierre-Malo Deniélou, Nobuko Yoshida
Buffered Communication Analysis in Distributed Multiparty Sessions. 343-357 - Pietro Di Gianantonio
Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus. 358-372 - Antoine Durand-Gasselin, Peter Habermehl:
On the Use of Non-deterministic Automata for Presburger Arithmetic. 373-387 - Ming Fu, Yong Li, Xinyu Feng, Zhong Shao
Reasoning about Optimistic Concurrency Using a Program Logic for History. 388-402 - Yuxi Fu:
Theory by Process. 403-416 - Dan R. Ghica, Mohamed Nabih Menaa:
On the Compositionality of Round Abstraction. 417-431 - Marco Giunti
A Linear Account of Session Types in the Pi Calculus. 432-446 - Ichiro Hasuo:
Generic Forward and Backward Simulations II: Probabilistic Simulation. 447-461 - Jochen Hoenicke
Kleene, Rabin, and Scott Are Available. 462-477 - Ivan Lanese
Reversing Higher-Order Pi. 478-493 - Cristian Prisacariu
Modal Logic over Higher Dimensional Automata. 494-508 - Ramaswamy Ramanujam, Sunil Easaw Simon:
A Communication Based Model for Games of Imperfect Information. 509-523 - Lutz Schröder
Flat Coalgebraic Fixed Point Logics. 524-538 - Roberto Segala
Conditional Automata: A Tool for Safe Removal of Negligible Events. 539-553 - Pawel Sobocinski
Representations of Petri Net Interactions. 554-568 - Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Communicating Transactions - (Extended Abstract). 569-583 - Tim A. C. Willemse
Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations. 584-598
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-02 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: