default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th CONCUR 2015: Madrid, Spain
- Luca Aceto, David de Frutos-Escrig:
26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015. LIPIcs 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-91-0 - Front Matter, Table of Contents, Preface, Committees, External Reviewers. i-xiv
Invited Papers
- Roberto Di Cosmo, Michael Lienhardt, Jacopo Mauro
, Stefano Zacchiroli, Gianluigi Zavattaro, Jakub Zwolakowski:
Automatic Application Deployment in the Cloud: from Practice to Theory and Back (Invited Paper). 1-16 - James Worrell:
Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper). 17-17 - Narges Khakpour, Mohammad Reza Mousavi:
Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap (Invited Paper). 18-40 - Matthew Hennessy:
Behavioural Equivalences for Co-operating Transactions (Invited Paper). 41-41 - Alexandra Silva:
Applications of Automata and Concurrency Theory in Networks (Invited Paper). 42-43
Regular Papers
- Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier:
Distributed Local Strategies in Broadcast Networks. 44-57 - Andrea Cerone, Giovanni Bernardi, Alexey Gotsman:
A Framework for Transactional Consistency Models with Atomic Visibility. 58-71 - Salvatore La Torre, Anca Muscholl, Igor Walukiewicz:
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. 72-84 - David Harel, Guy Katz, Robby Lampert, Assaf Marron, Gera Weiss:
On the Succinctness of Idioms for Concurrent Programming. 85-99 - Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. 100-113 - Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive Synthesis Without Regret. 114-127 - Eike Best, Raymond R. Devillers:
Synthesis of Bounded Choice-Free Petri Nets. 128-141 - Jan Kretínský, Kim Guldstrand Larsen, Simon Laursen, Jirí Srba:
Polynomial Time Decidability of Weighted Synchronization under Partial Observability. 142-154 - Daniel Gebler, Simone Tini:
SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators. 155-168 - Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate, Rupak Majumdar:
Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes. 169-183 - Vojtech Forejt, Jan Krcál:
On Frequency LTL in Probabilistic Systems. 184-197 - Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. 198-211 - Sergueï Lenglet, Alan Schmitt:
Howe's Method for Contextual Semantics. 212-225 - Luca Cardelli, Mirco Tribastone, Max Tschaikowski, Andrea Vandin:
Forward and Backward Bisimulations for Chemical Reaction Networks. 226-239 - Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
Lax Bialgebras and Up-To Techniques for Weak Bisimulations. 240-253 - Taolue Chen, Fu Song, Zhilin Wu:
On the Satisfiability of Indexed Linear Temporal Logics. 254-267 - Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
Expresiveness and Complexity Results for Strategic Reasoning. 268-282 - Laura Bocchi, Julien Lange, Nobuko Yoshida:
Meeting Deadlines Together. 283-296 - Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. 297-310 - Patricia Bouyer, Samy Jaziri, Nicolas Markey:
On the Value Problem in Weighted Timed Games. 311-324 - Shaull Almagor, Guy Avni, Orna Kupferman:
Repairing Multi-Player Games. 325-339 - C. Aiswarya, Benedikt Bollig, Paul Gastin:
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. 340-353 - Ernst Moritz Hahn, Guangyuan Li, Sven Schewe, Andrea Turrini, Lijun Zhang:
Lazy Probabilistic Model Checking without Determinisation. 354-367 - Dana Fisman, Yoad Lustig:
A Modular Approach for Büchi Determinization. 368-382 - Fu Song, Weikai Miao, Geguang Pu, Min Zhang:
On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference. 383-397 - Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida:
Characteristic Bisimulation for Higher-Order Session Processes. 398-411 - Marco Carbone, Fabrizio Montesi, Carsten Schürmann, Nobuko Yoshida:
Multiparty Session Types as Coherence Proofs. 412-426 - Yuxin Deng, Yuan Feng, Ugo Dal Lago:
On Coinduction and Quantum Lambda Calculi. 427-440 - Yuan Feng, Mingsheng Ying:
Toward Automatic Verification of Quantum Cryptographic Protocols. 441-455 - César Rodríguez, Marcelo Sousa, Subodh Sharma, Daniel Kroening:
Unfolding-based Partial Order Reduction. 456-469 - Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of Population Protocols. 470-482 - Ivan Gavran, Filip Niksic, Aditya Kanade, Rupak Majumdar, Viktor Vafeiadis:
Rely/Guarantee Reasoning for Asynchronous Programs. 483-496 - David Baelde, Stéphanie Delaune, Lucca Hirschi:
Partial Order Reduction for Security Protocols. 497-510
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 2025-02-18 01:23 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:
