Loading...
Please wait, while we are loading the content...
Similar Documents
A reduction theorem for concurrent object-oriented programs (2003).
| Content Provider | CiteSeerX |
|---|---|
| Author | Misra, Jayadev |
| Abstract | ABSTRACT A typical execution of a concurrent program is an interleaving of the threads of its components. It is well known that the net effect of a concurrent execution may be quite different from the serial executions of its components. In this paper we introduce a programming notation for concurrent object-oriented programs, called Seuss, and show that concurrent executions of its programs are, under certain conditions, equivalent to serial executions. This allows us to reason about a Seuss program as if its components will be executed serially whereas an implementation may execute its components concurrently, for performance reasons. 1 |
| File Format | |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Reduction Theorem Seuss Program Performance Reason Concurrent Object-oriented Program Serial Execution Programming Notation Net Effect Concurrent Execution Certain Condition Concurrent Program Typical Execution |
| Content Type | Text |
| Resource Type | Article |
