CONCUR 2005 – Concurrency Theory 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Abadi, Martín (Επιμελητής έκδοσης), Alfaro, Luca de (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3653
• Θέματα: Computer science.; Architecture, Computer.; Computer programming.; Programming languages (Electronic computers).; Computers.; Computer logic.; Computer Science.; Computer System Implementation.; Theory of Computation.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Programming Languages, Compilers, Interpreters.; Programming Techniques.

This 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....

Πίνακας περιεχομένων:

• Invited 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 Play Optimally 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.