Verification of UML/OCL Class Diagrams using Constraint Programming

Cabot, Jordi; Clarisó, Robert; Riera, Daniel

doi:10.1109/icstw.2008.54

Cited by 160 publications

(127 citation statements)

References 8 publications

(9 reference statements)

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…potential inconsistent interactions with integrity constraints) rather than checking whether an implementation fulfills the pre/postconditions. This is an extension of our previous work [9,19] which focused only on reasoning on integrity constraints without considering operations. The goal of this paper is twofold.…”

Section: Introductionmentioning

confidence: 84%

See 1 more Smart Citation

Verifying UML/OCL Operation Contracts

Cabot

Clarisó

Riera

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to ensure the quality of the final application. Research on model consistency has focused mostly on the models' static aspects. Instead, this paper addresses the verification of their dynamic aspects, expressed as a set of operations defined by means of pre/postcondition contracts. This paper presents an automatic method based on Constraint Programming to verify UML models extended with OCL constraints and operation contracts. In our approach, both static and dynamic aspects are translated into a Constraint Satisfaction Problem. Then, compliance of the operations with respect to several correctness properties such as operation executability or determinism are formally verified.

show abstract

Section: Introductionmentioning

confidence: 84%

“…The rules for the last two expressions are depicted in Figure 4 (see [9,19] for more examples). For more complex OCL operators and iterator expressions we have already implemented a parametrized library of Prolog rules (available in [19]) that maps the semantics of each predefined OCL construct.…”

Section: Translation Of Ocl Invariantsmentioning

confidence: 99%

Verifying UML/OCL Operation Contracts

Cabot

Clarisó

Riera

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The transformation of meta-level constraints such as OCL along with UML class diagrams to formal higher-order logic language called Isabelle has been explored in tools such as HOL-OCL [2]. Similarly, we have seen the transformation to constraint programming language ECLiPSE in [19]. Both, these approaches are used primarily for verification of a UML Class Diagram instance against the UMLCD meta-model specification.…”

Section: Related Workmentioning

confidence: 99%

Towards Domain-specific Model Editors with Automatic Model Completion

2009

View full text Add to dashboard Cite

Integrated development environments such as Eclipse allow users to write programs quickly by presenting a set of recommendations for code completion. Similarly, word processing tools such as Microsoft Word present corrections for grammatical errors in sentences. Both of these existing structure editors use a set of constraints expressed in the form of a natural language grammar to restrict/correct the user (syntax-directed editing) or formal grammar (language-directed editing) to aid document completion. Taking this idea further, in this paper we present an integrated software system capable of generating recommendations for model completion of partial models built in editors for domain-specific modelling languages. We present a methodology to synthesize model editors equipped with automatic completion from a modelling language's declarative specification consisting of a metamodel with a visual syntax. This meta-model directed completion feature is powered by a first-order relational logic engine implemented in ALLOY. We incorporate automatic completion in the generative tool AToM 3 . We use the Finite State Machines modelling language as a concise running example. Our approach leverages a correct by construction philosophy that renders subsequent simulation of models considerably less error-prone.

show abstract

“…If after adding these additional invariants a valid instantiation still exists (i.e. the model is still strongly satisfiable [22]) we may conclude that the property is satisfied by the rule. To check properties involving post-conditions of operations, two valid instantiations (one representing the initial state and the other the final one) must be computed.…”

Section: Tool Supportmentioning

confidence: 99%