Mechanizing The Temporal Logic Of Actions In HOL

Abstract

A n attempt to mechanise reasoning about concurrent algorithms is described. The HOY, theorem prover is used i o formalise the semantics of the Temporal Logic of Actions (TLA) . Using this formalisation, the proof rules of T L A are proved as theorems in the HOL system. Two examples show how TLA-reasoning about algorithms can then be carried out using the HOL syst em.