Skip to main content
  • Conference proceedings
  • © 2012

Theoretical Computer Science

7th IFIP TC1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012, Proceedings

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7604)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): TCS: IFIP International Conference on Theoretical Computer Science

Conference proceedings info: TCS 2012.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (28 papers)

  1. Front Matter

  2. Static Single Information Form for Abstract Compilation

    • Davide Ancona, Giovanni Lagorio
    Pages 10-27
  3. Input-Driven Stack Automata

    • Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher
    Pages 28-42
  4. Probabilistic Inference and Monadic Second Order Logic

    • Marijke Hans L. Bodlaender
    Pages 43-56
  5. Cinderella versus the Wicked Stepmother

    • Marijke Hans L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema
    Pages 57-71
  6. Worst- and Average-Case Privacy Breaches in Randomization Mechanisms

    • Michele Boreale, Michela Paolini
    Pages 72-86
  7. A Context-Free Linear Ordering with an Undecidable First-Order Theory

    • Arnaud Carayol, Zoltán Ésik
    Pages 104-118
  8. Open Bisimulation for Quantum Processes

    • Yuxin Deng, Yuan Feng
    Pages 119-133
  9. A Modular LTS for Open Reactive Systems

    • Fabio Gadducci, Giacoma Valentina Monreale, Ugo Montanari
    Pages 134-148
  10. Unidirectional Channel Systems Can Be Tested

    • Petr Jančar, Prateek Karandikar, Philippe Schnoebelen
    Pages 149-163
  11. On Properties and State Complexity of Deterministic State-Partition Automata

    • Galina Jirásková, Tomáš Masopust
    Pages 164-178
  12. On Union-Free and Deterministic Union-Free Languages

    • Galina Jirásková, Benedek Nagy
    Pages 179-192
  13. A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

    • Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
    Pages 193-208
  14. Formal Verification of Distributed Algorithms

    • Philipp Küfner, Uwe Nestmann, Christina Rickmann
    Pages 209-224
  15. A Temporal Logic for Multi-threaded Programs

    • Salvatore La Torre, Margherita Napoli
    Pages 225-239
  16. Modal Interface Automata

    • Gerald Lüttgen, Walter Vogler
    Pages 265-279

Other Volumes

  1. Theoretical Computer Science

About this book

This book constitutes the refereed proceedings of the 7th FIP WG 2.2 International Conference, TCS 2012, held in Amsterdam, The Netherlands, in September 2012.
The 25 revised full papers presented, together with one invited talk, were carefully reviewed and selected from 48 submissions. New results of computation theory are presented and more broadly experts in theoretical computer science meet to share insights and ask questions about the future directions of the field.

Editors and Affiliations

  • Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands

    Jos C. M. Baeten, Frank S. Boer

  • Microsoft Research, Redmond, USA

    Tom Ball

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access