Computer Science – Logic in Computer Science
Scientific paper
2010-04-16
Computer Science
Logic in Computer Science
15 pages
Scientific paper
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.
Balabonski Thibaut
Haucourt Emmanuel
No associations
LandOfFree
A Geometric Approach to the Problem of Unique Decomposition of Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Geometric Approach to the Problem of Unique Decomposition of Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Geometric Approach to the Problem of Unique Decomposition of Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-623691