| Michael Benedikt, Rastislav Lenhardt and James Worrell. Two Variable vs. Linear Temporal Logic in Model Checking and Games |
| Hans Hüttel. Typed Psi-Calculi |
| Fu Song and Tayssir Touili. Efficient CTL Model-checking for Pushdown Systems |
| Michael Ummels and Dominik Wojtczak. The Complexity of Nash Equilibria in Limit-average Games |
| Ivan Lanese, Claudio Antares Mezzina, Alan Schmitt and Jean-Bernard Stefani. Controlling Reversibility in Higher-Order Pi |
| Jerome Leroux. The Vector Addition System Reversible Reachability Problem |
| Frédéric Herbreteau and B Srivathsan. Coarse Abstractions Make Zeno Behaviours Difficult to Detect |
| Stefan Göller and Anthony Widjaja Lin. Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems |
| Benedikt Bollig. An Automaton Over Data Words that Captures EMSO Logic |
| Vineet Kahlon. Reasoning About Threads with Bounded Lock Chains |
| Farn Wang, Chung-Hao Huang, Moshe Vardi and Fang Yu. A Temporal Logic for the Interaction of Strategies |
| Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur and Claus Thrane. Timed Automata Can Always Be Made Implementable |
| Tony Hoare, Akbar Hussain, Bernhard Möller, Peter O'Hearn, Rasmus Lerchedahl Petersen and Georg Struth. On Locality and the Exchange Law for Concurrent Processes |
| Paritosh Pandya and Simoni Shah. On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality and Deterministic Freezing |
| Silvia Crafa and Francesco Ranzato. A Spectrum of Behavioral Relations over LTSs on Probability Distributions |
| Christel Baier, Joachim Klein and Sascha Klueppelholz. A Compositional Framework for Controller Synthesis |
| Jonathan Hayman. Granularity and Concurrent Separation Logic |
| Tomas Brazdil, Jan Krcal, Jan Kretinsky and Vojtech Rehak. Fixed-delay Events in Generalized Semi-Markov Processes Revisited |
| Salvatore La Torre and Margherita Napoli. Reachability of Multistack Pushdown Systems with Scope-bounded Matching Relations |
| Wojciech Czerwinski, Piotr Hofman and Sławomir Lasota. Towards Decidability of Weak Bisimulation on Normed Commutative Context-free Processes |
| Thomas Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, Moshe Vardi and Jasmin Fisher. Dynamic Reactive Modules |
| Richard Mayr, Parosh Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukas Holik, Chih-Duo Hong and Tomas Vojnar. Advanced Ramsey-based Buchi Automata Inclusion Testing |
| M. Praveen and Kamal Lodaya. Parameterized Complexity Results for 1-safe Petri Nets |
| Lars Kuhtz and Bernd Finkbeiner. Weak Kripke Structures and LTL |
| Romain Demangeon and Kohei Honda. Full Abstraction in a Subtyped Pi-Calculus with Linear Types |
| Byron Cook, Christoph Haase, Joel Ouaknine, Matthew Parkinson and James Worrell. Tractable Reasoning in a Fragment of Separation Logic |
| Cesar Rodriguez, Stefan Schwoon and Paolo Baldan. Efficient Contextual Unfolding |
| Lei Song, Lijun Zhang and Jens Chr. Godskesen. Bisimulations Meet PCTL Equivalences for Probabilistic Automata |
| Ruggero Lanotte and Massimo Merro. Semantic Analysis of Gossip Protocols for Wireless Sensor Networks |
| Roberto Bruni, Hernan Melgratti and Ugo Montanari. A Connector Algebra for P/T Petri Nets Interactions |
| Joel Ouaknine, Hristina Palikareva, Bill Roscoe and James Worrell. Static Livelock Analysis in CSP |
| Chaodong He. The Decidability of the Reachability Problem for CCS^! |
