1 option
CONCUR 2004 -- Concurrency Theory : 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings / edited by Philippa Gardner, Nobuko Yoshida.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 3170.
- Lecture Notes in Computer Science, 0302-9743 ; 3170
- Language:
- English
- Subjects (All):
- Computer architecture.
- Computer logic.
- Computers.
- Programming languages (Electronic computers).
- Computer programming.
- Computer networks.
- Computer System Implementation.
- Logics and Meanings of Programs.
- Computation by Abstract Devices.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Computer Communication Networks.
- Local Subjects:
- Computer System Implementation.
- Logics and Meanings of Programs.
- Computation by Abstract Devices.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XIV, 534 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Contents:
- Invited 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-28644-8
- 9783540286448
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.