Formalizing UML Models and OCL Constraints in PVS

Kyas, Marcel; Fecher, Harald; Boer, Frank S. de; Jacob, Joost; Hooman, Jozef; Zwaag, Mark van der; Arons, Tamarah; Kugler, Hillel

doi:10.1016/j.entcs.2004.09.027

Cited by 67 publications

(22 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The XMI output of the tool, representing the model in XML, is first preprocessed to remove a large amount of XMI information and to get a concise representation. Next it is transformed into a representation of the syntax of the model in PVS [27].…”

Section: Pvsmentioning

confidence: 99%

Supporting UML-based development of embedded systems by formal techniques

Hooman

Kugler

Ober³

et al. 2007

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

We describe an approach to support UMLbased development of embedded systems by formal techniques. A subset of UML is extended with timing annotations and given a formal semantics. UML models are translated, via XMI, to the input format of formal tools, to allow timed and non-timed model checking and interactive theorem proving. Moreover, the Play-Engine Communicated by Dr. Susanne Graf.This work has been supported by EU-project IST 33522 -OMEGA "Correct Development of Real-Time Embedded Systems in UML". For more information, see http://www-omega.imag.fr/. During this project, the second author was at the Weizmann Institute of Science, the third author at VERIMAG, the fourth author at OFFIS, and the fifth author at NLR.

show abstract

Section: Pvsmentioning

confidence: 99%

Supporting UML-based development of embedded systems by formal techniques

Hooman

Kugler

Ober³

et al. 2007

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

show abstract

“…Other solutions focus on static consistency (see e.g. [3], [5], [15]) or verify whether the behavior has been specified as intended (see e.g. [7], [1], [2], [14]), but only within a single description means for this purpose (e.g.…”

Section: Introductionmentioning

confidence: 99%

Verifying consistency between activity diagrams and their corresponding OCL contracts

Hilken

Seiter

Wille

et al. 2014

Proceedings of the 2014 Forum on Specification and Design Languages (FDL)

View full text Add to dashboard Cite

Abstract-Modeling languages such as SysML provide various description means for a precise specification of the desired system. As a system model typically uses multiple diagram types focusing on different aspects, it is crucial to keep them consistent to each other. In this paper, we propose a verification methodology which ensures the consistency between activity diagrams as blueprints for the implementation and their contracts from a block definition diagram. For this purpose, activity diagrams are transformed to OCL constraints that can be checked against pre-and postconditions. The proposed approach is evaluated in a case study based on an industrial specification.

show abstract

“…[6]), theorem provers (e.g. [7]), Constraint-Satisfaction-Problem (CSP) solvers (e.g [8]), and Boolean satisfiability (SAT) (e.g. [9]) have been applied for this purpose.…”

Section: Introductionmentioning

confidence: 99%

Verifying dynamic aspects of UML models

Soeken

Wille

Drechsler

2011

2011 Design, Automation &Amp; Test in Europe

View full text Add to dashboard Cite

Abstract-The Unified Modeling Language (UML) as a defacto standard for software development finds more and more application in the design of systems which also contain hardware components. Guaranteeing the correctness of a system specified in UML is thereby an important as well as challenging task. In recent years, first approaches for this purpose have been introduced. However, most of them focus only on the static view of a UML model.In this paper, an automatic approach is presented which checks verification tasks for dynamic aspects of a UML model. That is, given a UML model as well as an initial system state, the approach proves whether a sequence of operation calls exists so that a desired behavior is invoked. The underlying verification problem is encoded as an instance of the satisfiability problem and subsequently solved using a SAT Modulo Theory solver. An experimental evaluation confirms the applicability of the proposed approach.

show abstract

Formalizing UML Models and OCL Constraints in PVS

Cited by 67 publications

References 1 publication

Supporting UML-based development of embedded systems by formal techniques

Supporting UML-based development of embedded systems by formal techniques

Verifying consistency between activity diagrams and their corresponding OCL contracts

Verifying dynamic aspects of UML models

Contact Info

Product

Resources

About