Filters








49 Hits in 10.1 sec

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

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.  ...  Most importantly, we define an encoding of the session πcalculus into the standard typed πcalculus in order to understand the expressive power of these concurrent calculi.  ...  Currently, I am a postdoc at the University of Glasgow and supported by the UK EPSRC project From Data Types to Session Types: A Basis for Concurrency and Distribution (ABCD) (EP/K034413/1).  ... 
dblp:journals/eatcs/Dardha15 fatcat:3ae2m4ywkvbajhnrgtd675xwze

Behavioural Types for Service Integration: Achievements and Challenges

Antonio Brogi, Carlos Canal, Ernesto Pimentel
2007 Electronical Notes in Theoretical Computer Science  
for a real impact of these ideas in the software world.  ...  Increasing attention is being paid to the development of so-called behavioural types as a means to formally address the problem of ensuring the correct interoperation of software components as well as  ...  Finally, the type system is guided by the syntax and some indications about how to construct both type-check and reconstruction algorithms are provided.  ... 
doi:10.1016/j.entcs.2006.10.045 fatcat:ojnemm7xszdo3m7v2x5skge6by

A partially deadlock-free typed process calculus

Naoki Kobayashi
1998 ACM Transactions on Programming Languages and Systems  
We propose a novel static type system for a process calculus, which ensures both partial deadlockfreedom and partial confluence.  ...  type information can be used for reasoning about program behavior.  ...  Pierce and David N. Turner for joyful discussions and a number of useful suggestions. Among others, Benjamin C. Pierce suggested that we consider polymorphism on time tags, and David N.  ... 
doi:10.1145/276393.278524 fatcat:lmrvadvtwvdp7dzi3znqvflm4m

A generic type system for the Pi-calculus

Atsushi Igarashi, Naoki Kobayashi
2004 Theoretical Computer Science  
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  ...  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.  ...  Acknowledgments We would like to thank Andrew Gordon, Jakob Rehof, and Eijiro Sumii for useful discussions and comments.  ... 
doi:10.1016/s0304-3975(03)00325-6 fatcat:p63poknv7baillwteswjibueve

A generic type system for the Pi-calculus

Atsushi Igarashi, Naoki Kobayashi
2001 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01  
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  ...  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.  ...  Acknowledgments We would like to thank Andrew Gordon, Jakob Rehof, and Eijiro Sumii for useful discussions and comments.  ... 
doi:10.1145/360204.360215 dblp:conf/popl/IgarashiK01 fatcat:u3riwxedwrb3lew7qcew3gmt2y

A generic type system for the Pi-calculus

Atsushi Igarashi, Naoki Kobayashi
2001 SIGPLAN notices  
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  ...  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.  ...  Acknowledgments We would like to thank Andrew Gordon, Jakob Rehof, and Eijiro Sumii for useful discussions and comments.  ... 
doi:10.1145/373243.360215 fatcat:ier7dccoabghxde53ixrq4pq4q

Nomadic pict

Peter Sewell, Paweł T. Wojciechowski, Asis Unyapoth
2010 ACM Transactions on Programming Languages and Systems  
This requires novel equivalences and congruence results that take migration into account, and reasoning principles for agents that are temporarily immobile (e.g. waiting on a lock elsewhere in the system  ...  Based on the calculi, we design and implement the Nomadic Pict distributed programming language, to let such algorithms (and simple applications above them) to be quickly prototyped.  ...  We also owe special thanks to Benjamin and to David N. Turner for allowing us to use the source code of Pict. We also thank Robin Milner and Ken Moody for their support.  ... 
doi:10.1145/1734206.1734209 fatcat:wocbql7agna3vigdrpmsjq7nwm

Deadlock-Free Typestate-Oriented Programming

Luca Padovani
2018 The Art, Science, and Engineering of Programming  
In this work, we put forward a refinement of TSOP for concurrent objects guaranteeing that well-typed programs not only conform with the protocol of the objects they use, but are also deadlock free.  ...  objects and detect circularities that might cause deadlocks.  ...  Acknowledgements The author is grateful to the anonymous reviewers for their questions and thoughtful comments on an early version of this paper. References  ... 
doi:10.22152/programming-journal.org/2018/2/15 fatcat:tdvd5ii6kza7pihksa7cwec75e

Implementing Choreography Extraction [article]

Luis Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi, Larisa Safina
2022 arXiv   pre-print
We discuss the data structures needed for an efficient implementation, introduce some optimisations, and perform a systematic practical evaluation.  ...  We propose a new extraction methodology that improves on the state of the art: we can deal with programs that are equipped with state and internal computation and time complexity is dramatically better  ...  Montesi was supported in part by Villum Fonden, grant 29518, and  ... 
arXiv:2205.02636v2 fatcat:huevtvpvd5eadgdyffuanirps4

Parallel computing with the Pi-calculus

Frédéric Peschanski
2011 Proceedings of the sixth workshop on Declarative aspects of multicore programming - DAMP '11  
makes the underlying algorithms both simple and naturally concurrent.  ...  Our approach mimics the evolution from lambda-calculi to functional programming languages, but with the pi-calculus as a starting point.  ...  The implementation uses modern concurrency control features and lock-free algorithms, especially the lazy invalidation scheme explained previously.  ... 
doi:10.1145/1926354.1926363 dblp:conf/popl/Peschanski11 fatcat:jorf5pkbx5c4vf4yeumz22sux4

Fair Termination of Multiparty Sessions [article]

Luca Ciccone and Francesco Dagnino and Luca Padovani
2022 arXiv   pre-print
Fair termination is termination under a fairness assumption that disregards those interactions deemed unfair and therefore unrealistic.  ...  In this work we propose the first type system ensuring that well-typed multiparty sessions, including those exhibiting the aforementioned dependencies, fairly terminate.  ...  Padovani [40] adapts and extends the type system of Kobayashi [28] to enforce lock freedom in the linear π-calculus [31] , into which binary sessions can be encoded [18] .  ... 
arXiv:2205.08786v1 fatcat:sx5dqilrezat7dxhk3b2u5y2cy

Session Types Revisited [chapter]

Ornela Dardha
2016 Type Systems for Distributed Programs: Components and Sessions  
We show that session types are encodable into standard π -types, relying on linear and variant types.  ...  corresponding properties of standard π -types.  ...  Dardha is supported by the EPSRC project From Data Types to Session Types: A Basis for Concurrency and Distribution (ABCD) (EP/K034413/1).  ... 
doi:10.2991/978-94-6239-204-5_6 fatcat:i7mdgivmu5awpgvibo34wxtypq

Session types revisited

Ornela Dardha, Elena Giachino, Davide Sangiorgi
2012 Proceedings of the 14th symposium on Principles and practice of declarative programming - PPDP '12  
We show that session types are encodable into standard π -types, relying on linear and variant types.  ...  corresponding properties of standard π -types.  ...  Dardha is supported by the EPSRC project From Data Types to Session Types: A Basis for Concurrency and Distribution (ABCD) (EP/K034413/1).  ... 
doi:10.1145/2370776.2370794 dblp:conf/ppdp/DardhaGS12 fatcat:sheadxnyd5fnfaiye7nqaelbk4

Ninth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 20-22, 2008

Kurt Jensen
2008 DAIMI Report Series  
This booklet contains the proceedings of the Ninth Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 20-22, 2008.  ...  This work was supported by Končar -Electrical Engineering Institute, Croatia, and the Ministry of Science, Education and Sports of the Republic of Croatia. Acknowledgements.  ...  Acknowledgements: We would like to thank the anonymous referees fro their careful reading and helpful comments.  ... 
doi:10.7146/dpb.v37i588.7188 fatcat:46y3jj345zha7etipizaaoiism
« Previous Showing results 1 — 15 out of 49 results