Deadlock Freedom for Asynchronous and Cyclic Process Networks

نویسندگان

چکیده

This paper considers the challenging problem of establishing deadlock freedom for message-passing processes using behavioral type systems. In particular, we consider case that implement session types by communicating asynchronously in cyclic process networks. We present APCP, a typed framework which supports asynchronous communication, delegation, recursion, and general form composition enables specifying discuss main decisions involved design APCP illustrate its expressiveness flexibility several examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems

We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, in which objects are types containing safety speci cations and morphisms are processes. We then use a speci cation structure to add information to the types so that they specify stronger properties. In this paper the s...

متن کامل

Distributed Deadlock Detection for Distributed Process Networks

The distributed process network (DPN) model allows for greater scalability and performance over a non-distributed process network model. This paper presents a distributed deadlock detection algorithm applicable to process networks. The algorithm efficiently detects both local and global deadlocks. In addition, the deadlock detection algorithm has minimal bandwidth and memory requirements. Lastl...

متن کامل

An Expressive Framework for Verifying Deadlock Freedom

This paper presents an expressive specification and verification framework for ensuring deadlock freedom of shared-memory concurrent programs that manipulate locks. We introduce a novel delayed lockset checking technique to guarantee deadlock freedom of programs with interactions between thread and lock operations. With disjunctive formulae, we highlight how an abstraction based on precise lock...

متن کامل

Tighter Reachability Criteria for Deadlock-Freedom Analysis

We combine a prior incomplete deadlock-freedom-checking approach with two new reachability techniques to create a more precise deadlock-freedom-checking framework for concurrent systems. The reachability techniques that we propose are based on the analysis of individual components of the system; we use static analysis to summarise the behaviour that might lead components to this system state, a...

متن کامل

Types for Deadlock-freedom: The Synchronous Case

Many di erent notions of \program property", and many di erent methods of verifying such properties, arise naturally in programming. We present a general framework of Speci cation Structures for combining di erent notions and methods in a coherent fashion. We then apply the idea of speci cation structures to concurrency in the setting of Interaction Categories. As a speci c example, a certain s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2021

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.347.3