Tool Support for OCL and Related Formalisms – Needs and Trends

Baar, Thomas; Chiorean, Dan; Correa, Alexandre; Gogolla, Martin; Hußmann, Heinrich; Patrascoiu, Octavian; Schmitt, Peter H.; Warmer, Jos

doi:10.1007/11663430_1

Cited by 14 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the minimality assumption it follows that w can be decomposed into w 1 ∈ PreL O x (t 1 ) and w 2 ∈ PreL C y (t 2 ) C . If w 1 is reduced, then the implication follows from part (1) and lemma 4.1, part (6). In the other case it follows from the inductive assumption; i.e., there is a one-step unwinding u 2 of t 2 such that w 2 ∈ PreL C y (u 2 ), where w = w 1 w 2 .…”

Section: Lemma 42 (Reduction Lemma)mentioning

confidence: 95%

“…If it is applied to the rightmost position, then there is a word v 1 ∈ PreL C yi (F) C such that w = vv 1 . From lemma 4.1, part (6) and from the definition of operation C it follows that vv 1 ∈ PreL C x (F(t 1 /y 1 , ..., t n /y n )) C . Let t have the form t 1 ->collect(y | t 2 ) and let w ∈ PreL C x (t) C .…”

Section: Lemma 42 (Reduction Lemma)mentioning

confidence: 96%

“…In the other case it follows from the inductive assumption; i.e., there is a one-step unwinding u 2 of t 2 such that w 2 ∈ PreL C y (u 2 ), where w = w 1 w 2 . Consequently, w 1 w 2 ∈ PreL C x (t 1 ->collect(y | u 2 )) C due to lemma 4.1, part (6) and to the definition of the closed pre-language, part (5). Now we prove the inverse implication.…”

Section: Lemma 42 (Reduction Lemma)mentioning

confidence: 97%

See 2 more Smart Citations

On the Validation of Invariants at Runtime

Kosiuczenko¹

2013

Fundamenta Informaticae

View full text Add to dashboard Cite

The paradigm of contractual specification provides a transparent way of specifying objectoriented systems. In this paradigm, system consistency is specified using so-called invariants. Runtime validation of invariants is a complex problem. Existing validation methods require either exhausting validation of an invariant for all objects of the corresponding class or the use of restrictive type systems. In this paper a non-exhaustive method of invariant validation is proposed. It is proved that the method is sound and an implementation of this method is discussed. It is shown also how to extract context free languages corresponding to OCL-invariants. P. Kosiuczenko / On the Validation of Invariants at Runtime P. Kosiuczenko / On the Validation of Invariants at Runtime 185 which an invariant is evaluated can be treated as a root of such a network. If an invariant is violated by a method execution, then the corresponding network of objects is modified. We use extracted languages to navigate backwards from the modified places to the roots of invariants' networks.Since OCL is a very extensive language, we restrict our consideration to some core primitives and we prove our results for the restricted form of this language. Nevertheless, our results can be applied to a wide variety of invariants. Such invariants can include multiple variables, object-as well as class attributes, the allInstances feature and also recursively defined functions. The presented method allows us to identify invariants which have to be evaluated before and after method execution, and to identify objects for which the evaluation should be performed. It should be noted that our method does not depend on a particular definition of visible system states and therefore can be used with different definitions. The interesting thing is that we do not have to refer to all objects existing in the pre-state, but only to the roots of modified networks. Those roots can be defined by OCL-terms. We briefly discuss the issue of implementation, though it goes beyond the scope of this paper.This paper is organized as follows. The next section includes a short discussion of related work. In section 3, we discuss the problem of invariant validation, sketch our solution ideas and present two examples. In section 4, we show how to extract context free languages from OCL-terms and investigate the relation between such languages and OCL-terms. We also prove that terms formalizing words are well typed. In section 5, we prove that the problem of invariant validity can be reduced to the problem of preservation of object networks determined by languages corresponding to invariants; we show also how to express such languages using OCL-terms. In section 6, we show how the developed methods can be applied to the examples introduced in section 3. In section 7, we briefly discuss the issue of implementation. Section 8 concludes this paper.

show abstract

Section: Lemma 42 (Reduction Lemma)mentioning

confidence: 95%

Section: Lemma 42 (Reduction Lemma)mentioning

confidence: 96%

Section: Lemma 42 (Reduction Lemma)mentioning

confidence: 97%

See 1 more Smart Citation

On the Validation of Invariants at Runtime

Kosiuczenko¹

2013

Fundamenta Informaticae

View full text Add to dashboard Cite

show abstract

“…Most of the current OCL tools are academic tools and were developed by a team of a single university [2]. Although the quality of tools has improved considerably over the last years, it is not a surprise that these OCL tools cannot compete in terms of usability and the functionality they offer with IDE's for writing implementations.…”

Section: Uml Profile: Visu@lgridmentioning

confidence: 98%

Approach of a UML profile for Berkeley Open Infrastructure for network computing (BOINC)

Ries

Schröder

Grout

2011

2011 IEEE International Conference on Computer Applications and Industrial Electronics (ICCAIE)

View full text Add to dashboard Cite

Despite the current enormous hype and popularity of Grid Computing environments like Amazons EC2 or Microsoft's Windows Azure , there exist open-source and free of cost software frameworks which allow to create high performance computing installation by means of Public Resource Computing (PRC). One PRC framework is BOINC (Berkeley Open Infrastructure for Network Computing) for solving large scale and complex computational problems. Each computer works on its own workunits independently from each other and sends back its result to a project server. Installing, configuring, and maintaining a BOINC based project however is a highly sophisticated task. Scientists and developers need a lot of experience regarding the underlying communication and operating system technologies, even if only a handful of BOINC related functions are actually needed for most applications. In this paper we present a Unified Modeling Language (UML) profile for BOINC called Visu@lGrid profile (VGP). A BOINC project installation for one or more hosts, a role-based access control, and modeling of scientific application is feasible by use of VGP. Based on our approachwe provide a specification that allows the creation of BOINC projects with less development and implementation effort.

show abstract

“…It is associated with the Unified Modeling Language (UML) [42,45] and supported by a variety of tools, e.g. [17,23] (see [5] for a tool overview). Specification of invariable system parts is a common problem in case of complex systems.…”

Section: Introductionmentioning

confidence: 99%

Specification of invariability in OCL

Kosiuczenko¹

2011

Softw Syst Model

View full text Add to dashboard Cite

The Object Constraint Language (OCL) is a highlevel, object-oriented language for contractual system specifications. Despite its expressivity, OCL does not provide primitives for a compact specification of invariability. In this paper, problems with invariability specification are listed and some weaknesses of existing solutions are pointed out. The question of invariability specification is addressed and a simple but expressive extension of OCL is proposed. It allows a view-oriented specification of invariability constraints, whereby we restrict the notion of view to reducts based on ordersorted algebras. The semantics of this extension is defined in terms of standard OCL.

show abstract

Tool Support for OCL and Related Formalisms – Needs and Trends

Cited by 14 publications

References 3 publications

On the Validation of Invariants at Runtime

On the Validation of Invariants at Runtime

Approach of a UML profile for Berkeley Open Infrastructure for network computing (BOINC)

Specification of invariability in OCL

Contact Info

Product

Resources

About