LEADER 05180nam  22007935  450 
001 996465396703316
005 20200630001908.0
010   $a3-540-28644-6
024 7 $a10.1007/b100113
035   $a(CKB)1000000000212526
035   $a(SSID)ssj0000128372
035   $a(PQKBManifestationID)11142043
035   $a(PQKBTitleCode)TC0000128372
035   $a(PQKBWorkID)10063422
035   $a(PQKB)11466959
035   $a(DE-He213)978-3-540-28644-8
035   $a(MiAaPQ)EBC3088354
035   $a(PPN)155220632
035   $a(EXLCZ)991000000000212526
100   $a20121227d2004      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aCONCUR 2004 -- Concurrency Theory$b[electronic resource] $e15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings /$fedited by Philippa Gardner, Nobuko Yoshida
205   $a1st ed. 2004.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004.
215   $a1 online resource (XIV, 534 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3170
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-22940-X 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aInvited Papers -- Zing: Exploiting Program Structure for Model Checking Concurrent Software -- A Semantics for Concurrent Separation Logic -- A Survey of Regular Model Checking -- Resources, Concurrency and Local Reasoning -- Accepted Papers -- Resource Control for Synchronous Cooperative Threads -- Verifying Finite-State Graph Grammars: An Unfolding-Based Approach -- The Pros and Cons of Netcharts -- Basic Theory of Reduction Congruence forTwo Timed Asynchronous ?-Calculi -- Characterizing EF and EX Tree Logics -- Message-Passing Automata Are Expressively Equivalent to EMSO Logic -- Symbolic Bisimulation in the Spi Calculus -- A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps -- Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems -- ?ABC: A Minimal Aspect Calculus -- Type Based Discretionary Access Control -- Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency -- Modular Construction of Modal Logics -- Verification by Network Decomposition -- Reversible Communicating Systems -- Parameterised Boolean Equation Systems -- An Extensional Spatial Logic for Mobile Processes -- Timed vs. Time-Triggered Automata -- Extended Process Rewrite Systems: Expressiveness and Reachability -- A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications -- Model Checking Timed Automata with One or Two Clocks -- On Flatness for 2-Dimensional Vector Addition Systems with States -- Compiling Pattern Matching in Join-Patterns -- Model Checking Restricted Sets of Timed Paths -- Asynchronous Games 2: The True Concurrency of Innocence -- Open Maps, Alternating Simulations and Control Synthesis -- Probabilistic Event Structures and Domains -- Session Types for Functional Multithreading -- A Higher Order Modal Fixed Point Logic.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v3170
606   $aArchitecture, Computer
606   $aComputer logic
606   $aComputers
606   $aProgramming languages (Electronic computers)
606   $aComputer programming
606   $aComputer communication systems
606   $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022
615  0$aArchitecture, Computer.
615  0$aComputer logic.
615  0$aComputers.
615  0$aProgramming languages (Electronic computers).
615  0$aComputer programming.
615  0$aComputer communication systems.
615 14$aComputer System Implementation.
615 24$aLogics and Meanings of Programs.
615 24$aComputation by Abstract Devices.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aProgramming Techniques.
615 24$aComputer Communication Networks.
676   $a004.35
702   $aGardner$b Philippa$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aYoshida$b Nobuko$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465396703316
996   $aCONCUR 2004 -- Concurrency Theory$91935976
997   $aUNISA