|
|
|
|
| LEADER |
05823nam a22005895i 4500 |
| 001 |
978-3-642-33475-7 |
| 003 |
DE-He213 |
| 005 |
20151030041115.0 |
| 007 |
cr nn 008mamaa |
| 008 |
120908s2012 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642334757
|9 978-3-642-33475-7
|
| 024 |
7 |
|
|a 10.1007/978-3-642-33475-7
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Theoretical Computer Science
|h [electronic resource] :
|b 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings /
|c edited by Jos C. M. Baeten, Tom Ball, Frank S. de Boer.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2012.
|
| 300 |
|
|
|a X, 393 p. 76 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7604
|
| 505 |
0 |
|
|a 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.
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 700 |
1 |
|
|a Baeten, Jos C. M.
|e editor.
|
| 700 |
1 |
|
|a Ball, Tom.
|e editor.
|
| 700 |
1 |
|
|a Boer, Frank S. de.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642334740
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7604
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-33475-7
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
