|
|
|
|
LEADER |
03073nam a22005535i 4500 |
001 |
11140 |
003 |
DE-He213 |
005 |
20130725201552.0 |
007 |
cr nn 008mamaa |
008 |
100820s2010 gw | s |||| 0|eng d |
020 |
# |
# |
|a 9783642153754
|9 978-3-642-15375-4
|
024 |
7 |
# |
|a 10.1007/978-3-642-15375-4
|2 doi
|
050 |
# |
4 |
|a QA76.758
|
072 |
# |
7 |
|a UMZ
|2 bicssc
|
072 |
# |
7 |
|a COM051230
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
100 |
1 |
# |
|a Gastin, Paul.
|e editor.
|
245 |
1 |
0 |
|a CONCUR 2010 - Concurrency Theory
|b 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings /
|c edited by Paul Gastin, Franȯis Laroussinie.
|h [electronic resource] :
|
264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
300 |
# |
# |
|a XIII, 600p. 134 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,
|v 6269
|x 0302-9743 ;
|
520 |
# |
# |
|a This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010. The 35 revised full papers were carefully reviewed and selected from 107 submissions. The topics include: - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics. - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems. - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking and run-time verification.
|
650 |
# |
0 |
|a Computer science.
|
650 |
# |
0 |
|a Computer Communication Networks.
|
650 |
# |
0 |
|a Software engineering.
|
650 |
# |
0 |
|a Logic design.
|
650 |
# |
0 |
|a Information systems.
|
650 |
# |
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Information Systems Applications (incl.Internet).
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
700 |
1 |
# |
|a Laroussinie, Franȯis.
|e editor.
|
710 |
2 |
# |
|a SpringerLink (Online service)
|
773 |
0 |
# |
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642153747
|
830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 6269
|x 0302-9743 ;
|
856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-15375-4
|
912 |
# |
# |
|a ZDB-2-SCS
|
912 |
# |
# |
|a ZDB-2-LNC
|
950 |
# |
# |
|a Computer Science (Springer-11645)
|