Full Text Documents

Search


Table of Contents
Theoretical Computer Science
Jos Baeten, Tom Ball, Frank De Boer (Eds.)
Front Matter
Computability and Non-computability Issues in Amorphous Computing
Jiří Wiedermann
1-9
Static Single Information Form for Abstract Compilation
Davide Ancona, Giovanni Lagorio
10-27
Input-Driven Stack Automata
Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher
28-42
Probabilistic Inference and Monadic Second Order Logic
Hans Bodlaender
43-56
Cinderella versus the Wicked Stepmother
Marijke Bodlaender, Cor Hurkens, Vincent Kusters, Frank Staals, Gerhard Woeginger, Hans Zantema
57-71
Worst- and Average-Case Privacy Breaches in Randomization Mechanisms
Michele Boreale, Michela Paolini
72-86
Weak Bisimulations for Coalgebras over Ordered Functors
Tomasz Brengos
87-103
A context-free linear ordering with an undecidable first-order theory
Arnaud Carayol, Zoltan Esik
104-118
Open Bisimulation for Quantum Processes
Yuxin Deng, Yuan Feng
119-133
A Modular LTS for Open Reactive Systems
Fabio Gadducci, Giacoma Monreale, Ugo Montanari
134-148
Unidirectional Channel Systems Can Be Tested
Petr Jančar, Prateek Karandikar, Philippe Schnoebelen
149-163
On Properties and State Complexity of Deterministic State-Partition Automata
Galina Jirásková, Tomáš Masopust
164-178
On Union-Free and Deterministic Union-Free Languages
Galina Jirásková, Benedek Nagy
179-192
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
193-208
Formal Verification of Distributed Algorithms
Philipp Küfner, Uwe Nestmann, Christina Rickmann
209-224
A Temporal Logic for Multi-threaded Programs
Salvatore Torre, Margherita Napoli
225-239
The Algorithmic Complexity of k-Domatic Partition of Graphs
Hongyu Liang
240-249
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
Bas Luttik
250-264
Modal Interface Automata
Gerald Lüttgen, Walter Vogler
265-279
Proofs as Executions
Emmanuel Beffara, Virgile Mogbil
280-294
Efficient Algorithms for the max k -vertex cover Problem
Federico Della Croce, Vangelis Paschos
295-309
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams
Colin Riba
310-324
Compositional Abstraction Techniques for Probabilistic Automata
Falak Sher, Joost-Pieter Katoen
325-341
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks
Lei Song, Jens Godskesen
342-356
An Intersection Type System for Deterministic Pushdown Automata
Takeshi Tsukada, Naoki Kobayashi
357-371
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
Steffen Bakel, Maria Vigliotti
372-387

 

 


Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/