CITI has stopped operations in 2014, to co-launch NOVA LINCS THIS SITE IS NOT BEING UPDATED SINCE 2013
citi banner
  Home  \  Publications  \  InProceedings Page Login  
banner bottom
File Top
Towards static deadlock resolution in the pi calculus

Static analysis techniques based on session types discern concurrent programs that ensure the fidelity of protocol sessions -- for each input (output) end point of a session there is exactly an output (input) end point available -- being expressive enough to represent the standard pi-calculus and several typing disciplines. More advanced type systems, enforcing properties as deadlock-freedom or even progress, sensibly reduce the set of typed processes, thus mining the expressiveness of the analysis. Herein, we propose a first step towards a compromise solution to this problem: a session based type checking algorithm that releases some deadlocks (when co-actions on the same channel occur in sequence in a thread). This procedure may help the software development process: the typing algorithm detects a deadlock, but instead of rejecting the code, fixes it by looking into the session types and producing new safe code that obeys the protocols and is deadlock-free.

@ 8th International Symposium on Trustworthy Global Computing (TGC 2013)

Editors: Springer

Series: Lecture Notes in Computer Science

Number: 8358

Publisher: Springer-Verlag ( Germany )

Date: 2014


File Bottom