default search action
25th CONCUR 2014: Rome, Italy
- Paolo Baldan, Daniele Gorla:
CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings. Lecture Notes in Computer Science 8704, Springer 2014, ISBN 978-3-662-44583-9
25th Anniversary Talk
- Tony Hoare:
Laws of Programming: The Algebraic Unification of Theories of Concurrency. 1-6
Invited Talks
- Jane Hillston:
The Benefits of Sometimes Not Being Discrete. 7-22 - Javier Esparza:
Deterministic Negotiations: Concurrency for Free. 23-31 - Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu:
Generalized Bisimulation Metrics. 32-46
Process Calculi
- Marco Carbone, Fabrizio Montesi, Carsten Schürmann:
Choreographies, Logically. 47-62 - Elena Giachino, Naoki Kobayashi, Cosimo Laneve:
Deadlock Analysis of Unbounded Process Networks. 63-77 - Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. 78-92 - Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Bisimulations Up-to: Beyond First-Order Transition Systems. 93-108
Model Checking and Abstraction
- Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized Model Checking of Rendezvous Systems. 109-124 - Igor Konnov, Helmut Veith, Josef Widder:
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability. 125-140 - Alexander Kaiser, Daniel Kroening, Thomas Wahl:
Lost in Abstraction: Monotonicity in Multi-threaded Programs. 141-155
Synthesis
- Guy Avni, Orna Kupferman:
Synthesis from Component Libraries with Costs. 156-172 - Nicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche:
Compositional Controller Synthesis for Stochastic Games. 173-187 - Kim Guldstrand Larsen, Simon Laursen, Jirí Srba:
Synchronizing Strategies under Partial Observability. 188-202 - Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur:
Probabilistic Robust Timed Games. 203-217
Quantitative Models
- Taolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su:
Perturbation Analysis in Verification of Discrete-Time Markov Chains. 218-233 - Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Robust Synchronization in Markov Decision Processes. 234-248 - Holger Hermanns, Jan Krcál, Jan Kretínský:
Probabilistic Bisimulation: Naturally on Distributions. 249-265 - Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel:
Averaging in LTL. 266-280
Automata and Multithreading
- Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre:
Decidable Topologies for Communicating Automata with FIFO and Bag Channels. 281-296 - C. Aiswarya, Paul Gastin, K. Narayan Kumar:
Controllers for the Verification of Communicating Multi-pushdown Systems. 297-311 - Kazuhide Yasukata, Naoki Kobayashi, Kazutaka Matsuda:
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking. 312-326
Complexity
- Anthony Widjaja Lin, Sanming Zhou:
A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups. 327-341 - Yuan Feng, Lijun Zhang:
A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm. 342-356 - Reiner Hüchting, Rupak Majumdar, Roland Meyer:
Bounds on Mobility. 357-371
Process Calculi and Types
- Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
Typing Messages for Free in Security Protocols: The Case of Equivalence Properties. 372-386 - Giovanni Bernardi, Matthew Hennessy:
Using Higher-Order Contracts to Model Session Types (Extended Abstract). 387-401 - Massimo Bartoletti, Alceste Scalas, Roberto Zunino:
A Semantic Deconstruction of Session Types. 402-418 - Laura Bocchi, Weizhen Yang, Nobuko Yoshida:
Timed Multiparty Session Types. 419-434
Categories, Graphs and Quantum Systems
- Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
A Categorical Semantics of Signal Flow Graphs. 435-450 - Natsuki Urabe, Ichiro Hasuo:
Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices. 451-466 - Barbara König, Jan Stückrath:
A General Framework for Well-Structured Graph Transformation Systems. 467-481 - Yangjia Li, Mingsheng Ying:
(Un)decidable Problems about Reachability of Quantum Systems. 482-496
Automata and Time
- Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma:
Ordered Navigation on Multi-attributed Data Words. 497-511 - Karin Quaas:
Verification for Timed Automata Extended with Unbounded Discrete Data Structures. 512-526 - Shibashis Guha, Chinmay Narayan, S. Arun-Kumar:
Reducing Clocks in Timed Automata while Preserving Bisimulation. 527-543
Games
- Krishnendu Chatterjee:
Qualitative Concurrent Parity Games: Bounded Rationality. 544-559 - Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. 560-575 - Falak Sher Vira, Joost-Pieter Katoen:
Tight Game Abstractions of Probabilistic Automata. 576-591
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.