A generic type system for the Pi-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Journal of Functional Programming
Subtyping for session types in the pi calculus
Acta Informatica
Electronic Notes in Theoretical Computer Science (ENTCS)
Disciplining Orchestration and Conversation in Service-Oriented Computing
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Sessions and Pipelines for Structured Service Programming
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A Type System for Client Progress in a Service-Oriented Calculus
Concurrency, Graphs and Models
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
Asynchronous session types and progress for object oriented languages
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
How to infer finite session types in a calculus of services and sessions
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
On progress for structured communications
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A language for task orchestration and its semantic properties
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Session types for object-oriented languages
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Trustworthy Global Computing
Provably Correct Implementations of Services
Trustworthy Global Computing
Security Types for Sessions and Pipelines
Web Services and Formal Methods
Calculi for Service-Oriented Computing
Formal Methods for Web Services
Theoretical Computer Science
A unifying formal basis for the SENSORIA approach: a white paper
Rigorous software engineering for service-oriented systems
Static analysis techniques for session-oriented calculi
Rigorous software engineering for service-oriented systems
Typing asymmetric client-server interaction
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A formal model for service-oriented interactions
Science of Computer Programming
| Hi-index | 0.00 |
The notion of a session is fundamental in service-oriented applications, as it serves to separate interactions between clients and different instances of the same service, and to group together logical units of work. Recently, the Service Centered Calculus (SCC) has been proposed as a process calculus designed around the concept of a dyadic session between a service side and an invoker side, where interaction protocols and service orchestration can be conveniently expressed. In this paper we propose a generic type system to collect services' behaviours and then we fix a class of well-typed processes that are guaranteed to be deadlock free, in the sense that they either diverge by invoking new service instances or reach a normal form. The type system is based on previous research on traditional mobile calculi, here conveniently extended and simplified thanks to the neat discipline imposed by the linguistic primitives of SCC.