000 04328nam a22005775i 4500
001 978-3-540-74407-8
003 DE-He213
005 20240730184226.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540744078
_9978-3-540-74407-8
024 7 _a10.1007/978-3-540-74407-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCONCUR 2007 - Concurrency Theory
_h[electronic resource] :
_b18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings /
_cedited by Luís Caires, Vasco T. Vasconcelos.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXIII, 510 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4703
505 0 _aInvited Lectures -- Mapping the Security Landscape: A Role for Language Techniques -- The Saga of the Axiomatization of Parallel Composition -- Rule-Based Modelling of Cellular Signalling -- Contributed Papers -- Making Random Choices Invisible to the Scheduler -- Strategy Logic -- Solving Games Via Three-Valued Abstraction Refinement -- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness -- On Modal Refinement and Consistency -- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems -- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage -- A Nice Labelling for Tree-Like Event Structures of Degree 3 -- Causal Message Sequence Charts -- Checking Coverage for Infinite Collections of Timed Scenarios -- Is Observational Congruence Axiomatisable in Equational Horn Logic? -- The Must Preorder Revisited -- Topology-Dependent Abstractions of Broadcast Networks -- On the Expressive Power of Global and Local Priority in Process Calculi -- A Marriage of Rely/Guarantee and Separation Logic -- Fair Cooperative Multithreading -- Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures -- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning -- Compositional Event Structure Semantics for the Internal ?-Calculus -- Interpreting a Finitary Pi-calculus in Differential Interaction Nets -- Mobility Control Via Passports -- Coalgebraic Models for Reactive Systems -- Reactive Systems over Directed Bigraphs -- Asynchronous Games: Innocence Without Alternation -- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes -- Strategy Synthesis for Markov Decision Processes and Branching-Time Logics -- Timed Concurrent Game Structures -- PushdownModule Checking with Imperfect Information -- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages -- Temporal Antecedent Failure: Refining Vacuity.
650 0 _aComputer science.
_99832
650 0 _aComputer systems.
_9134944
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer programming.
_94169
650 1 4 _aTheory of Computation.
_9134945
650 2 4 _aComputer System Implementation.
_938514
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aProgramming Techniques.
_9134946
700 1 _aCaires, Luís.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134947
700 1 _aVasconcelos, Vasco T.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134948
710 2 _aSpringerLink (Online service)
_9134949
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540744061
776 0 8 _iPrinted edition:
_z9783540842675
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4703
_9134950
856 4 0 _uhttps://doi.org/10.1007/978-3-540-74407-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92247
_d92247