The geometry of semaphore programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unique decomposition of processes
Theoretical Computer Science
Handbook of logic in computer science (vol. 4)
Verification of Parallel Systems via Decomposition
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Orthogonal Polyhedra: Representation and Computation
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Decomposition orders: another generalisation of the fundamental theorem of arithmetic
Theoretical Computer Science - Process algebra
A practical application of geometric semantics to static analysis of concurrent programs
CONCUR 2005 - Concurrency Theory
Rigorous evidence of freedom from concurrency faults in industrial control software
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Unique parallel decomposition in branching and weak bisimulation semantics
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Hi-index | 0.00 |
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs are given a geometric semantics using cubical areas, for which a unique factorization theorem is proved. An effective factorization method which is correct and complete with respect to the geometric semantics is derived from the factorization theorem. This algorithm is implemented in the static analyzer ALCOOL.