Adding the leads-to operator to Dijkstra's calculus

Authors:
Awadhesh Kumar Singh;Anup Kumar Bandyopadhyay
Affiliations:
National Institute of Technology, Kurukshetra, India;Jadavpur University, Kolkata, India
Venue:
ACM SIGPLAN Notices
Year:
2004

Citing 8
Cited 3

The existence of refinement mappings

Theoretical Computer Science
Mathematical logic for computer science

Mathematical logic for computer science
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate transformers for reasoning about concurrent computation

Science of Computer Programming
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
Seven Myths of Formal Methods

IEEE Software
A TLA Solution to the Specification and Verification of the RLP1 Retransmission Protocol

FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods

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

ACM SIGPLAN Notices
Modeling fairness and starvation in concurrent systems

ACM SIGSOFT Software Engineering Notes
Weakest precondition based modelling and verification of a class of concurrent systems

International Journal of Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A temporal operator, namely leads-to, has been incorporated into the Dijkstra's weakest precondition calculus. It is demonstrated that the augmented calculus provides a basis, not only for the modeling but also, for a straightforward and thorough analysis of large and complex distributed systems. The technique has been illustrated by describing a data link layer protocol. This analysis contributes to the understanding of the system.