The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Dawson R. Engler
    Static Analysis Versus Model Checking for Bug Finding. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:1- [Conf]
  2. Rajeev Alur
    The Benefits of Exposing Calls and Returns. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:2-3 [Conf]
  3. Luca Cardelli
    A Compositional Approach to the Stochastic Dynamics of Gene Networks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:4- [Conf]
  4. Christos H. Papadimitriou
    Games Other People Play. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:5- [Conf]
  5. Deepak Garg, Frank Pfenning
    Type-Directed Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:6-20 [Conf]
  6. Damiano Mazza
    Multiport Interaction Nets and Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:21-35 [Conf]
  7. Alwen Fernanto Tiu
    Model Checking for pi-Calculus Using Proof Search. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:36-50 [Conf]
  8. Jim Laird
    A Game Semantics of the Asynchronous pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:51-65 [Conf]
  9. Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, Didier Lime
    Efficient On-the-Fly Algorithms for the Analysis of Timed Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:66-80 [Conf]
  10. Patricia Bouyer, Franck Cassez, François Laroussinie
    Modal Logics for Timed Control. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:81-94 [Conf]
  11. Catalin Dima
    Timed Shuffle Expressions. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:95-109 [Conf]
  12. Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
    A New Modality for Almost Everywhere Properties in Timed Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:110-124 [Conf]
  13. Pedro R. D'Argenio, Biniam Gebremichael
    The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:125-140 [Conf]
  14. Franck van Breugel
    A Behavioural Pseudometric for Metric Labelled Transition Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:141-155 [Conf]
  15. Andrzej S. Murawski, Joël Ouaknine
    On Probabilistic Program Equivalence and Refinement. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:156-170 [Conf]
  16. Mohit Bhargava, Catuscia Palamidessi
    Probabilistic Anonymity. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:171-185 [Conf]
  17. Andrew D. Gordon, Alan Jeffrey
    Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:186-201 [Conf]
  18. Christian Haack, Alan Jeffrey
    Timed Spi-Calculus with Types for Secrecy and Authenticity. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:202-216 [Conf]
  19. Tomasz Truderung
    Selecting Theories and Recursive Protocols. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:217-232 [Conf]
  20. Detlef Kähler, Ralf Küsters
    Constraint Solving for Contract-Signing Protocols. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:233-247 [Conf]
  21. Jos C. M. Baeten, Mario Bravetti
    A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:248-262 [Conf]
  22. Sibylle B. Fröschle, Slawomir Lasota
    Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:263-277 [Conf]
  23. David de Frutos-Escrig, Carlos Gregorio-Rodríguez
    Bisimulations Up-to for the Linear Time Branching Time Spectrum. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:278-292 [Conf]
  24. Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawel Sobocinski
    Deriving Weak Bisimulation Congruences from Reduction Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:293-307 [Conf]
  25. Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. Reniers
    SOS for Higher Order Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:308-322 [Conf]
  26. Rob J. van Glabbeek
    The Individual and Collective Token Interpretations of Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:323-337 [Conf]
  27. Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler
    Merged Processes - A New Condensed Representation of Petri Net Behaviour. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:338-352 [Conf]
  28. Vijay A. Saraswat, Radha Jagadeesan
    Concurrent Clustered Programming. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:353-367 [Conf]
  29. Adrian Francalanza, Matthew Hennessy
    A Theory of System Behaviour in the Presence of Node and Link Failures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:368-382 [Conf]
  30. Roberto Bruni, Michael J. Butler, Carla Ferreira, C. A. R. Hoare, Hernán C. Melgratti, Ugo Montanari
    Comparing Two Approaches to Compensable Flow Composition. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:383-397 [Conf]
  31. Vincent Danos, Jean Krivine
    Transactions in RCCS. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:398-412 [Conf]
  32. Krishnendu Chatterjee
    Two-Player Nonzero-Sum omega-Regular Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:413-427 [Conf]
  33. Hugo Gimbert, Wieslaw Zielonka
    Games Where You Can Play Optimally Without Any Memory. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:428-442 [Conf]
  34. Blaise Genest
    On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:443-457 [Conf]
  35. Hagen Völzer, Daniele Varacca, Ekkart Kindler
    Defining Fairness. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:458-472 [Conf]
  36. Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili
    Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:473-487 [Conf]
  37. Aaron R. Bradley, Zohar Manna, Henny B. Sipma
    Termination Analysis of Integer Linear Loops. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:488-502 [Conf]
  38. Eric Goubault, Emmanuel Haucourt
    A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:503-517 [Conf]
  39. Stéphane Demri, Régis Gascon
    Verification of Qualitative Constraints. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:518-532 [Conf]
  40. Paul Gastin, Dietrich Kuske
    Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:533-547 [Conf]
  41. Tiziana Margaria, A. Prasad Sistla, Bernhard Steffen, Lenore D. Zuck
    Taming Interface Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:548-561 [Conf]
  42. Ron van der Meyden, Thomas Wilke
    Synthesis of Distributed Systems from Knowledge-Based Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:562-576 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002