000 04122nam a22006135i 4500
001 978-3-540-28644-8
003 DE-He213
005 20240423132542.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540286448
_9978-3-540-28644-8
024 7 _a10.1007/b100113
_2doi
050 4 _aQA76.9.S88
072 7 _aUYD
_2bicssc
072 7 _aCOM011000
_2bisacsh
072 7 _aUYD
_2thema
082 0 4 _a004.2
_223
245 1 0 _aCONCUR 2004 -- Concurrency Theory
_h[electronic resource] :
_b15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings /
_cedited by Philippa Gardner, Nobuko Yoshida.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXIV, 534 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3170
505 0 _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 FixedPoint Logic.
650 0 _aComputer systems.
650 0 _aComputer science.
650 0 _aCompilers (Computer programs).
650 0 _aComputer programming.
650 0 _aComputer networks .
650 1 4 _aComputer System Implementation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aTheory of Computation.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Communication Networks.
700 1 _aGardner, Philippa.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aYoshida, Nobuko.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540229407
776 0 8 _iPrinted edition:
_z9783662210109
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3170
856 4 0 _uhttps://doi.org/10.1007/b100113
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189031
_d189031