Predicate transformers for reasoning about concurrent computation
Science of Computer Programming
On concurrent programming
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Systems Architecture: the EUROMICRO Journal
Adding the leads-to operator to Dijkstra's calculus
ACM SIGPLAN Notices
Distributed Computing
On the correctness issues in two-process mutual exclusion algorithms
ACM SIGSOFT Software Engineering Notes
Weakest precondition based verification tool that models spatial ordering
ACM SIGSOFT Software Engineering Notes
Fairness and conspiracy concepts in concurrent systems
ACM SIGSOFT Software Engineering Notes
Modeling of state transition rules and its application
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
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Standard temporal logic is augmented and a new temporal quantifier viz., never is defined. This augmented logic is integrated in Dijkstra's weakest precondition calculus. Definitions for fairness and starvation for concurrent systems in terms of weakest precondition are presented. According to the existing concept fairness for a transition rule asserts that if a rule remains continuously enabled (weak fairness) or repeatedly enabled (strong fairness), then it must be executed., where in the proposed definition fairness is related to the permission for execution where starvation relies upon actual execution. This definition is used to prove fairness of a given concurrent system. Through different examples it is shown that fairness is not the only prerequisite for starvation freedom. Available techniques use 'leads to' operator that forecasts system behavior where the proposed proof technique moves backward in time.