The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Colin Stirling
    Lokal Model Checking Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:1-11 [Conf]
  2. Mads Dam
    Compositional Proof Systems for Model Checking Infinite State Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:12-26 [Conf]
  3. François Laroussinie, Kim Guldstrand Larsen
    Compositional Model Checking of Real Time Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:27-41 [Conf]
  4. Ugo Montanari, Marco Pistore
    Checking Bisimilarity for Finitary pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:42-56 [Conf]
  5. Gian Luigi Ferrari, Ugo Montanari, Paola Quaglia
    The Weak Late pi-Calculus Semantics as Observation Equivalence. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:57-71 [Conf]
  6. Bernhard Steffen, Andreas Claßen, Marion Klein, Jens Knoop, Tiziana Margaria
    The Fixpoint-Analysis Machine. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:72-87 [Conf]
  7. H. Lin
    Unique Fixpoint Induction for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:88-102 [Conf]
  8. Xinxin Liu, David Walker
    A Polymorphic Type System for the Polyadic pi-calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:103-116 [Conf]
  9. Claudio Hermida, John Power
    Fibrational Control Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:117-129 [Conf]
  10. Flavio Corradini, Rocco De Nicola, Anna Labella
    Fully Abstract Models for Nondeterministic Regular Expressions. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:130-144 [Conf]
  11. Nadia Busi, Roberto Gorrieri
    A Petri Net Semantics for pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:145-159 [Conf]
  12. Arend Rensink
    A Complete Theory of Deterministic Event Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:160-174 [Conf]
  13. Mogens Nielsen, Lutz Priese, Vladimiro Sassone
    Characterizing Behavioural Congruences for Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:175-189 [Conf]
  14. Frits W. Vaandrager
    Verification of a Distributed Summation Algorithm. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:190-203 [Conf]
  15. Jan Friso Groote, M. P. A. Sellink
    Confluence for Process Verification. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:204-218 [Conf]
  16. Irek Ulidowski
    Axiomatisations of Weak Equivalences for De Simone Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:219-233 [Conf]
  17. Roberto Segala
    A Compositional Trace-Based Semantics for Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:234-248 [Conf]
  18. Manuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz
    Acceptance Trees for Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:249-263 [Conf]
  19. David Harel
    Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:264-268 [Conf]
  20. Jeremy Bryans, Jim Davies, Steve Schneider
    Towards a denotational semantics for ET-LOTOS. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:269-283 [Conf]
  21. Farn Wang
    Reachability Analysis at Procedure Level through Timing Coincidence. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:284-298 [Conf]
  22. Walter Vogler
    Faster Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:299-312 [Conf]
  23. Ed Brinksma, Arend Rensink, Walter Vogler
    Fair Testing. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:313-327 [Conf]
  24. Dan Craigen
    Formal Methods Technology Transfer: Impediments and Innovation (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:328-332 [Conf]
  25. Parosh Aziz Abdulla, Mats Kindahl
    Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:333-347 [Conf]
  26. Petr Jancar, Faron Moller
    Checking Regular Properties of Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:348-362 [Conf]
  27. Marcello M. Bonsangue, Joost N. Kok, Erik P. de Vink
    Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:363-377 [Conf]
  28. Michael Siegel
    A Refinement Theory that Supports both 'Decrease of Nondeterminism' and 'Increase of Parallelism'. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:378-392 [Conf]
  29. E. Allen Emerson
    Efficient Automation of Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:393-394 [Conf]
  30. Edmund M. Clarke, Orna Grumberg, Somesh Jha
    Veryfying Parameterized Networks using Abstraction and Regular Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:395-407 [Conf]
  31. Orna Kupferman, Moshe Y. Vardi
    On the Complexity of Branching Modular Model Checking (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:408-422 [Conf]
  32. Roope Kaivola
    Axiomatising Linear Time Mu-calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:423-437 [Conf]
  33. P. S. Thiagarajan
    A Trace Consistent Subset of PTL. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:438-452 [Conf]
  34. Gerard J. Holzmann
    Tutorial: Proving Properties of Concurrent System with SPIN. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:453-455 [Conf]
  35. Anna Philippou, David Walker
    On Sharing and Determinacy in Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:456-470 [Conf]
  36. Simon Brock, Gerald Ostheimer
    Process Semantics of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:471-485 [Conf]
  37. Matthew Hennessy, Julian Rathke
    Bisimulations for a Calculus of Broadcasting Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:486-500 [Conf]
  38. Pedro R. D'Argenio, Sjouke Mauw
    Delayed choice for process algebra with abstraction. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:501-515 [Conf]
  39. Karlis Cerans
    CTR: A Calculus of Timed Refinement. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:516-530 [Conf]
  40. Ahmed Bouajjani, Yassine Lakhnech
    Temporal Logic + Timed Automata: Expressiveness and Decidability. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:531-545 [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