A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for lock-free processes
Information and Computation - IFIP TCS2000
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
A generic type system for the Pi-calculus
Theoretical Computer Science
Strong normalisation in the π-calculus
Information and Computation
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
Subtyping for session types in the pi calculus
Acta Informatica
Type-based information flow analysis for the π-calculus
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Secure Implementations for Typed Session Abstractions
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Electronic Notes in Theoretical Computer Science (ENTCS)
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
Structured communication-centred programming for 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
Spatial-behavioral types, distributed services, and resources
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
A formal semantics for protocol narrations
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A new type system for deadlock-free processes
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
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Calculi, types and applications
Theoretical Computer Science
Spatial-behavioral types for concurrency and resource control in distributed systems
Theoretical Computer Science
Session and Union Types for Object Oriented Programming
Concurrency, Graphs and Models
The Pairing of Contracts and Session Types
Concurrency, Graphs and Models
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Structured Interactional Exceptions in Session Types
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Global Progress in Dynamically Interleaved Multiparty Sessions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Amalgamating sessions and methods in object-oriented languages with generics
Theoretical Computer Science
Information and Computation
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
Provably Correct Implementations of Services
Trustworthy Global Computing
Structured Communications with Concurrent Constraints
Trustworthy Global Computing
Security Types for Sessions and Pipelines
Web Services and Formal Methods
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Two notions of sub-behaviour for session-based client/server systems
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Session types as intuitionistic linear propositions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Theoretical Computer Science
Typing copyless message passing
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
On global types and multi-party sessions
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Typing asymmetric client-server interaction
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Constraints for service contracts
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
A polymorphic type system with progress for binary sessions
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
On action permutation and progress for partially commutative asynchronous binary sessions
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Hi-index | 0.00 |
We propose a new typing system for the π-calculus with sessions, which ensures the progress property, i.e. once a session has been initiated, typable processes will never starve at session channels. In the current literature progress for session types has been guaranteed only in the case of nested sessions, disallowing more than two session channels interfered in a single thread. This was a severe restriction since many structured communications need combinations of sessions. We overcome this restriction by inferring the order of channel usage, but avoiding any tagging of channels and names, neither explicit nor inferred. The simplicity of the typing system essentially relies on the session typing discipline, where sequencing and branching of communications are already structured by types. The resulting typing enjoys a stronger progress property than that one in the literature: it assures that for each well-typed process P which contains an open session there is an irreducible process Q such that the parallel composition P|Q is well-typed too and it always reduces, also in presence of interfered sessions.