default search action
23rd CONCUR 2012: Newcastle upon Tyne, UK
- Maciej Koutny, Irek Ulidowski:
CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings. Lecture Notes in Computer Science 7454, Springer 2012, ISBN 978-3-642-32939-5
Invited Talks
- Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Turing Meets Milner. 1-20 - Gordon D. Plotkin:
Concurrency and the Algebraic Theory of Effects - (Abstract). 21-22 - Brian Randell:
A Turing Enigma. 23-36 - Peter Sewell
:
False Concurrency and Strange-but-True Machines - (Abstract). 37-38
Reachability Analysis
- Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder:
Concurrent Games on VASS with Inhibition. 39-52 - Wojciech Czerwinski, Piotr Hofman
Reachability Problem for Weak Multi-Pushdown Automata. 53-68 - Nengkun Yu
Reachability and Termination Analysis of Concurrent Quantum Programs. 69-83
Qualitative and Timed Systems
- Guy Avni, Orna Kupferman:
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. 84-99 - Sandie Balaguer, Thomas Chatain:
Avoiding Shared Clocks in Networks of Timed Automata. 100-114 - Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-Dimensional Quantitative Objectives. 115-131 - Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. 132-146
Behavioural Equivalences
- Romain Brenguier, Stefan Göller, Ocan Sankur:
A Comparison of Succinctly Represented Finite-State Systems. 147-161 - Antti Valmari:
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs. 162-176
Temporal Logics
- Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey
Quantified CTL: Expressiveness and Model Checking - (Extended Abstract). 177-192 - Fabio Mogavero
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic. 193-208
Session Types
- Tzu-Chun Chen
Specifying Stateful Asynchronous Properties for Distributed Programs. 209-224 - Julien Lange
Synthesising Choreographies from Local Session Types. 225-239
Abstraction
- Fides Aarts, Faranak Heidarian, Frits W. Vaandrager:
A Theory of History Dependent Abstractions for Learning Interface Automata. 240-255 - Alexey Gotsman, Hongseok Yang:
Linearizability with Ownership Transfer. 256-271
Mobility and Space in Process Algebras
- Romain Demangeon, Kohei Honda:
Nested Protocols in Session Types. 272-286 - Luca Fossati, Kohei Honda, Nobuko Yoshida
Intensional and Extensional Characterisation of Global Progress in the π-Calculus. 287-301 - Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Duality and i/o-Types in the π-Calculus. 302-316 - Sophia Knight
Spatial and Epistemic Modalities in Constraint-Based Process Calculi. 317-332
Stochastic Systems
- Luca Bortolussi
Fluid Model Checking. 333-347 - Taolue Chen
Playing Stochastic Games Precisely. 348-363 - Mark Timmer
Efficient Modelling and Generation of Markov Automata. 364-379 - Max Tschaikowski
Exact Fluid Lumpability for Markovian Process Algebra. 380-394
Probabilistic Systems
- Daniel Gebler, Wan J. Fokkink
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. 395-409 - Henning Kerstan, Barbara König:
Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory. 410-424
Petri Nets and Non-sequential Semantics
- Ryszard Janicki, Xiang Yin, Nadezhda Zubkova:
Modeling Interval Order Structures with Partially Commutative Monoids. 425-439 - Roland Meyer, Victor Khomenko, Reiner Hüchting:
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. 440-455 - Lukasz Mikulski
Algebraic Structure of Combined Traces. 456-470 - César Rodríguez, Stefan Schwoon:
Verification of Petri Nets with Read Arcs. 471-485
Verification
- Matthias Függer, Josef Widder
Efficient Checking of Link-Reversal-Based Concurrent Systems. 486-499 - Alexander Kaiser, Daniel Kroening
Efficient Coverability Analysis by Proof Minimization. 500-515 - Mohsen Lesani, Victor Luchangco, Mark Moir:
A Framework for Formally Verifying Software Transactional Memory Algorithms. 516-530 - Roy Mennicke:
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems. 531-546
Decidability
- Aiswarya Cyriac
MSO Decidability of Multi-Pushdown Systems via Split-Width. 547-561 - Frank S. de Boer, Mohammad Mahdi Jaghoori, Cosimo Laneve
Decidability Problems for Actor Systems. 562-577
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-12-19 22:21 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: