Chapter

«UML» 2004 — The Unified Modeling Language. Modeling Languages and Applications

Volume 3273 of the series Lecture Notes in Computer Science pp 335-349

Deductive Verification of UML Models in TLPVS

  • Tamarah AronsAffiliated withThe John von Neumann Minerva Center for Verification of Reactive Systems, Weizmann Institute of Science
  • , Jozef HoomanAffiliated withDepartment of Computer Science, University of NijmegenEmbedded Systems Institute
  • , Hillel KuglerAffiliated withThe John von Neumann Minerva Center for Verification of Reactive Systems, Weizmann Institute of Science
  • , Amir PnueliAffiliated withThe John von Neumann Minerva Center for Verification of Reactive Systems, Weizmann Institute of Science
  • , Mark van der ZwaagAffiliated withDepartment of Computer Science, University of Nijmegen

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In recent years, UML has been applied to the development of reactive safety-critical systems, in which the quality of the developed software is a key factor. In this paper we present an approach for the deductive verification of such systems using the PVS interactive theorem prover. Using a PVS specification of a UML kernel language semantics, we generate a formal representation of the UML model. This representation is then verified using tlpvs, our PVS-based implementation of linear temporal logic and some of its proof rules. We apply our method by verifying two examples, demonstrating the feasibility of our approach on models with unbounded event queues, object creation, and variables of unbounded domain. We define a notion of fairness for UML systems, allowing us to verify both safety and liveness properties.

Keywords

Formal Verification Deductive Verification PVS UML State Machines Semantics Temporal Logic