000 05927nam a22005895i 4500
001 978-3-540-31934-4
003 DE-He213
005 20240730181821.0
007 cr nn 008mamaa
008 100725s2005 gw | s |||| 0|eng d
020 _a9783540319344
_9978-3-540-31934-4
024 7 _a10.1007/11539452
_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 2005 - Concurrency Theory
_h[electronic resource] :
_b16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings /
_cedited by Martín Abadi, Luca de Alfaro.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXXIV, 1280 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 ;
_v3653
505 0 _aInvited Lectures -- Static Analysis Versus Model Checking for Bug Finding -- The Benefits of Exposing Calls and Returns -- A Compositional Approach to the Stochastic Dynamics of Gene Networks -- Contributed Papers -- Games Other People Play -- Type-Directed Concurrency -- Multiport Interaction Nets and Concurrency -- Model Checking for ?-Calculus Using Proof Search -- A Game Semantics of the Asynchronous ?-Calculus -- Efficient On-the-Fly Algorithms for the Analysis of Timed Games -- Modal Logics for Timed Control -- Timed Shuffle Expressions -- A New Modality for Almost Everywhere Properties in Timed Automata -- The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation -- A Behavioural Pseudometric for Metric Labelled Transition Systems -- On Probabilistic Program Equivalence and Refinement -- Probabilistic Anonymity -- Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus -- Timed Spi-Calculus with Types for Secrecy and Authenticity -- Selecting Theories and Recursive Protocols -- Constraint Solving for Contract-Signing Protocols -- A Ground-Complete Axiomatization of Finite State Processes in Process Algebra -- Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP -- Bisimulations Up-to for the Linear Time Branching Time Spectrum -- Deriving Weak Bisimulation Congruences from Reduction Systems -- SOS for Higher Order Processes -- The Individual and Collective Token Interpretations of Petri Nets -- Merged Processes - A New Condensed Representation of Petri Net Behaviour -- Concurrent Clustered Programming -- A Theory of System Behaviour in the Presence of Node and Link Failures -- Comparing Two Approaches to Compensable Flow Composition -- Transactions in RCCS -- Two-Player Nonzero-Sum ?-Regular Games -- Games Where You Can PlayOptimally Without Any Memory -- On Implementation of Global Concurrent Systems with Local Asynchronous Controllers -- Defining Fairness -- Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems -- Termination Analysis of Integer Linear Loops -- A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs -- Verification of Qualitative ? Constraints -- Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces -- Taming Interface Specifications -- Synthesis of Distributed Systems from Knowledge-Based Specifications.
520 _aThis volume contains the papers presented at CONCUR 2005, the 16th - ternational Conference on Concurrency Theory. The purpose of the CONCUR series of conferences is to bring together researchers,developers, and students in order to advance the theory of concurrency and to promote its applications. This year's conference was in San Francisco, California, from August 23 to August 26. We received 100 submissions in response to a call for papers. Each subm- sionwasassignedto at leastthreemembers ofthe ProgramCommittee; in many cases, reviews were solicited from outside experts. The ProgramCommittee d- cussed the submissions electronically, judging them on their perceived imp- tance, originality, clarity, and appropriateness to the expected audience. The Program Committee selected 38 papers for presentation. Because of the format of the conference and the high number of submissions, many good papers could not be included. Although submissions werereadand evaluated, the papers that appear in this volume may di?er in form and contents from the corresponding submissions. It is expected that many of the papers will be further revised and submitted to refereed archival journals for publication.
650 0 _aComputer systems.
_9126269
650 0 _aComputer science.
_99832
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer programming.
_94169
650 1 4 _aComputer System Implementation.
_938514
650 2 4 _aTheory of Computation.
_9126270
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aProgramming Techniques.
_9126271
700 1 _aAbadi, Martín.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126272
700 1 _ade Alfaro, Luca.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126273
710 2 _aSpringerLink (Online service)
_9126274
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540283096
776 0 8 _iPrinted edition:
_z9783540814269
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3653
_9126275
856 4 0 _uhttps://doi.org/10.1007/11539452
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91090
_d91090