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

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

Paperback(2012)

$84.99
Choose Expedited Shipping at checkout for guaranteed delivery by Thursday, January 23
MARKETPLACE
3 New & Used Starting at $78.31

Overview

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.

Product Details

ISBN-13: 9783642334740
Publisher: Springer Berlin Heidelberg
Publication date: 08/18/2012
Series: Lecture Notes in Computer Science , #7604
Edition description: 2012
Pages: 393
Product dimensions: 0.00(w) x 0.00(h) x 0.03(d)

Table of Contents

Computability and Non-computability Issues in Amorphous Computing.- Static Single Information Form for Abstract Compilation.-Input-Driven Stack Automata.-Probabilistic Inference and Monadic Second Order Logic.-Cinderella versus the Wicked Stepmother.-Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.-Weak Bisimulations for Coalgebras over Ordered Functors.-A Context-Free Linear Ordering with an Undecidable First-Order Theory.-Open Bisimulation for Quantum Processes.-A Modular LTS for Open Reactive Systems.-Unidirectional Channel Systems Can Be Tested.-On Properties and State Complexity of Deterministic State-Partition Automata.-On Union-Free and Deterministic Union-Free Languages.-A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.-Formal Verification of Distributed Algorithms: From Pseudo Code to Checked Proofs.-A Temporal Logic for Multi-threaded Programs.-The Algorithmic Complexity of k-Domatic Partition of Graphs.-Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.-Modal Interface Automata.-Proofs as Executions.-Efficient Algorithms for the max k-vertex cover Problem.-A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words..-Compositional Abstraction Techniques for Probabilistic Automata.- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.-An Intersection Type System for Deterministic Pushdown Automata.-An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus: Extended Abstract.

Static Single Information Form for Abstract Compilation.-Input-Driven Stack Automata.-Probabilistic Inference and Monadic Second Order Logic.-Cinderella versus the Wicked Stepmother.-Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.-Weak Bisimulations for Coalgebras over Ordered Functors.-A Context-Free Linear Ordering with an Undecidable First-Order Theory.-Open Bisimulation for Quantum Processes.-A Modular LTS for Open Reactive Systems.-Unidirectional Channel Systems Can Be Tested.-On Properties and State Complexity of Deterministic State-Partition Automata.-On Union-Free and Deterministic Union-Free Languages.-A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.-Formal Verification of Distributed Algorithms: From Pseudo Code to Checked Proofs.-A Temporal Logic for Multi-threaded Programs.-The Algorithmic Complexity of k-Domatic Partition of Graphs.-Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.-Modal Interface Automata.-Proofs as Executions.-Efficient Algorithms for the max k-vertex cover Problem.-A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words..-Compositional Abstraction Techniques for Probabilistic Automata.- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.-An Intersection Type System for Deterministic Pushdown Automata.-An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus: Extended Abstract.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews