| 2014 | Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking. | Kazuhide Yasukata, Naoki Kobayashi, Kazutaka Matsuda |
| 2014 | Tight Game Abstractions of Probabilistic Automata. | Falak Sher Vira, Joost-Pieter Katoen |
| 2014 | Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices. | Natsuki Urabe, Ichiro Hasuo |
| 2014 | Trees from Functions as Processes. | Davide Sangiorgi, Xian Xu |
| 2014 | Verification for Timed Automata Extended with Unbounded Discrete Data Structures. | Karin Quaas |
| 2014 | Probabilistic Robust Timed Games. | Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur |
| 2014 | Bisimulations Up-to: Beyond First-Order Transition Systems. | Jean-Marie Madiot, Damien Pous, Davide Sangiorgi |
| 2014 | (Un)decidable Problems about Reachability of Quantum Systems. | Yangjia Li, Mingsheng Ying |
| 2014 | A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups. | Anthony Widjaja Lin, Sanming Zhou |
| 2014 | Synchronizing Strategies under Partial Observability. | Kim Guldstrand Larsen, Simon Laursen, Jir Srba |
| 2014 | On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability. | Igor Konnov, Helmut Veith, Josef Widder |
| 2014 | A General Framework for Well-Structured Graph Transformation Systems. | Barbara Knig, Jan Stckrath |
| 2014 | Bounds on Mobility. | Reiner Hchting, Rupak Majumdar, Roland Meyer |
| 2014 | Laws of Programming: The Algebraic Unification of Theories of Concurrency. | Tony Hoare |
| 2014 | The Benefits of Sometimes Not Being Discrete. | Jane Hillston |
| 2014 | Probabilistic Bisimulation: Naturally on Distributions. | Holger Hermanns, Jan Krcl, Jan Kretnsk |
| 2014 | Reducing Clocks in Timed Automata while Preserving Bisimulation. | Shibashis Guha, Chinmay Narayan, S. Arun-Kumar |
| 2014 | Deadlock Analysis of Unbounded Process Networks. | Elena Giachino, Naoki Kobayashi, Cosimo Laneve |
| 2014 | A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm. | Yuan Feng, Lijun Zhang |
| 2014 | Deterministic Negotiations: Concurrency for Free. | Javier Esparza |
| 2014 | Ordered Navigation on Multi-attributed Data Words. | Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma |
| 2014 | Decidable Topologies for Communicating Automata with FIFO and Bag Channels. | Lorenzo Clemente, Frdric Herbreteau, Grgoire Sutre |
| 2014 | Typing Messages for Free in Security Protocols: The Case of Equivalence Properties. | Rmy Chrtien, Vronique Cortier, Stphanie Delaune |
| 2014 | Perturbation Analysis in Verification of Discrete-Time Markov Chains. | Taolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su |
| 2014 | Generalized Bisimulation Metrics. | Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu |