Conferences in DBLP
Eike Best Partial Order Semantics of Concurrent Programs (Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:1- [Conf ] Roberto Gorrieri , Ugo Montanari SCONE: A Simple Calculus of Nets. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:2-30 [Conf ] Matthew Hennessy Value-Passing in Process Algebras (Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:31- [Conf ] C. A. R. Hoare Let's Make Models (Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:32- [Conf ] Kim Guldstrand Larsen Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ... [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:33-56 [Conf ] Martín Abadi An Axiomatization of Lamport's Temporal Logic of Actions. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:57-69 [Conf ] 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 ] Jos C. M. Baeten , Jan A. Bergstra Process Algebra with a Zero Object. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:83-98 [Conf ] 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 ] Julian C. Bradfield , Colin Stirling Verifying Temporal Properties of Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:115-125 [Conf ] Ivan Christoff Testing Equivalences and Fully Abstract Models for Probabilistic Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:126-140 [Conf ] Rance Cleaveland , Bernhard Steffen A Preorder for Partial Process Specifications. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:141-151 [Conf ] Rocco De Nicola , Ugo Montanari , Frits W. Vaandrager Back and Forth Bisimulations. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:152-165 [Conf ] Jörg Desel Reduction and Design of Well-behaved Concurrent Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:166-181 [Conf ] 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 ] 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 ] Yulin Feng , Junbo Liu A Temporal Approach to Algebraic Specifications. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:216-229 [Conf ] Nissim Francez , Ira R. Forman Superimposition for Interacting Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:230-245 [Conf ] 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 ] Richard Gerber , Insup Lee CCSR: A Calculus for Communicating Shared Resources. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:263-277 [Conf ] Rob J. van Glabbeek The Linear Time-Branching Time Spectrum (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:278-297 [Conf ] E. Pascal Gribomont A Programming Logic for Formal Concurent Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:298-313 [Conf ] 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 ] Jan Friso Groote Transition System Specifications with Negative Premises (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:332-341 [Conf ] 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 ] 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 ] José Meseguer Rewriting as a Unified Model of Concurrency. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:384-400 [Conf ] Faron Moller , Chris M. N. Tofts A Temporal Calculus of Communicating Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:401-415 [Conf ] Pawel Paczkowski Proving Termination of Communicating Programs. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:416-426 [Conf ] Huajun Qin , Philip Lewis Factorization of Finite State Machines under Observational Equivalence. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:427-441 [Conf ] Antonia Sinachopoulos Partial Order Logics for Elementary Net Systems: State- and Event-approaches. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:442-455 [Conf ] Scott A. Smolka , Bernhard Steffen Priority as Extremal Probability. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:456-466 [Conf ] Chris M. N. Tofts A Synchronous Calculus of Relative Frequency. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:467-480 [Conf ] Glynn Winskel On the Compositional Checking of Validity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:481-501 [Conf ] Wang Yi Real-Time Behaviour of Asynchronous Agents. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:502-520 [Conf ] Serge Yoccoz Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:521-536 [Conf ]