A generic type system for the Pi-calculus

Authors:
Atsushi Igarashi;Naoki Kobayashi
Affiliations:
Kyoto University, Kyoto, Japan;Tokyo Institute of Technology, Tokyo, Japan
Venue:
Theoretical Computer Science
Year:
2004

Citing 36
Cited 43

Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
A sort inference algorithm for the polyadic &pgr;-calculus

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order concurrent programs with finite communication topology (extended abstract)

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementation of the typed call-by-value λ-calculus using a stack of regions

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline

Information and Computation
Toward foundations of concurrent object-oriented programming-types and language design

Theory and Practice of Object Systems
Composing processes

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal and temporal logics for processes

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
A partially deadlock-free typed process calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-based analysis of uncaught exceptions

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Changeable interfaces and promised messages for concurrent components

Proceedings of the 1999 ACM symposium on Applied computing
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for object initialization in the Java bytecode language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Behavioral equivalence in the polymorphic pi-calculus

Journal of the ACM (JACM)
Type reconstruction for linear &pgr;-calculus with I/O subtyping

Information and Computation
Type-based race detection for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Enforcing high-level protocols in low-level software

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Types as models: model checking message-passing programs

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A uniform type structure for secure information flow

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource usage analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flow-sensitive type qualifiers

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Adoption and focus: practical linear types for imperative programming

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communication and Concurrency

Communication and Concurrency
A type system for lock-free processes

Information and Computation - IFIP TCS2000
Time regions and effects for resource usage analysis

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Concurrent Objects in a Process Calculus

TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
The Polyadic Pi-calculus (Abstract)

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A pi-Calculus Semantics for an Object-Based Design Notation

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Principal Typing Schemes in a Polyadic pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Program Analysis Using Mixed Term and Set Constraints

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Typing correspondence assertions for communication protocols

Theoretical Computer Science
Authenticity by Typing for Security Protocols

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations

Correspondence assertions for process synchronization in concurrent communications

Journal of Functional Programming
Resource usage analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Types and full abstraction for polyadic π-calculus

Information and Computation
Type checking a multithreaded functional language with session types

Theoretical Computer Science
Behavioural Types for Service Integration: Achievements and Challenges

Electronic Notes in Theoretical Computer Science (ENTCS)
Multiparty asynchronous session types

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A capability calculus for concurrency and determinism

ACM Transactions on Programming Languages and Systems (TOPLAS)
Spatial and Behavioral Types in the Pi-Calculus

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Types and higher-order recursion schemes for verification of higher-order programs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Conversation Types

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
Type Systems for Bigraphs

Trustworthy Global Computing
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Foundations of session types

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
ν -Types for Effects and Freshness Analysis

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Typechecking Safe Process Synchronization

Electronic Notes in Theoretical Computer Science (ENTCS)
Modular session types for distributed object-oriented programming

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types and full abstraction for polyadic π-calculus

Information and Computation
A calculus for orchestration of web services

ESOP'07 Proceedings of the 16th European conference on Programming
Regulating data exchange in service oriented applications

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Type abstractions of name-passing processes

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Timed, distributed, probabilistic, typed processes

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Type-based verification of correspondence assertions for communication protocols

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Formal analysis of BPMN via a translation into COWS

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
Spatial and behavioral types in the pi-calculus

Information and Computation
Sessions and session types: an overview

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Conversation types

Theoretical Computer Science
A WSDL-based type system for asynchronous WS-BPEL processes

Formal Methods in System Design
Typed Ψ-calculi

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
Resource usage analysis for the π-calculus

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
An Algebra of Behavioural Types

Information and Computation
Deciding safety properties in infinite-state pi-calculus via behavioural types

Information and Computation
A process calculus for qos-aware applications

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
A provably correct compiler for efficient model checking of mobile processes

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Static safety for an actor dedicated process calculus by abstract interpretation

FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Behavioural contracts with request-response operations

COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Parameterized verification of π-calculus systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A unified theory of program logics: an approach based on the π-calculus

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Behavioural contracts with request-response operations

Science of Computer Programming
The type discipline of behavioral separation

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	5.23

Visualization

Abstract

We propose a general, powerful framework of type systems for the π-calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express types and type environments as abstract processes: We can check various properties of a process by checking the corresponding properties of its type environment. The framework clarifies the essence of recent complex type systems, and it also enables sharing of a large amount of work such as a proof of type preservation, making it easy to develop new type systems.