IFIP TC6 Open Digital Library

7. IFIP TCS 2012: Amsterdam, The Netherlands

Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings

Jos C. M. Baeten, Thomas Ball, Frank S. de Boer

Springer, Lecture Notes in Computer Science 7604, ISBN: 978-3-642-33474-0


Computability and Non-computability Issues in Amorphous Computing.

Jirí Wiedermann


Static Single Information Form for Abstract Compilation.

Davide Ancona, Giovanni Lagorio


Input-Driven Stack Automata.

Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher


Probabilistic Inference and Monadic Second Order Logic.

Marijke H. L. Bodlaender


Cinderella versus the Wicked Stepmother.

Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema


Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.

Michele Boreale, Michela Paolini


Weak Bisimulations for Coalgebras over Ordered Functors.

Tomasz Brengos


A Context-Free Linear Ordering with an Undecidable First-Order Theory.

Arnaud Carayol, Zoltán Ésik


Open Bisimulation for Quantum Processes.

Yuxin Deng, Yuan Feng


A Modular LTS for Open Reactive Systems.

Fabio Gadducci, Giacoma Valentina Monreale, Ugo Montanari


Unidirectional Channel Systems Can Be Tested.

Petr Jancar, Prateek Karandikar, Philippe Schnoebelen


On Properties and State Complexity of Deterministic State-Partition Automata.

Galina Jirásková, Tomás Masopust


On Union-Free and Deterministic Union-Free Languages.

Galina Jirásková, Benedek Nagy


A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.

Alexander Kurz, Tomoyuki Suzuki 0001, Emilio Tuosto


Formal Verification of Distributed Algorithms - From Pseudo Code to Checked Proofs.

Philipp Küfner, Uwe Nestmann, Christina Rickmann


A Temporal Logic for Multi-threaded Programs.

Salvatore La Torre, Margherita Napoli


The Algorithmic Complexity of k-Domatic Partition of Graphs.

Hongyu Liang


Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.

Bas Luttik


Modal Interface Automata.

Gerald Lüttgen, Walter Vogler


Proofs as Executions.

Emmanuel Beffara, Virgile Mogbil


Efficient Algorithms for the max k -vertex cover Problem.

Federico Della Croce, Vangelis Th. Paschos


A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words.

Colin Riba


Compositional Abstraction Techniques for Probabilistic Automata.

Falak Sher, Joost-Pieter Katoen


Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.

Lei Song, Jens Chr. Godskesen


An Intersection Type System for Deterministic Pushdown Automata.

Takeshi Tsukada, Naoki Kobayashi 0001


An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract.

Steffen van Bakel, Maria Grazia Vigliotti