000 -LEADER |
fixed length control field |
05553nam a22005175i 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20140310144111.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
120908s2012 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783642334757 |
|
978-3-642-33475-7 |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA75.5-76.95 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.0151 |
Edition number |
23 |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg : |
-- |
Imprint: Springer, |
-- |
2012. |
912 ## - |
-- |
ZDB-2-SCS |
|
-- |
ZDB-2-LNC |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Baeten, Jos C. M. |
Relator term |
editor. |
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
Title |
Theoretical Computer Science |
Medium |
[electronic resource] : |
Remainder of title |
7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings / |
Statement of responsibility, etc |
edited by Jos C. M. Baeten, Tom Ball, Frank S. Boer. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
X, 393 p. 76 illus. |
Other physical details |
online resource. |
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
Title |
Lecture Notes in Computer Science, |
International Standard Serial Number |
0302-9743 ; |
Volume number/sequential designation |
7604 |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
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 ## - SUMMARY, ETC. |
Summary, etc |
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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer science. |
|
Topical term or geographic name as entry element |
Information theory. |
|
Topical term or geographic name as entry element |
Computer software. |
|
Topical term or geographic name as entry element |
Computational complexity. |
|
Topical term or geographic name as entry element |
Computer Science. |
|
Topical term or geographic name as entry element |
Theory of Computation. |
|
Topical term or geographic name as entry element |
Computation by Abstract Devices. |
|
Topical term or geographic name as entry element |
Mathematical Logic and Formal Languages. |
|
Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
|
Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
Topical term or geographic name as entry element |
Mathematics of Computing. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Ball, Tom. |
Relator term |
editor. |
|
Personal name |
Boer, Frank S. |
Relator term |
editor. |
710 2# - ADDED ENTRY--CORPORATE NAME |
Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY |
Title |
Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Printed edition: |
International Standard Book Number |
9783642334740 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-33475-7 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
E-Book |