ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Synthesis of Resource Invariants for Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Geometric models of concurrent programs
Geometric models of concurrent programs
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
IEEE Transactions on Parallel and Distributed Systems
An Example of Deriving Performance Properties from a Visual Representation of Program Execution
IEEE Transactions on Parallel and Distributed Systems
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
On the classification of dipaths in geometric models for concurrency
Mathematical Structures in Computer Science
A practical application of geometric semantics to static analysis of concurrent programs
CONCUR 2005 - Concurrency Theory
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Deadlocks and dihomotopy in mutual exclusion models
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Reasoning with geometric information in digital space
Knowledge-Based Systems
A geometric approach to the problem of unique decomposition of processes
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Streams, d-Spaces and Their Fundamental Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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.