Conferences in DBLP

International Conference on Concurrency Theory (CONCUR) (concur)
2004 (conf/concur/2004)

1. Tony Andrews, Shaz Qadeer, Sriram K. Rajamani, Yichen Xie
   Zing: Exploiting Program Structure for Model Checking Concurrent Software. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:1-15 [Conf]
   
2. Stephen D. Brookes
   A Semantics for Concurrent Separation Logic. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:16-34 [Conf]
   
3. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
   A Survey of Regular Model Checking. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:35-48 [Conf]
   
4. Peter W. O'Hearn
   Resources, Concurrency and Local Reasoning. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:49-67 [Conf]
   
5. Roberto M. Amadio, Silvano Dal-Zilio
   Resource Control for Synchronous Cooperative Threads. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:68-82 [Conf]
   
6. Paolo Baldan, Andrea Corradini, Barbara König
   Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:83-98 [Conf]
   
7. Nicolas Baudru, Rémi Morin
   The Pros and Cons of Netcharts. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:99-114 [Conf]
   
8. Martin Berger
   Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:115-130 [Conf]
   
9. Mikolaj Bojanczyk, Igor Walukiewicz
   Characterizing EF and EX Tree Logics. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2004, pp:131-145 [Conf]
   
10. Benedikt Bollig, Martin Leucker
    Message-Passing Automata Are Expressively Equivalent to EMSO Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:146-160 [Conf]
    
11. Johannes Borgström, Sébastien Briais, Uwe Nestmann
    Symbolic Bisimulation in the Spi Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:161-176 [Conf]
    
12. Liana Bozga, Cristian Ene, Yassine Lakhnech
    A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:177-192 [Conf]
    
13. Tomás Brázdil, Antonín Kucera, Oldrich Strazovský
    Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:193-208 [Conf]
    
14. Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely
    µABC: A Minimal Aspect Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:209-224 [Conf]
    
15. Michele Bugliesi, Dario Colazzo, Silvia Crafa
    Type Based Discretionary Access Control. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:225-239 [Conf]
    
16. Luís Caires, Étienne Lozes
    Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:240-257 [Conf]
    
17. Corina Cîrstea, Dirk Pattinson
    Modular Construction of Modal Logics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:258-275 [Conf]
    
18. Edmund M. Clarke, Muralidhar Talupur, Tayssir Touili, Helmut Veith
    Verification by Network Decomposition. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:276-291 [Conf]
    
19. Vincent Danos, Jean Krivine
    Reversible Communicating Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:292-307 [Conf]
    
20. Jan Friso Groote, Tim A. C. Willemse
    Parameterised Boolean Equation Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:308-324 [Conf]
    
21. Daniel Hirschkoff
    An Extensional Spatial Logic for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:325-339 [Conf]
    
22. Pavel Krcál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi
    Timed vs. Time-Triggered Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:340-354 [Conf]
    
23. Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
    Extended Process Rewrite Systems: Expressiveness and Reachability. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:355-370 [Conf]
    
24. Antonín Kucera, Ph. Schnoebelen
    A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:371-386 [Conf]
    
25. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Model Checking Timed Automata with One or Two Clocks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:387-401 [Conf]
    
26. Jérôme Leroux, Grégoire Sutre
    On Flatness for 2-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:402-416 [Conf]
    
27. Qin Ma, Luc Maranget
    Compiling Pattern Matching in Join-Patterns. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:417-431 [Conf]
    
28. Nicolas Markey, Jean-François Raskin
    Model Checking Restricted Sets of Timed Paths. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:432-447 [Conf]
    
29. Paul-André Melliès
    Asynchronous Games 2: The True Concurrency of Innocence. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:448-465 [Conf]
    
30. Paulo Tabuada
    Open Maps, Alternating Simulations and Control Synthesis. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:466-480 [Conf]
    
31. Daniele Varacca, Hagen Völzer, Glynn Winskel
    Probabilistic Event Structures and Domains. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:481-496 [Conf]
    
32. Vasco Thudichum Vasconcelos, António Ravara, Simon J. Gay
    Session Types for Functional Multithreading. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:497-511 [Conf]
    
33. Mahesh Viswanathan, Ramesh Viswanathan
    A Higher Order Modal Fixed Point Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:512-528 [Conf]