Deductive Verification of UML Models in TLPVS

Tamarah Arons, Jozef Hooman, Hillel Kugler, Amir Pnueli, Mark D. Van Der Zwaag

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

11 Scopus citations

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsThomas Baar, Alfred Strohmeier, Stephen J. Mellor, Ana Moreira
PublisherSpringer Verlag
Pages335-349
Number of pages15
ISBN (Print)3540233075, 9783540233077
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3273
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Deductive verification
  • Formal verification
  • PVS
  • Semantics
  • State machines
  • Temporal logic
  • UML

Fingerprint

Dive into the research topics of 'Deductive Verification of UML Models in TLPVS'. Together they form a unique fingerprint.

Cite this