Inference of Session Types From Control Flow

Authors:
Peter Collingbourne;Paul H. J. Kelly
Affiliations:
Department of Computing, Imperial College London, London, SW7 2AZ, United Kingdom;Department of Computing, Imperial College London, London, SW7 2AZ, United Kingdom
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 10
Cited 3

Register promotion by sparse partial redundancy elimination of loads and stores

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Types and programming languages

Types and programming languages
Specifying Distributed Software Architectures

Proceedings of the 5th European Software Engineering Conference
Types for Dynamic Interaction

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Compatibility Verification for Web Service Choreography

ICWS '04 Proceedings of the IEEE International Conference on Web Services
Subtyping for session types in the pi calculus

Acta Informatica
Typing the Behavior of Software Components using Session Types

Fundamenta Informaticae
Finite automata and their decision problems

IBM Journal of Research and Development
Bounded session types for object oriented languages

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects

Session-Based Distributed Programming in Java

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Synchronous Multiparty Session Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Checking conformance of a producer and a consumer

Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled session type syntax a well-formedness constraint based upon normalisation and explore the effects thereof. We present our inference algorithm declaratively and in a form suitable for implementation, and illustrate it with examples. We then present an implementation of the algorithm using a program analysis and transformation toolkit.