|
|
|
|
| LEADER |
03071nam a22005535i 4500 |
| 001 |
978-3-642-40184-8 |
| 003 |
DE-He213 |
| 005 |
20151031001145.0 |
| 007 |
cr nn 008mamaa |
| 008 |
130723s2013 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642401848
|9 978-3-642-40184-8
|
| 024 |
7 |
|
|a 10.1007/978-3-642-40184-8
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a UYF
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 245 |
1 |
0 |
|a CONCUR 2013 – Concurrency Theory
|h [electronic resource] :
|b 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings /
|c edited by Pedro R. D’Argenio, Hernán Melgratti.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2013.
|
| 300 |
|
|
|a XIV, 562 p. 83 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 8052
|
| 505 |
0 |
|
|a Process Semantics and Modal Transition Systems.- VAS and Pushdown Systems.- Pi Calculus and Interaction Nets -- Linearizability and Verification of Concurrent Programs -- Verification of Infinite Models, Model Measure and Reversibility.- Stochastic Models.- Message-Based Interacting Processes.- Principles of Automatic Verification -- Games and Control Synthesis.
|
| 520 |
|
|
|a This book constitutes the thoroughly refereed proceedings of the 24th International Conference on Concurrency Theory, CONCUR 2013, held in Buenos Aires, Argentina, August 27-30, 2013. The 34 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 115 submissions. The papers are organized in topics such as process semantics and modal transition systems, VAS and pushdown systems, Pi calculus and interaction nets, linearizability and verification of concurrent programs, verification of infinite models, model measure and reversibility, stochastic models, message-based interaction processes, principles of automatic verification, and games and control synthesis.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical statistics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Probability and Statistics in Computer Science.
|
| 700 |
1 |
|
|a D’Argenio, Pedro R.
|e editor.
|
| 700 |
1 |
|
|a Melgratti, Hernán.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642401831
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8052
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-40184-8
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
