Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus

Authors:
Jayasri Banerjee;Anup Kumar Bandyopadhyay;Ajit Kumar Mandal
Affiliations:
Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India
Venue:
ACM SIGPLAN Notices
Year:
2007

Citing 5
Cited 1

A deadlock-free communication kernel for loop architecture

Information Processing Letters
Avoidance of deadlock in loop structures—a two process solution

Euromicro 91 Proceedings of the seventeenth Euromicro conference on Software and hardware : specification and design: specification and design
On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification

Journal of Systems Architecture: the EUROMICRO Journal
A Discipline of Programming

A Discipline of Programming
Adding the leads-to operator to Dijkstra's calculus

ACM SIGPLAN Notices

Fairness and conspiracy concepts in concurrent systems

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weakest precondition calculus is used to specify a system implemented by a cyclic interconnection of sequential processes. From this specification a predicate is derived that describes the deadlock freedom property of the system. Invariance of the predicate is proved from the specification.