论文信息 - The geometry of semaphore programs

The geometry of semaphore programs

Synchronization errors in concurrent programs are notoriously difficult to find and correct. Deadlock, partial deadlock, and unsafeness are conditions that constitute such errors. A model of concurrent semaphore programs based on multidimensional, solid geometry is presented. While previously reported geometric models are restricted to two-process mutual exclusion problems, the model described here applies to a broader class of synchronization problems. The model is shown to be exact for systems composed of an arbitrary, yet fixed number of concurrent processes, each consisting of a straight line sequence of arbitrarily ordered semaphore operations.

Paul F. Reynolds | Scott D. Carson | S. Carson | P. Reynolds

[1] D CarsonScott,et al. The geometry of semaphore programs , 1987 .

[2] Christos H. Papadimitriou,et al. A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems , 1981, J. Algorithms.

[3] Edsger W. Dijkstra,et al. Co-operating sequential processes , 1968 .

[4] Scott David Carson. Geometric models of concurrent programs , 1984 .

[5] Edmund M. Clarke. Synthesis of Resource Invariants for Concurrent Programs , 1980, TOPL.

[6] Richard C. Holt,et al. Some deadlock properties of computer systems , 1971, SOSP '71.

[7] Arie Shoshani,et al. System Deadlocks , 1971, CSUR.

[8] Christos H. Papadimitriou,et al. Concurrency Control by Locking , 1983, SIAM J. Comput..

[9] Edmund M. Clarke. Synthesis of resource invariants for concurrent programs , 1979, POPL '79.

[10] Mihalis Yannakakis,et al. Locking policies: Safety and freedom from deadlock , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).