Mathematical logic for computer science
Mathematical logic for computer science
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)
Specifying Concurrent Program Modules
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
A Discipline of Programming
Verification and Specifications of Concurrent Programs
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
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
Application of TLRO to dining philosophers problem
ACM SIGSOFT Software Engineering Notes
ACM SIGSOFT Software Engineering Notes
Application of TLRO to refute an incorrect mutual exclusion algorithm
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
A state transition rule is viewed as a cause and effect relationship. An example is selected from the common sense world. Six different instances of this relationship are enumerated. A temporal logic based on observation is proposed. This logic is used to model the enumerated instances. Assuming some necessary properties of a transition rule only two relevant models are selected. One of them ensures that the precondition is necessary where the other guarantees its sufficiency. Noting these two characteristics the first one is opted for proving the safety property where the second is used to prove progress. We have considered Peterson's two process mutual exclusion algorithm as an illustrative example