Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics of concurrent computation: a concurrent program is executed in a stepwise fashion, with only one enabled action being executed at each step. Interleaving semantics, in effect, requires that a concurrent program be executed as a nondeterministic sequential program. This is clearly an abstraction of the way in which concurrent programs are actually executed. To ensure that this is a reasonable abstraction, interleaving semantics should only be used to reason about programs with "simple" actions; we call such programs "atomic." In this paper, we formally characterize the class of atomic programs. We adopt the criterion that ...
AbstractMost of the models used to describe the behaviours of concurrent programs and to prove some ...
To avoid data races, concurrent operations should either be at distinct times or on distinct data. A...
Copyright is held by the owner/author(s). Despite much research on concurrent programming languages,...
We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, ...
In concurrent programming, non-blocking synchronization is very efficient but difficult to design co...
We argue that it is possible, and sometimes useful, to reason about nonatomic programs within the co...
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
Abstract Concurrent and reactive programs are specified by their behaviours in the pres-ence of a no...
Abstract. We look at approaches to specifying concurrent program modules based on disjointness (the ...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
This paper shows how the concept of atomicity can ease the development of concurrent software. It il...
We present a proof calculus and method for the static verification of assertions and procedure speci...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of an indivisible...
AbstractMost of the models used to describe the behaviours of concurrent programs and to prove some ...
To avoid data races, concurrent operations should either be at distinct times or on distinct data. A...
Copyright is held by the owner/author(s). Despite much research on concurrent programming languages,...
We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, ...
In concurrent programming, non-blocking synchronization is very efficient but difficult to design co...
We argue that it is possible, and sometimes useful, to reason about nonatomic programs within the co...
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
Abstract Concurrent and reactive programs are specified by their behaviours in the pres-ence of a no...
Abstract. We look at approaches to specifying concurrent program modules based on disjointness (the ...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
This paper shows how the concept of atomicity can ease the development of concurrent software. It il...
We present a proof calculus and method for the static verification of assertions and procedure speci...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of an indivisible...
AbstractMost of the models used to describe the behaviours of concurrent programs and to prove some ...
To avoid data races, concurrent operations should either be at distinct times or on distinct data. A...
Copyright is held by the owner/author(s). Despite much research on concurrent programming languages,...