Theoretical Computer Science

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

Häftad, Engelska, 2012

Av Jos C.M. Baeten, Tom Ball, Frank S. de Boer, Jos C. M. Baeten, Frank S. De Boer

719 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2012-08-18
Mått155 x 235 x 22 mm
Vikt604 g
FormatHäftad
SpråkEngelska
SerieTheoretical Computer Science and General Issues
Antal sidor393
Upplaga2012
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642334740

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik

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 CheckedProofs.- 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 ofLanguages 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.