|
|
|
|
| LEADER |
02824nam a22005535i 4500 |
| 001 |
978-3-642-13754-9 |
| 003 |
DE-He213 |
| 005 |
20170127073351.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100630s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642137549
|9 978-3-642-13754-9
|
| 024 |
7 |
|
|a 10.1007/978-3-642-13754-9
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 245 |
1 |
0 |
|a Time for Verification
|h [electronic resource] :
|b Essays in Memory of Amir Pnueli /
|c edited by Zohar Manna, Doron A. Peled.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a VIII, 413 p. 113 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 6200
|
| 505 |
0 |
|
|a Modal and Temporal Argumentation Networks -- Knowledge Based Scheduling of Distributed Systems -- Quantitative Simulation Games -- The Localization Reduction and Counterexample-Guided Abstraction Refinement -- A Scalable Segmented Decision Tree Abstract Domain -- Towards Component Based Design of Hybrid Systems: Safety and Stability -- Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars -- Inference Rules for Proving the Equivalence of Recursive Procedures -- Some Thoughts on the Semantics of Biocharts -- Unraveling a Card Trick -- An Automata-Theoretic Approach to Infinite-State Systems -- On the Krohn-Rhodes Cascaded Decomposition Theorem -- Temporal Verification of Reactive Systems: Response -- The Arrow of Time through the Lens of Computing -- What Is in a Step: New Perspectives on a Classical Question.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 700 |
1 |
|
|a Manna, Zohar.
|e editor.
|
| 700 |
1 |
|
|a Peled, Doron A.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642137532
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6200
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-13754-9
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
