Filters








274 Hits in 7.0 sec

Deadlock and lock freedom in the linear π-calculus

Luca Padovani
2014 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) - CSL-LICS '14  
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  ...  in cyclic network topologies.  ...  Deadlock freedom. [19] defines a type system for ensuring deadlock freedom in the π-calculus.  ... 
doi:10.1145/2603088.2603116 dblp:conf/csl/Padovani14 fatcat:o3fy2tvbxzeghddxe2zankfmxu

Type Systems for Distributed Programs: Session Communication

Ornela Dardha
2015 Bulletin of the European Association for Theoretical Computer Science  
We study advanced safety properties related to communication, like deadlock or lock freedom and progress.  ...  We study session types in the πcalculus describing distributed systems and communication-centric computation.  ...  I am also thankful to all my co-authors mentioned in the introduction, from whom I learned a lot.  ... 
dblp:journals/eatcs/Dardha15 fatcat:3ae2m4ywkvbajhnrgtd675xwze

What Is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1997 BRICS Report Series  
The pi-calculus with synchronous output and mixed-guarded choices is strictly more expressive than the pi-calculus with asynchronous output and no choice.  ...  to compositionality and divergence-freedom.  ...  The subscripts a and s denote calculi with asynchronous and π mix s [Pal97] π sep Figure 1 : Encodings for choice and synchrony in the asynchronous π-calculus synchronous output, respectively, whereas  ... 
doi:10.7146/brics.v4i45.19266 fatcat:ft4tknmnenfczpy6wvorru2r7e

What is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1999 BRICS Report Series  
The pi-calculus with synchronous output and mixed-guarded choices is strictly more expressive than the pi-calculus with asynchronous output and no choice.  ...  to compositionality and divergence-freedom.  ...  discussions, and the anonymous referees for their constructive remarks.  ... 
doi:10.7146/brics.v6i43.20113 fatcat:zdh72ucvkbabllrkhmvrd7lrzu

A hybrid type system for lock-freedom of mobile processes

Naoki Kobayashi, Davide Sangiorgi
2010 ACM Transactions on Programming Languages and Systems  
We propose a type system for lock-freedom in the π-calculus, which guarantees that certain communications will eventually succeed.  ...  We use Kobayashi's lock freedom types [12] , which refine those of the simply-typed π-calculus with channel usages, to express the  ...  Acknowledgment We would like to thank Eijiro Sumii for discussions on this work, and Luca Aceto, Xavier Leroy, and Benjamin Pierce for pointers to relevant work.  ... 
doi:10.1145/1745312.1745313 fatcat:644i2tgwb5elfjgiokjh6j67hm

Progress as Compositional Lock-Freedom [chapter]

Marco Carbone, Ornela Dardha, Fabrizio Montesi
2014 Lecture Notes in Computer Science  
Interestingly, our new catalysers lead to a novel characterisation of progress in terms of the standard notion of lock-freedom.  ...  We combine our results with existing techniques for lock-freedom, obtaining a new methodology for proving progress.  ...  The works in [2, 26] use linear logic to type processes in the π-calculus with sessions.  ... 
doi:10.1007/978-3-662-43376-8_4 fatcat:u4vkspeacjf4xdq3eqhcbn4wqy

Behavioural Types for Service Integration: Achievements and Challenges

Antonio Brogi, Carlos Canal, Ernesto Pimentel
2007 Electronical Notes in Theoretical Computer Science  
The objective of this paper is to provide an insightful synthesis of the state-of-the-art in this area, both to summarise the main results achieved and to point out some important challenges to be faced  ...  for a real impact of these ideas in the software world.  ...  Consequently, lock-freedom is defined in [5] as a combination of both deadlock and livelock-freedom, and a type system for ensuring lock-freedom is presented.  ... 
doi:10.1016/j.entcs.2006.10.045 fatcat:ojnemm7xszdo3m7v2x5skge6by

Progress as Compositional Lock Freedom [chapter]

Ornela Dardha
2016 Type Systems for Distributed Programs: Components and Sessions  
Interestingly, our new catalysers lead to a novel characterisation of progress in terms of the standard notion of lock-freedom.  ...  We combine our results with existing techniques for lock-freedom, obtaining a new methodology for proving progress.  ...  The works in [2, 26] use linear logic to type processes in the π-calculus with sessions.  ... 
doi:10.2991/978-94-6239-204-5_14 fatcat:4lyc54zhjbavthi2rtt4s7jsde

Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi [chapter]

Luca Padovani, Tzu-Chun Chen, Andrea Tosatto
2015 Lecture Notes in Computer Science  
We define complete type reconstruction algorithms for two type systems ensuring deadlock and lock freedom of linear π-calculus processes.  ...  Our work automates the verification of deadlock/lock freedom for a non-trivial class of processes that includes interleaved binary sessions and, to great extent, multiparty sessions as well.  ...  The authors are grateful to the reviewers for their detailed comments and useful suggestions. The first two authors have been supported by Ateneo/CSP project SALT.  ... 
doi:10.1007/978-3-319-19282-6_6 fatcat:xypzrq4oifaitddgzsg6ys7d4a

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom

Rob van Glabbeek, Peter Hofner, Ross Horne
2021 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
We fix a minimal session calculus and systematically take into account all known fairness assumptions, thereby identifying precisely three interesting and semantically distinct notions of lock-freedom,  ...  We then show that, by using a general merge operator in an otherwise standard approach to global session types, we obtain a session type system complete for the strongest amongst those notions of lock-freedom  ...  Acknowledgement: The key question addressed in this paper arose in conversation with Ilaria Castellani, Mariangiola Dezani-Ciancaglini, and Paola Giannini, to whom we are grateful for their generous feedback  ... 
doi:10.1109/lics52264.2021.9470531 fatcat:vze43imt65cvlg22ifos3klqty

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom [article]

Rob van Glabbeek and Peter Höfner and Ross Horne
2021 arXiv   pre-print
We fix a minimal session calculus and systematically take into account all known fairness assumptions, thereby identifying precisely three interesting and semantically distinct notions of lock-freedom,  ...  We then show that, by using a general merge operator in an otherwise standard approach to global session types, we obtain a session type system complete for the strongest amongst those notions of lock-freedom  ...  Acknowledgement: The key question addressed in this paper arose in conversation with Ilaria Castellani, Mariangiola Dezani-Ciancaglini, and Paola Giannini, to whom we are grateful for their generous feedback  ... 
arXiv:2104.14226v1 fatcat:zdgngsnpkbaa5ipum35tnn3dfi

Foundations of Session Types and Behavioural Contracts

Hans Hüttel, Emilio Tuosto, Hugo Torres Vieira, Gianluigi Zavattaro, Ivan Lanese, Vasco T. Vasconcelos, Luís Caires, Marco Carbone, Pierre-Malo Deniélou, Dimitris Mostrous, Luca Padovani, António Ravara
2016 ACM Computing Surveys  
Behavioural type systems, usually associated to concurrent or distributed computations, encompass concepts such as interfaces, communication protocols, and contracts, in addition to the traditional input  ...  Two related important notions of behavioural types are those of session types and behavioural contracts. This article surveys the main accomplishments of the last 20 years within these two approaches.  ...  Padovani [2014] proposes a type system ensuring deadlock and lock freedom of linear π -calculus processes.  ... 
doi:10.1145/2873052 fatcat:zpqnnmimwrglxeulwo4duwqbw4

Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References [chapter]

Kohei Suenaga
2008 Lecture Notes in Computer Science  
We present a type-based deadlock-freedom verification for concurrent programs with non-block-structured lock primitives and mutable references.  ...  Our type system uses a novel combination of lock levels, obligations and ownerships. Lock levels are used to guarantee that locks are acquired in a specific order.  ...  We also thank the members of Kobayashi-Sumii group in Tohoku University and anonymous reviewers for their comments.  ... 
doi:10.1007/978-3-540-89330-1_12 fatcat:l6k6sj6ib5ckjgna5teourhhxm

Comparing Deadlock-Free Session Typed Processes

Ornela Dardha, Jorge A. Pérez
2015 Electronic Proceedings in Theoretical Computer Science  
In this paper, we compare L and K, two classes of deadlock-free, session typed concurrent processes.  ...  This requirement has been expressed by liveness properties such as progress or (dead)lock freedom. Several typing disciplines that ensure these properties for mobile processes have been proposed.  ...  Notice that in the absence of divergent behaviors, deadlock-and lock-freedom coincide.  ... 
doi:10.4204/eptcs.190.1 fatcat:qxplk5uwy5a5jkgvwo4hqqgraq

A New Linear Logic for Deadlock-Free Session-Typed Processes [chapter]

Ornela Dardha, Simon J. Gay
2018 Lecture Notes in Computer Science  
The first is the propositions-as-types approach by Caires and Pfenning, which provides a linear logic foundation for session types and guarantees deadlock-freedom by forbidding cyclic process connections  ...  The π-calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency.  ...  We are grateful for suggestions and feedback from the anonymous reviewers and colleagues: Wen Kokke, Sam Lindley, Roly Perera, Frank Pfenning, Carsten Schürmann and Philip Wadler.  ... 
doi:10.1007/978-3-319-89366-2_5 fatcat:ehz7wogjh5gdpfjiufqv7lt56m
« Previous Showing results 1 — 15 out of 274 results