A reduction theorem for concurrent object-oriented programs

Authors:
Jayadev Misra
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Venue:
Programming methodology
Year:
2003

Citing 4
Cited 2

Loosely-coupled processes

Future Generation Computer Systems - Special issue: PARLE 91
Reduction: a method of proving properties of parallel programs

Communications of the ACM
A discipline of multiprogramming: programming theory for distributed applications

A discipline of multiprogramming: programming theory for distributed applications
Reduction in TLA

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory

Temporal logic verification of lock-freedom

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Mechanically verified proof obligations for linearizability

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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.