default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 37 matches
- 1990
- Martín Abadi:
An Axiomatization of Lamport's Temporal Logic of Actions. CONCUR 1990: 57-69 - Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda:
Convergence of Iteration Systems (Extended Abstract). CONCUR 1990: 70-82 - Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with a Zero Object. CONCUR 1990: 83-98 - Eike Best:
Partial Order Semantics of Concurrent Programs (Abstract). CONCUR 1990: 1 - Frank S. de Boer, Catuscia Palamidessi:
On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences. CONCUR 1990: 99-114 - Julian C. Bradfield, Colin Stirling:
Verifying Temporal Properties of Processes. CONCUR 1990: 115-125 - Ivan Christoff:
Testing Equivalences and Fully Abstract Models for Probabilistic Processes. CONCUR 1990: 126-140 - Rance Cleaveland, Bernhard Steffen:
A Preorder for Partial Process Specifications. CONCUR 1990: 141-151 - Jörg Desel:
Reduction and Design of Well-behaved Concurrent Systems. CONCUR 1990: 166-181 - Javier Esparza:
Synthesis Rules for Petri Nets, and How they Lead to New Results. CONCUR 1990: 182-198 - Alan D. Fekete, Nancy A. Lynch:
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels. CONCUR 1990: 199-215 - Yulin Feng, Junbo Liu:
A Temporal Approach to Algebraic Specifications. CONCUR 1990: 216-229 - Nissim Francez, Ira R. Forman:
Superimposition for Interacting Processes. CONCUR 1990: 230-245 - Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow:
An Implementation of a Translational Semantics for an Imperative Language. CONCUR 1990: 246-262 - Richard Gerber, Insup Lee:
CCSR: A Calculus for Communicating Shared Resources. CONCUR 1990: 263-277 - Rob J. van Glabbeek:
The Linear Time-Branching Time Spectrum (Extended Abstract). CONCUR 1990: 278-297 - Roberto Gorrieri, Ugo Montanari:
SCONE: A Simple Calculus of Nets. CONCUR 1990: 2-30 - E. Pascal Gribomont:
A Programming Logic for Formal Concurent Systems. CONCUR 1990: 298-313 - Jan Friso Groote:
A New Strategy for Proving omega-Completeness applied to Process Algebra. CONCUR 1990: 314-331 - Jan Friso Groote:
Transition System Specifications with Negative Premises (Extended Abstract). CONCUR 1990: 332-341 - Matthew Hennessy:
Value-Passing in Process Algebras (Abstract). CONCUR 1990: 31 - C. A. R. Hoare:
Let's Make Models (Abstract). CONCUR 1990: 32 - Mark B. Josephs, Jan Tijmen Udding:
Delay-Insensitive Circuits: An Algebraic Approach to their Design. CONCUR 1990: 342-366 - Chi-Chang Jou, Scott A. Smolka:
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. CONCUR 1990: 367-383 - Kim Guldstrand Larsen:
Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ... CONCUR 1990: 33-56 - José Meseguer:
Rewriting as a Unified Model of Concurrency. CONCUR 1990: 384-400 - Faron Moller, Chris M. N. Tofts:
A Temporal Calculus of Communicating Systems. CONCUR 1990: 401-415 - Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager:
Back and Forth Bisimulations. CONCUR 1990: 152-165 - Pawel Paczkowski:
Proving Termination of Communicating Programs. CONCUR 1990: 416-426 - Huajun Qin, Philip Lewis:
Factorization of Finite State Machines under Observational Equivalence. CONCUR 1990: 427-441
skipping 7 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-17 04:07 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint