Abstract is missing.
- Computability and Non-computability Issues in Amorphous ComputingJirí Wiedermann. 1-9 [doi]
- Static Single Information Form for Abstract CompilationDavide Ancona, Giovanni Lagorio. 10-27 [doi]
- Input-Driven Stack AutomataSuna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher. 28-42 [doi]
- Probabilistic Inference and Monadic Second Order LogicMarijke H. L. Bodlaender. 43-56 [doi]
- Cinderella versus the Wicked StepmotherMarijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema. 57-71 [doi]
- Worst- and Average-Case Privacy Breaches in Randomization MechanismsMichele Boreale, Michela Paolini. 72-86 [doi]
- Weak Bisimulations for Coalgebras over Ordered FunctorsTomasz Brengos. 87-103 [doi]
- A Context-Free Linear Ordering with an Undecidable First-Order TheoryArnaud Carayol, Zoltán Ésik. 104-118 [doi]
- Open Bisimulation for Quantum ProcessesYuxin Deng, Yuan Feng. 119-133 [doi]
- A Modular LTS for Open Reactive SystemsFabio Gadducci, Giacoma Valentina Monreale, Ugo Montanari. 134-148 [doi]
- Unidirectional Channel Systems Can Be TestedPetr Jancar, Prateek Karandikar, Philippe Schnoebelen. 149-163 [doi]
- On Properties and State Complexity of Deterministic State-Partition AutomataGalina Jirásková, Tomás Masopust. 164-178 [doi]
- On Union-Free and Deterministic Union-Free LanguagesGalina Jirásková, Benedek Nagy. 179-192 [doi]
- A Characterisation of Languages on Infinite Alphabets with Nominal Regular ExpressionsAlexander Kurz, Tomoyuki Suzuki 0001, Emilio Tuosto. 193-208 [doi]
- Formal Verification of Distributed Algorithms - From Pseudo Code to Checked ProofsPhilipp Küfner, Uwe Nestmann, Christina Rickmann. 209-224 [doi]
- A Temporal Logic for Multi-threaded ProgramsSalvatore La Torre, Margherita Napoli. 225-239 [doi]
- The Algorithmic Complexity of k-Domatic Partition of GraphsHongyu Liang. 240-249 [doi]
- Unique Parallel Decomposition in Branching and Weak Bisimulation SemanticsBas Luttik. 250-264 [doi]
- Modal Interface AutomataGerald Lüttgen, Walter Vogler. 265-279 [doi]
- Proofs as ExecutionsEmmanuel Beffara, Virgile Mogbil. 280-294 [doi]
- Efficient Algorithms for the max k -vertex cover ProblemFederico Della Croce, Vangelis Th. Paschos. 295-309 [doi]
- A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite WordsColin Riba. 310-324 [doi]
- Compositional Abstraction Techniques for Probabilistic AutomataFalak Sher, Joost-Pieter Katoen. 325-341 [doi]
- Broadcast Abstraction in a Stochastic Calculus for Mobile NetworksLei Song, Jens Chr. Godskesen. 342-356 [doi]
- An Intersection Type System for Deterministic Pushdown AutomataTakeshi Tsukada, Naoki Kobayashi 0001. 357-371 [doi]
- An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended AbstractSteffen van Bakel, Maria Grazia Vigliotti. 372-387 [doi]