Computer Science – Programming Languages
Scientific paper
2010-10-27
EPTCS 38, 2010, pp. 13-27
Computer Science
Programming Languages
In Proceedings ICE 2010, arXiv:1010.5308
Scientific paper
10.4204/EPTCS.38.4
We investigate a graphical representation of session invocation interdependency in order to prove progress for the pi-calculus with sessions under the usual session typing discipline. We show that those processes whose associated dependency graph is acyclic can be brought to reduce. We call such processes transparent processes. Additionally, we prove that for well-typed processes where services contain no free names, such acyclicity is preserved by the reduction semantics. Our results encompass programs (processes containing neither free nor restricted session channels) and higher-order sessions (delegation). Furthermore, we give examples suggesting that transparent processes constitute a large enough class of processes with progress to have applications in modern session-based programming languages for web services.
Carbone Marco
Debois Søren
No associations
LandOfFree
A Graphical Approach to Progress for Structured Communication in Web Services 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 Graphical Approach to Progress for Structured Communication in Web Services, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Graphical Approach to Progress for Structured Communication in Web Services will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-484633