research-article

Deadlock and lock freedom in the linear π-calculus

Author:

Luca PadovaniAuthors Info & Claims

CSL-LICS '14: Proceedings 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)

Article No.: 72, Pages 1 - 10

https://doi.org/10.1145/2603088.2603116

Published: 14 July 2014 Publication History

Abstract

We study two refinements of the linear π-calculus that ensure deadlock freedom (the absence of stable states with pending linear communications) and lock freedom (the eventual completion of pending linear communications). The main feature of both type systems is a new form of channel polymorphism that affects their accuracy in a significant way: they are the first of their kind that can deal with recursive processes connected by cyclic networks.

References

[1]

L. Bettini, M. Coppo, L. D'Antoni, M. De Luca, M. Dezani-Ciancaglini, and N. Yoshida. Global progress in dynamically interleaved multiparty sessions. In Proceedings of CONCUR'08, LNCS 5201, pages 418--433, 2008.

Digital Library

[2]

E. Bonelli and A. B. Compagnoni. Multipoint session types for a distributed calculus. In Proceedings of TGC'07, LNCS 4912, pages 240--256. Springer, 2008.

Digital Library

[3]

E. Bonelli, A. B. Compagnoni, and E. L. Gunter. Correspondence assertions for process synchronization in concurrent communications. Journal of Functional Programming, 15(2):219--247, 2005.

Digital Library

[4]

V. Bono and L. Padovani. Typing Copyless Message Passing. Logical Methods in Computer Science, 8:1--50, 2012.

[5]

D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323--342, 1983.

Digital Library

[6]

L. Caires and F. Pfenning. Session types as intuitionistic linear propositions. In Proceedings of CONCUR'10, LNCS 6269, pages 222--236, 2010.

Digital Library

[7]

G. Castagna, M. Dezani-Ciancaglini, and L. Padovani. On Global Types and Multi-Party Sessions. Logical Methods in Computer Science, 8:1--45, 2012.

[8]

G. Cécé and A. Finkel. Verification of programs with half-duplex communication. Information and Computation, 202(2):166--190, 2005.

Digital Library

[9]

M. Coppo, M. Dezani-Ciancaglini, L. Padovani, and N. Yoshida. Inference of Global Progress Properties for Dynamically Interleaved Multi-party Sessions. In Proceedings of COORDINATION'13, LNCS 7890, pages 45--59. Springer, 2013.

[10]

M. Coppo, M. Dezani-Ciancaglini, N. Yoshida, and L. Padovani. Global progress for dynamically interleaved multiparty sessions. Mathematical Structures in Computer Science, to appear.

[11]

B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95--169, 1983.

[12]

O. Dardha, E. Giachino, and D. Sangiorgi. Session types revisited. In Proceedings of PPDP'12, pages 139--150. ACM, 2012.

Digital Library

[13]

R. Demangeon and K. Honda. Nested protocols in session types. In Proceedings of CONCUR'12, LNCS 7454, pages 272--286. Springer, 2012.

Digital Library

[14]

Y. Deng and D. Sangiorgi. Ensuring termination by typability. Information and Computation, 204(7):1045--1082, 2006.

Digital Library

[15]

P.-M. Deniélou and N. Yoshida. Multiparty session types meet communicating automata. In Proceedings of ESOP'12, LNCS 7211, pages 194--213. Springer, 2012.

Digital Library

[16]

P.-M. Deniélou, N. Yoshida, A. Bejleri, and R. Hu. Parameterised multiparty session types. Logical Methods in Computer Science, 8(4), 2012.

[17]

K. Honda. Types for dyadic interaction. In Proceedings of CONCUR'93, LNCS 715, pages 509--523. Springer, 1993.

Digital Library

[18]

K. Honda, V. T. Vasconcelos, and M. Kubo. Language primitives and type disciplines for structured communication-based programming. In Proceedings of ESOP'98, LNCS 1381, pages 122--138. Springer, 1998.

Digital Library

[19]

K. Honda, N. Yoshida, and M. Carbone. Multiparty asynchronous session types. In Proceedings of POPL'08, pages 273--284. ACM, 2008.

Digital Library

[20]

A. Igarashi and N. Kobayashi. Type reconstruction for linear -calculus with i/o subtyping. Information and Computation, 161(1):1--44, 2000.

Digital Library

[21]

S. Jakšić and L. Padovani. Exception Handling for Copyless Messaging. Science of Computer Programming, 84:22--51, 2014.

Digital Library

[22]

N. Kobayashi. A type system for lock-free processes. Information and Computation, 177(2):122--159, 2002.

Digital Library

[23]

N. Kobayashi. Type-based information flow analysis for the pi-calculus. Acta Informatica, 42(4-5):291--347, 2005.

Digital Library

[24]

N. Kobayashi. A new type system for deadlock-free processes. In Proceedings of CONCUR'06, LNCS 4137, pages 233--247. Springer, 2006.

Digital Library

[25]

N. Kobayashi. Type systems for concurrent programs. Technical report, Tohoku University, 2007. Short version appeared in 10th Anniversary Colloquium of UNU/IIST, 2002.

[26]

N. Kobayashi and D. Sangiorgi. A hybrid type system for lock-freedom of mobile processes. ACM Transactions on Programming Languages and Systems, 32(5), 2010.

Digital Library

[27]

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems, 21(5):914--947, 1999.

Digital Library

[28]

F. Montesi and N. Yoshida. Compositional choreographies. In Proceedings of CONCUR'13, LNCS 8052, pages 425--439. Springer, 2013.

Digital Library

[29]

L. Padovani. From Lock Freedom to Progress Using Session Types. In Proceedings of PLACES'13, EPTCS 137, pages 3--19, 2013.

[30]

L. Padovani. Type reconstruction for the linear π-calculus with composite and equi-recursive types. In Proceedings of FoSSaCS'14, LNCS 8412, pages 88--102. Springer, 2014.

[31]

L. Padovani. Deadlock and lock freedom in the linear π-calculus. Technical report, Università di Torino, 2014. Available at http://hal.inria.fr/hal-00932356/.

[32]

L. Padovani and L. Novara. Types for deadlock-free higher-order concurrent programs. Technical report, Università di Torino, 2014. Available at http://hal.inria.fr/hal-00954364/.

[33]

H. T. Vieira and V. T. Vasconcelos. Typing progress in communication-centred systems. In Proceedings of COORDINATION'13, LNCS 7890, pages 236--250. Springer, 2013.

[34]

P. Wadler. Propositions as sessions. In Proceedings of ICFP'12, pages 273--286. ACM, 2012.

Digital Library

Cited By

van den Heuvel BPérez J(2024)A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by TypingElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.414.1414(1-20)Online publication date: 11-Dec-2024
https://doi.org/10.4204/EPTCS.414.1
Barbanera FDezani-Ciancaglini Mde'Liguoro U(2024)Partial Typing for Asynchronous Multiparty SessionsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.408.1408(1-20)Online publication date: 1-Oct-2024
https://doi.org/10.4204/EPTCS.408.1
Castellani I(2024)A simple view of multiparty session typesProceedings of the 26th International Symposium on Principles and Practice of Declarative Programming10.1145/3678232.3678252(1-3)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1145/3678232.3678252
Show More Cited By

Index Terms

Deadlock and lock freedom in the linear π-calculus
1. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models
  2. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

Static lock capabilities for deadlock freedom
TLDI '12: Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation

We present a technique --- lock capabilities --- for statically verifying that multithreaded programs with locks will not deadlock. Most previous work on deadlock prevention requires a strict total order on all locks held simultaneously by a thread, but ...
A Dependently Typed Linear π-Calculus in Agda
PPDP '20: Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming

Session types have consolidated as a formalism for the specification and static enforcement of communication protocols. Many different theories of dependent session types have been proposed, some enabling refined specifications on the content of ...
Freedom from Deadlock of Safe Locking Policies

The usual method for preserving the consistency of a database when accessed (read and updated) concurrently by several transactions, is by locking the transactions according to some locking policy; a locking policy that guarantees the preservation of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CSL-LICS '14: Proceedings 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)

July 2014

764 pages

ISBN:9781450328869

DOI:10.1145/2603088

Program Chairs:
Thomas Henzinger
Institute of Science and Technology (IST), Austria
,
Dale Miller
INRIA and LIX/Ecole Polytechnique, Palaiseau

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGLOG: ACM Special Interest Group on Logic and Computation
EACSL: European Association for Computer Science Logic
IEEE-CS\DATC: IEEE Computer Society

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 July 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CSL-LICS '14

Sponsor:

SIGLOG
EACSL
IEEE-CS\DATC

CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC

July 14 - 18, 2014

Vienna, Austria

Acceptance Rates

CSL-LICS '14 Paper Acceptance Rate 74 of 212 submissions, 35%;

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
230
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)4

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

van den Heuvel BPérez J(2024)A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by TypingElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.414.1414(1-20)Online publication date: 11-Dec-2024
https://doi.org/10.4204/EPTCS.414.1
Barbanera FDezani-Ciancaglini Mde'Liguoro U(2024)Partial Typing for Asynchronous Multiparty SessionsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.408.1408(1-20)Online publication date: 1-Oct-2024
https://doi.org/10.4204/EPTCS.408.1
Castellani I(2024)A simple view of multiparty session typesProceedings of the 26th International Symposium on Principles and Practice of Declarative Programming10.1145/3678232.3678252(1-3)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1145/3678232.3678252
Dal Lago UPadovani L(2024)On the Almost-Sure Termination of Binary SessionsProceedings of the 26th International Symposium on Principles and Practice of Declarative Programming10.1145/3678232.3678239(1-12)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1145/3678232.3678239
Jacobs JHinrichsen JKrebbers R(2024)Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message PassingProceedings of the ACM on Programming Languages10.1145/36328898:POPL(1385-1417)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632889
Barbanera FBono VDezani-Ciancaglini M(2024)Partially Typed Multiparty Sessions with Internal DelegationJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.101018(101018)Online publication date: Oct-2024
https://doi.org/10.1016/j.jlamp.2024.101018
Horne RPadovani L(2024)A Logical Account of Subtyping for Session TypesJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.100986(100986)Online publication date: May-2024
https://doi.org/10.1016/j.jlamp.2024.100986
Ciccone LDagnino FPadovani L(2024)Fair Termination of Multiparty SessionsJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.100964(100964)Online publication date: Mar-2024
https://doi.org/10.1016/j.jlamp.2024.100964
Barbanera FDezani-Ciancaglini M(2024)Asynchronous Multiparty Sessions with Internal DelegationLeveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola10.1007/978-3-031-73709-1_20(322-339)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-73709-1_20
Hirschkoff DPrebet E(2023)Using Pi-Calculus Names as LocksElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.387.7387(76-96)Online publication date: 14-Sep-2023
https://doi.org/10.4204/EPTCS.387.7
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten