default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th CONCUR 2013: Buenos Aires, Argentina
- Pedro R. D'Argenio
, Hernán C. Melgratti:
CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings. Lecture Notes in Computer Science 8052, Springer 2013, ISBN 978-3-642-40183-1
Session 1: Invited Talks
- Lorenzo Alvisi, Edmund L. Wong:
Reasoning with MAD Distributed Systems. 1-4 - Sylvain Schmitz, Philippe Schnoebelen:
The Power of Well-Structured Systems. 5-24 - Andreas Abel, Florian Benz, Johannes Doerfert, Barbara Dörr, Sebastian Hahn, Florian Haupenthal, Michael Jacobs, Amir H. Moin, Jan Reineke, Bernhard Schommer, Reinhard Wilhelm:
Impact of Resource Sharing on Performance and Performance Prediction: A Survey. 25-43 - Joost-Pieter Katoen:
Concurrency Meets Probability: Theory and Practice - (Abstract). 44-45
Session 2: Process Semantics and Modal Transition Systems
- Martin Churchill, Peter D. Mosses, Mohammad Reza Mousavi:
Modular Semantics for Transition System Specifications with Negative Premises. 46-60 - Giovanni Bernardi, Matthew Hennessy:
Mutually Testing Processes - (Extended Abstract). 61-75 - Nikola Benes, Benoît Delahaye, Uli Fahrenberg, Jan Kretínský, Axel Legay:
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory. 76-90 - Shoham Ben-David, Marsha Chechik, Sebastián Uchitel:
Merging Partial Behaviour Models with Different Vocabularies. 91-105
Session 3: VAS and Pushdown Systems
- Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. 106-120 - Xiaojuan Cai, Mizuhito Ogawa:
Well-Structured Pushdown Systems. 121-136 - Jérôme Leroux, M. Praveen, Grégoire Sutre:
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. 137-151 - Rupak Majumdar, Zilong Wang:
Expand, Enlarge, and Check for Branching Vector Addition Systems. 152-166
Session 4: Pi Calculus and Interaction Nets
- Vasileios Koutavas, Matthew Hennessy:
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). 167-181 - Reiner Hüchting, Rupak Majumdar, Roland Meyer:
A Theory of Name Boundedness. 182-196 - Andrei Dorman, Damiano Mazza:
A Hierarchy of Expressiveness in Concurrent Interaction Nets. 197-211
Session 5: Linearizability and Verification of Concurrent Programs
- Klaus von Gleissenthall, Andrey Rybalchenko:
An Epistemic Perspective on Consistency of Concurrent Computations. 212-226 - Hongjin Liang, Jan Hoffmann, Xinyu Feng, Zhong Shao:
Characterizing Progress Properties of Concurrent Objects via Contextual Refinements. 227-241 - Thomas A. Henzinger, Ali Sezgin, Viktor Vafeiadis:
Aspect-Oriented Linearizability Proofs. 242-256 - Andrey Kupriyanov, Bernd Finkbeiner:
Causality-Based Verification of Multi-threaded Programs. 257-272
Session 6: Verifiation of Infinite Models, Model Measure and Reversibility
- Thomas A. Henzinger, Jan Otop:
From Model Checking to Model Measuring. 273-287 - Jonathan Kochems, C.-H. Luke Ong:
Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks. 288-302 - Iain Phillips, Irek Ulidowski:
Reversibility and Asymmetric Conflict in Event Structures. 303-318 - Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen:
The Power of Priority Channel Systems. 319-333
Session 7: Stochastic Models
- Shenggang Ying, Yuan Feng, Nengkun Yu, Mingsheng Ying:
Reachability Probabilities of Quantum Markov Chains. 334-348 - Holger Hermanns, Andrea Turrini:
Cost Preserving Bisimulations for Probabilistic Automata. 349-363 - Holger Hermanns, Jan Krcál, Jan Kretínský:
Compositional Verification and Optimization of Interactive Markov Chains. 364-379 - Vincent Danos, Russ Harmer, Ricardo Honorato-Zimmer:
Thermodynamic Graph-Rewriting. 380-394
Session 8: Message-Based Interacting Processes
- Dimitrios Kouzapas, Nobuko Yoshida:
Globally Governed Session Semantics. 395-409 - Vivek Nigam, Carlos Olarte, Elaine Pimentel:
A General Proof System for Modalities in Concurrent Constraint Programming. 410-424 - Fabrizio Montesi, Nobuko Yoshida:
Compositional Choreographies. 425-439 - Javier Esparza, Jörg Desel:
On Negotiation as Concurrency Primitive. 440-454
Session 9: Principles of Automatic Verification
- Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of CTL* with Constraints. 455-469 - Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse:
Proof Graphs for Parameterised Boolean Equation Systems. 470-484 - Vijay D'Silva:
Generalizing Simulation to Abstract Domains. 485-499
Session 10: Games and Control Synthesis
- Krishnendu Chatterjee, Yaron Velner:
Hyperplane Separation Technique for Multidimensional Mean-Payoff Games. 500-515 - Julian Gutierrez, Glynn Winskel:
Borel Determinacy of Concurrent Games. 516-530 - Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
A Faster Algorithm for Solving One-Clock Priced Timed Games. 531-545 - Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Controller Synthesis in Timed Automata. 546-560
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 2026-03-04 23:41 CET 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:
