Theoretical Computer Science
A sort inference algorithm for the polyadic &pgr;-calculus
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
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 Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Synchronization Expressed in Types of Communication Channels
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
A Partially Deadlock-free Typed Process Calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
What Are Polymorphically-Typed Ambients?
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Resource-Passing Concurrent Programming
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Type checking a multithreaded functional language with session types
Theoretical Computer Science
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
Calculi for Service-Oriented Computing
Formal Methods for Web Services
Secure Enforcement for Global Process Specifications
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
A distributed object-oriented language with session types
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Typing asymmetric client-server interaction
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
An Algebra of Behavioural Types
Information and Computation
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Session types for object-oriented languages
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Stateful contracts for affine types
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Orderly communication in the Ambient Calculus
Computer Languages, Systems and Structures
Typing the Behavior of Software Components using Session Types
Fundamenta Informaticae
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
From Implicit to Explicit Transitions in Business Protocols: A Semantic-Based Transformation
International Journal of Web Services Research
From Implicit to Explicit Transitions in Business Protocols: A Semantic-Based Transformation
International Journal of Web Services Research
| Hi-index | 0.00 |
We define an extension of the π-calculus with a static type system which supports high-level specifications of extended patterns of communication, such as client-server protocols. Subtyping allows protocol specifications to be extended in order to describe richer behaviour; an implemented server can then be replaced by a refined implementation, without invalidating type-correctness of the overall system. We use the POP3 protocol as a concrete example of this technique.