Proving and Visualizing OCL Invariant Independence by Automatically Generated Test Cases

Gogolla, Martin; Hamann, Lars; Kuhlmann, Mirco

doi:10.1007/978-3-642-13977-2_5

Cited by 13 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we show a proposal that follows this latter approach, making use of some of the concepts, languages and tools that have proved to be very useful in the case of model specification and validation [16]. In particular, we generalize model transformation contracts [2,17] for the specification of the properties that need to be checked for a transformation, and then apply the ASSL language [18] to generate input test models, which are then automatically transformed into output models and checked against the set of contracts defined for the transformation, using the USE tool [19].…”

Section: Introductionmentioning

confidence: 99%

Formal Specification and Testing of Model Transformations

Vallecillo

Gogolla

Burgueño

et al. 2012

Formal Methods for Model-Driven Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we present some of the key issues involved in model transformation specification and testing, discuss and classify some of the existing approaches, and introduce the concept of Tract, a generalization of model transformation contracts. We show how Tracts can be used for model transformation specification and black-box testing, and the kinds of analyses they allow. Some representative examples are used to illustrate this approach.

show abstract

Section: Introductionmentioning

confidence: 99%

Formal Specification and Testing of Model Transformations

Vallecillo

Gogolla

Burgueño

et al. 2012

Formal Methods for Model-Driven Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…For instance, it should be possible to create an instance that satisfies all the constraints in the model simultaneously. Also, it is desirable to be aware of redundancies among constraints [21], [22], [23]. These correctness properties can be formally checked using bounded verification.…”

Section: Overviewmentioning

confidence: 99%

Smart Bound Selection for the Verification of UML/OCL Class Diagrams

Clarisó

González

Cabot

2019

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Correctness of UML class diagrams annotated with OCL constraints can be checked using bounded verification techniques, e.g., SAT or constraint programming (CP) solvers. Bounded verification detects faults efficiently but, on the other hand, the absence of faults does not guarantee a correct behavior outside the bounded domain. Hence, choosing suitable bounds is a non-trivial process as there is a trade-off between the verification time (faster for smaller domains) and the confidence in the result (better for larger domains). Unfortunately, bounded verification tools provide little support in the bound selection process. In this paper, we present a technique that can be used to (i) automatically infer verification bounds whenever possible, (ii) tighten a set of bounds proposed by the user and (iii) guide the user in the bound selection process. This approach may increase the usability of UML/OCL bounded verification tools and improve the efficiency of the verification process.

show abstract

“…Automated, more efficient support for this task (e.g., like the method proposed in [30]) is left for future work. Similarly, constraint redundancy can be (manually) investigated with solvers like USE [17], but automating this task is also left for future work. Once the constraint for package visibility is deleted from Employee, USE would return a model like the one in Figure 10(a), proving that there is no conflict, and provide the designer with an example of use of the designed annotation.…”

Section: Annotation Validationmentioning

confidence: 99%

Ann: A domain-specific language for the effective design and validation of Java annotations

Córdoba-Sánchez

Lara

2016

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

This paper describes a new modelling language for the effective design and validation of Java annotations. Since their inclusion in the 5th edition of Java, annotations have grown from a useful tool for the addition of meta-data to play a central role in many popular software projects. Usually they are not conceived in isolation, but in groups, with dependency and integrity constraints between them. However, the native support pro-vided by Java for expressing this design is very limited.To overcome its deficiencies and make explicit the rich conceptual model which lies behind a set of annotations, we propose a domain-specific modelling language. The pro-posal has been implemented as an Eclipse plug-in, including an editor and an integrated code generator that synthesises annotation processors. The environment also integrates a model finder, able to detect unsatisfiable constraints between different annotations, and to provide examples of correct annotation usages for validation. The language has been tested using a real set of annotations from the Java Persistence AP! OPA). Within this subset we have found enough rich semantics expressible with Ann and omitted nowadays by the Java language, which shows the benefits of Ann in a relevant field of application.

show abstract

Proving and Visualizing OCL Invariant Independence by Automatically Generated Test Cases

Cited by 13 publications

References 14 publications

Formal Specification and Testing of Model Transformations

Formal Specification and Testing of Model Transformations

Smart Bound Selection for the Verification of UML/OCL Class Diagrams

Ann: A domain-specific language for the effective design and validation of Java annotations

Contact Info

Product

Resources

About