| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465396703316 |
|
|
Titolo |
CONCUR 2004 -- Concurrency Theory [[electronic resource] ] : 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings / / edited by Philippa Gardner, Nobuko Yoshida |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2004.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 534 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 3170 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Architecture, Computer |
Computer logic |
Computers |
Programming languages (Electronic computers) |
Computer programming |
Computer communication systems |
Computer System Implementation |
Logics and Meanings of Programs |
Computation by Abstract Devices |
Programming Languages, Compilers, Interpreters |
Programming Techniques |
Computer Communication Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
| |