Weak and strong fairness in CCS
Information and Computation
Object-oriented concurrent programming
Object-oriented concurrent programming
Parallel processing: principles and practice
Parallel processing: principles and practice
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A calculus of mobile processes, I
Information and Computation
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Toward foundations of concurrent object-oriented programming-types and language design
Theory and Practice of Object Systems
Foundations of programming languages
Foundations of programming languages
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependent types in practical programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The name discipline of uniform receptiveness
Theoretical Computer Science
Concurrent programming in ML
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
A generic type system for the Pi-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Concurrent Objects in a Process Calculus
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Time regions and effects for resource usage analysis
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Communications of the ACM - Service-oriented computing
A generic type system for the Pi-calculus
Theoretical Computer Science
Behavioural Types for Service Integration: Achievements and Challenges
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coq Library for Verification of Concurrent Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A Type System for Client Progress in a Service-Oriented Calculus
Concurrency, Graphs and Models
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Responsiveness in process calculi
Theoretical Computer Science
Theoretical Computer Science
Trustworthy Global Computing
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A hybrid type system for lock-freedom of mobile processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Type abstractions of name-passing processes
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
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 progress for structured communications
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Fundamenta Informaticae - Dependently Typed Programming
Responsive choice in mobile processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Typing asymmetric client-server interaction
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Resource usage analysis for the π-calculus
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Deadlock verification of a DPS coordination strategy and its alternative model in pi-calculus
International Journal of Intelligent Information and Database Systems
Static safety for an actor dedicated process calculus by abstract interpretation
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Strong Normalization in the π-calculus with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Hi-index | 0.00 |
Advanced type systems for the π-calculus have recently been proposed to guarantee deadlock-freedom in the sense that certain communications will eventually succeed unless the whole process diverges. Although such guarantees are useful for reasoning about the behavior of concurrent programs, there still remains the weakness that the success of a communication is not completely guaranteed due to the possibility of divergence. For example, although a server process that has received a request message cannot discard the request, it is allowed to infinitely delegate the request to other processes, causing a livelock. In this paper, we present a type system which guarantees that certain communications will eventually succeed under fair scheduling, regardless of whether processes diverge. We also present a variant of the type system which guarantees that a communication will succeed within a given number of reduction steps.