Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Concurrency (computer science)

Known as: Concurrency, Concurrency theory, Concurrent system 
In computer science, concurrency is the decomposability property of a program, algorithm, or problem into order-independent or partially-ordered… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Scratch is a visual programming environment that is widely used by young people. We investigated if Scratch can be used to teach… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Highly Cited
2002
Highly Cited
2002
We describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment. Our… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Highly Cited
1992
Highly Cited
1992
Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems… Expand
Highly Cited
1990
Highly Cited
1990
A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent… Expand
  • figure 1
  • figure 4
  • figure 5
Highly Cited
1989
Highly Cited
1989
  • R. Milner
  • PHI Series in computer science
  • 1989
  • Corpus ID: 36788371
Foreword. 1. Modelling Communication. 2. Basic Definitions. 3. Equational laws and Their Application. 4. Strong Bisimulation and… Expand
Highly Cited
1987
Highly Cited
1987
  • D. Harel
  • Sci. Comput. Program.
  • 1987
  • Corpus ID: 13380874
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the… Expand
Highly Cited
1986
Highly Cited
1986
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a… Expand
Highly Cited
1981
Highly Cited
1981
  • D. Park
  • Theoretical Computer Science
  • 1981
  • Corpus ID: 206841958
The paper is concerned with ways in which fair concurrency can be modelled using notations for omega-regular languages… Expand
Highly Cited
1978
Highly Cited
1978
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating… Expand
  • figure 2