The name discipline of uniform receptiveness
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A type system for lock-free processes
Information and Computation - IFIP TCS2000
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Journal of Functional Programming
Strong normalisation in the π-calculus
Information and Computation
Type-based information flow analysis for the π-calculus
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Mathematical Structures in Computer Science
Ensuring termination by typability
Information and Computation
Program termination analysis in polynomial time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving that programs eventually do something good
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Responsiveness in process calculi
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
On the complexity of termination inference for processes
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
A capability calculus for concurrency and determinism
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Spatial and behavioral types in the pi-calculus
Information and Computation
Responsive choice in mobile processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
| Hi-index | 0.01 |
We propose a type system for lock-freedom in the 茂戮驴-calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it can verify lock-freedom of concurrent programs that have sophisticated recursive communication structures; it can be fully automated; it is hybrid, in that it combines a type system for lock-freedom with local reasoning about deadlock-freedom, termination, and confluence analyses. Moreover, the type system is parameterized by deadlock-freedom/termination/confluence analyses, so that any methods (e.g. type systems and model checking) can be used for those analyses. A lock-freedom analysis tool has been implemented based on the proposed type system, and tested for non-trivial programs.