default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th CONCUR 2016: Québec City, Canada
- Josée Desharnais, Radha Jagadeesan:
27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada. LIPIcs 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-017-0 - Front Matter, Table of Contents, Preface, Conference Organization . 0:i-0:xxii
Invited Papers
- Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, Ohad Kammar:
Bayesian Inversion by ω-Complete Cone Duality. 1:1-1:15 - Francesca Rossi:
Ethical Preference-Based Decision Support Systems. 2:1-2:7 - Marc Shapiro, Masoud Saeida Ardekani, Gustavo Petri:
Consistency in 3D. 3:1-3:14 - Junxing Yang, Radu Grosu, Scott A. Smolka, Ashish Tiwari:
Love Thy Neighbor: V-Formation as a Problem of Model Predictive Control. 4:1-4:5
Shared Memory
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo
:
The Benefits of Duality in Verifying Concurrent Programs under TSO. 5:1-5:15 - Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, Helmut Veith:
Local Linearizability for Concurrent Container-Type Data Structures. 6:1-6:15 - Giovanni Bernardi, Alexey Gotsman:
Robustness against Consistency Models with Atomic Visibility. 7:1-7:15
Verification
- Romain Brenguier:
Optimal Assumptions for Synthesis. 8:1-8:15 - Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. 9:1-9:15 - Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. 10:1-10:14 - Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the Complexity of Heterogeneous Multidimensional Games. 11:1-11:15
Algorithms and Complexity
- Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. 12:1-12:13 - Bernd Finkbeiner, Christopher Hahn:
Deciding Hyperproperties. 13:1-13:14 - Marvin Triebel, Jan Sürmeli:
Homogeneous Equations of Algebraic Petri Nets. 14:1-14:14 - Uli Schlachter:
Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable. 15:1-15:14
Distributed Systems
- Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
Decentralized Asynchronous Crash-Resilient Runtime Verification. 16:1-16:15 - Loïg Jezequel, Didier Lime:
Lazy Reachability Analysis in Distributed Systems. 17:1-17:14 - Roly Perera, Deepak Garg, James Cheney:
Causally Consistent Dynamic Slicing. 18:1-18:15 - Christina Rickmann, Christoph Wagner, Uwe Nestmann, Stefan Schmid:
Topological Self-Stabilization with Name-Passing Process Calculi. 19:1-19:15
Distances for Probabilistic Systems
- Przemyslaw Daca, Thomas A. Henzinger, Jan Kretínský, Tatjana Petrov:
Linear Distances between Markov Chains. 20:1-20:15 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
Complete Axiomatization for the Bisimilarity Distance on Markov Chains. 21:1-21:14 - Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances via Policy Iteration. 22:1-22:15
Categories
- Fredrik Dahlqvist, Vincent Danos, Ilias Garnier:
Robustly Parameterised Higher-Order Probabilistic Models. 23:1-23:15 - Natsuki Urabe, Shunsuke Shimizu, Ichiro Hasuo:
Coalgebraic Trace Semantics for Buechi and Parity Automata. 24:1-24:15 - Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
Bisimulations and Unfolding in P-Accessible Categorical Models. 25:1-25:14 - Tomasz Brengos, Marco Peressotti:
A Uniform Framework for Timed Automata. 26:1-26:15
Timed and Parametrized Systems
- S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. 27:1-27:14 - Amélie David, François Laroussinie, Nicolas Markey:
On the Expressiveness of QCTL. 28:1-28:15 - Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. 29:1-29:14 - Igor V. Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, Joseph Sifakis:
Parameterized Systems in BIP: Design and Model Checking. 30:1-30:16
Logic
- Ross Horne, Alwen Tiu, Bogdan Aman, Gabriel Ciobanu:
Private Names in Non-Commutative Logic. 31:1-31:16 - Simon Castellan, Pierre Clairambault:
Causality vs. Interleavings in Concurrent Game Semantics. 32:1-32:14 - Marco Carbone, Sam Lindley, Fabrizio Montesi, Carsten Schürmann, Philip Wadler:
Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types. 33:1-33:15 - Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. 34:1-34:15
Probability
- Konstantinos Chatzikokolakis, Catuscia Palamidessi, Valeria Vignudelli:
Up-To Techniques for Generalized Bisimulation Metrics. 35:1-35:14 - Valentina Castiglioni, Daniel Gebler, Simone Tini:
Modal Decomposition on Nondeterministic Probabilistic Processes. 36:1-36:15 - Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
Diagnosis in Infinite-State Probabilistic Systems. 37:1-37:15
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-11-20 21:08 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:
