article

Type-based information flow analysis for the π-calculus

Author:

Pages 291 - 347

Published: 01 December 2005 Publication History

Abstract

We propose a new type system for information flow analysis for the π-calculus. As demonstrated by recent studies, information about whether each communication succeeds is important for precise information flow analysis for concurrent programs. By collecting such information using ideas of our previous type systems for deadlock/livelock-freedom, our type system can perform more precise analysis for certain communication/synchronization patterns (like synchronization using locks) than previous type systems. Our type system treats a wide range of communication/synchronization primitives in a uniform manner, which enabled development of a clear proof of type soundness and a sound and complete type inference algorithm.

Cited By

View all

Ji ZWang SXu X(2023)Session Types with Multiple Senders Single ReceiverDependable Software Engineering. Theories, Tools, and Applications10.1007/978-981-99-8664-4_7(112-131)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1007/978-981-99-8664-4_7
Derakhshan FBalzer SJia LGorla D(2021)Session logical relations for noninterferenceProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470654(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470654
Lange JNg NToninho BYoshida N(2017)Fencing off go: liveness and safety for channel-based programmingACM SIGPLAN Notices10.1145/3093333.300984752:1(748-761)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009847
Show More Cited By

Type-based information flow analysis for the π-calculus
1. Theory of computation
  1. Semantics and reasoning

Recommendations

Type-based information flow analysis for the Π-calculus

We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important for precise information flow analysis for concurrent programs. By ...
A generic type system for the Pi-calculus

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 ...
A generic type system for the Pi-calculus

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 ...

Comments

Information & Contributors

Information

Published In

Acta Informatica Volume 42, Issue 4

Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi

December 2005

121 pages

ISSN:0001-5903

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 December 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ji ZWang SXu X(2023)Session Types with Multiple Senders Single ReceiverDependable Software Engineering. Theories, Tools, and Applications10.1007/978-981-99-8664-4_7(112-131)Online publication date: 27-Nov-2023
Derakhshan FBalzer SJia LGorla D(2021)Session logical relations for noninterferenceProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470654(1-14)Online publication date: 29-Jun-2021
Lange JNg NToninho BYoshida N(2017)Fencing off go: liveness and safety for channel-based programmingACM SIGPLAN Notices10.1145/3093333.300984752:1(748-761)Online publication date: 1-Jan-2017
Lange JNg NToninho BYoshida NCastagna GGordon A(2017)Fencing off go: liveness and safety for channel-based programmingProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009847(748-761)Online publication date: 1-Jan-2017
Kobayashi NLaneve C(2017)Deadlock analysis of unbounded process networksInformation and Computation10.1016/j.ic.2016.03.004252:C(48-70)Online publication date: 1-Feb-2017
Castagna GGordon A(2017)Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesundefinedOnline publication date: 1-Jan-2017
Vassena MRusso AMurray TStefan D(2016)On Formalizing Information-Flow Control LibrariesProceedings of the 2016 ACM Workshop on Programming Languages and Analysis for Security10.1145/2993600.2993608(15-28)Online publication date: 24-Oct-2016
Ngo TStoelinga MHuisman M(2014)Effective verification of confidentiality for multi-threaded programsJournal of Computer Security10.5555/2595841.259584422:2(269-300)Online publication date: 1-Mar-2014
Padovani LHenzinger TMiller D(2014)Deadlock and lock freedom in the linear π-calculusProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1145/2603088.2603116(1-10)Online publication date: 14-Jul-2014
Capecchi SCastellani IDezani-Ciancaglini M(2014)Typing access control and secure information flow in sessionsInformation and Computation10.1016/j.ic.2014.07.005238:C(68-105)Online publication date: 1-Nov-2014
Show More Cited By

Abstract

Cited By

Recommendations