The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Eike Best
    Partial Order Semantics of Concurrent Programs (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:1- [Conf]
  2. Roberto Gorrieri, Ugo Montanari
    SCONE: A Simple Calculus of Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:2-30 [Conf]
  3. Matthew Hennessy
    Value-Passing in Process Algebras (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:31- [Conf]
  4. C. A. R. Hoare
    Let's Make Models (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:32- [Conf]
  5. Kim Guldstrand Larsen
    Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ... [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:33-56 [Conf]
  6. Martín Abadi
    An Axiomatization of Lamport's Temporal Logic of Actions. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:57-69 [Conf]
  7. Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda
    Convergence of Iteration Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:70-82 [Conf]
  8. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with a Zero Object. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:83-98 [Conf]
  9. Frank S. de Boer, Catuscia Palamidessi
    On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:99-114 [Conf]
  10. Julian C. Bradfield, Colin Stirling
    Verifying Temporal Properties of Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:115-125 [Conf]
  11. Ivan Christoff
    Testing Equivalences and Fully Abstract Models for Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:126-140 [Conf]
  12. Rance Cleaveland, Bernhard Steffen
    A Preorder for Partial Process Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:141-151 [Conf]
  13. Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager
    Back and Forth Bisimulations. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:152-165 [Conf]
  14. Jörg Desel
    Reduction and Design of Well-behaved Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:166-181 [Conf]
  15. Javier Esparza
    Synthesis Rules for Petri Nets, and How they Lead to New Results. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:182-198 [Conf]
  16. Alan Fekete, Nancy A. Lynch
    The Need for Headers: An Impossibility Result for Communication over Unreliable Channels. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:199-215 [Conf]
  17. Yulin Feng, Junbo Liu
    A Temporal Approach to Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:216-229 [Conf]
  18. Nissim Francez, Ira R. Forman
    Superimposition for Interacting Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:230-245 [Conf]
  19. Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow
    An Implementation of a Translational Semantics for an Imperative Language. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:246-262 [Conf]
  20. Richard Gerber, Insup Lee
    CCSR: A Calculus for Communicating Shared Resources. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:263-277 [Conf]
  21. Rob J. van Glabbeek
    The Linear Time-Branching Time Spectrum (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:278-297 [Conf]
  22. E. Pascal Gribomont
    A Programming Logic for Formal Concurent Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:298-313 [Conf]
  23. Jan Friso Groote
    A New Strategy for Proving omega-Completeness applied to Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:314-331 [Conf]
  24. Jan Friso Groote
    Transition System Specifications with Negative Premises (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:332-341 [Conf]
  25. Mark B. Josephs, Jan Tijmen Udding
    Delay-Insensitive Circuits: An Algebraic Approach to their Design. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:342-366 [Conf]
  26. Chi-Chang Jou, Scott A. Smolka
    Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:367-383 [Conf]
  27. José Meseguer
    Rewriting as a Unified Model of Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:384-400 [Conf]
  28. Faron Moller, Chris M. N. Tofts
    A Temporal Calculus of Communicating Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:401-415 [Conf]
  29. Pawel Paczkowski
    Proving Termination of Communicating Programs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:416-426 [Conf]
  30. Huajun Qin, Philip Lewis
    Factorization of Finite State Machines under Observational Equivalence. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:427-441 [Conf]
  31. Antonia Sinachopoulos
    Partial Order Logics for Elementary Net Systems: State- and Event-approaches. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:442-455 [Conf]
  32. Scott A. Smolka, Bernhard Steffen
    Priority as Extremal Probability. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:456-466 [Conf]
  33. Chris M. N. Tofts
    A Synchronous Calculus of Relative Frequency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:467-480 [Conf]
  34. Glynn Winskel
    On the Compositional Checking of Validity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:481-501 [Conf]
  35. Wang Yi
    Real-Time Behaviour of Asynchronous Agents. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:502-520 [Conf]
  36. Serge Yoccoz
    Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:521-536 [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