Axiomatic semantics of projection temporal logic programs†

  • Authors:

  • Xiaoxiao Yang;Zhenhua Duan;Qian Ma

  • Affiliations:

  • Institute of computing theory and technology, and isn laboratory, xidian university, xi'an, 710071china and laboratory for computer science, institute of software, chinese academy of sciences, p.o ...;Institute of computing theory and technology, and isn laboratory, xidian university, xi'an, 710071china email: zhhduan@mail.xidian.edu.cn;Institute of computing theory and technology, and isn laboratory, xidian university, xi'an, 710071china email: qma@mail.xidian.edu.cn

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we investigate the axiomatic semantics of the projection temporal logic programming language MSVL. To this end, we employ Propositional Projection Temporal Logic (PPTL) as an assertion language to specify the desired properties. We give a set of state axioms and state inference rules. In order to deduce a program over an interval, we also formalise a set of rules in terms of a Hoare logic-like triple. These rules enable us to deduce a program into its normal form and from the current state to the next one. They also enable us to verify properties over intervals. In this way, an axiom system for proving the correctness of MSVL programs is established. The axiom system is proved to be sound and relatively complete with respect to an operational model of MSVL, and give an example showing how the axiom system works. Finally, we employ a recently developed prototype verifier based on PVS as an example of semi-automatic verification using MSVL.