Share on TelegramCONCUR 2004 concurrency theory : 15th international conference, London, UK, August 31 September 3, 2004 : pro
Author: Gardner, Philippa, Yoshida, Nobuko, International Conference on Concurrency Theory (15th : 2004 : London, England)
Added by: sketch
Added Date: 2015-12-29
Language: eng
Subjects: Parallel processing (Electronic computers), Computer multitasking, Parallélisme (Informatique), Fonctionnement multitâche, Parallélisme (Informatique), Fonctionnement multitâche, Computer multitasking, Parallel processing (Electronic computers), Concurrency theory, CONCUR
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 354022940X, 9783540229407
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 281.35 MB
PDF Size: 5.19 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 203
Views: 253
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 09:12:09
Size: 14.97 KB
Description
Author: Philippa Gardner, Nobuko Yoshida
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-22940-7
DOI: 10.1007/b100113
Table of Contents:
- 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
- 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
Includes bibliographical references and index
