Weakest precondition based modelling and verification of a class of concurrent systems

Authors:
Anup Kumar Bandyopadhyay
Affiliations:
Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700032, India
Venue:
International Journal of Artificial Intelligence and Soft Computing
Year:
2010

Citing 14
Cited 2

win and sin: predicate transformers for concurrency

ACM Transactions on Programming Languages and Systems (TOPLAS)
A temporal proof methodology for reactive systems

JCIT Proceedings of the fifth Jerusalem conference on Information technology
Mathematical logic for computer science

Mathematical logic for computer science
Predicate transformers for reasoning about concurrent computation

Science of Computer Programming
Proving Liveness Properties of Concurrent Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Maintaining knowledge about temporal intervals

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
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
The Science of Programming

The Science of Programming
Adding the leads-to operator to Dijkstra's calculus

ACM SIGPLAN Notices
Verifying mutual exclusion and liveness properties with split preconditions

Journal of Computer Science and Technology
Ordering of events in two-process concurrent system

ACM SIGSOFT Software Engineering Notes
On the correctness issues in two-process mutual exclusion algorithms

ACM SIGSOFT Software Engineering Notes
Modeling fairness and starvation in concurrent systems

ACM SIGSOFT Software Engineering Notes

Modeling of state transition rules and its application

ACM SIGSOFT Software Engineering Notes
Application of TLRO to refute an incorrect mutual exclusion algorithm

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

A weakest precondition based modelling and verification technique for a class of concurrent systems is proposed. A system in this class is defined by a set of non-terminating interactive sequential processes. The constituent processes are allowed to include both if-then-else and terminating while-do type control structures. The properties of the system are verified by proving the invariance of logical formulae. The technique is illustrated by considering Dekker's two process mutual exclusion algorithm as an example.