An ASM Semantics of UML Derived from the Meta-model and Incorporating Actions

Ober, Iulian

doi:10.1007/3-540-36498-6_21

Cited by 13 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [150] Sarstedt defined an ASM to interpret the considerably richer version 2.0 of (a token flow view [151] of) UML activity diagrams and implemented it by a runtime component which is part of an integrated software development environment where it executes (and visualizes) activity diagrams directly. Kohlmeyer [120] integrated into this work ASM models for other UML behavioral diagrams (see [33,142,116,117,61,143]) "by adding new ASM rules and by modifying appropriate parts of the established ASM specifications" [121, p.217], i.e. by two forms of ASM refinement.…”

Section: Asm Interpreters For Domain Specific Languagesmentioning

confidence: 99%

The abstract state machines method for modular design and analysis of programming languages

Börger¹

2014

Journal of Logic and Computation

View full text Add to dashboard Cite

We survey the use of Abstract State Machines in the area of programming languages, namely to define behavioral properties of programs at source, intermediate and machine levels in a way that is amenable to mathematical and experimental analysis by practitioners, like correctness and completeness of compilers, etc. We illustrate how theorems about such properties can be integrated into a modular development of programming languages and programs, using as example a Java/JVM compilation correctness theorem about defining, interpreting, compiling, and executing Java/JVM code. We show how programming features (read: programming constructs) modularize not only the source programs, but also the program property statements and their proofs. 1 1 This text originates from an invited lecture for the Workshop on Scalable Language Specification at Microsoft Research Cambridge, June 25-27, 2013. 2 Listening to lectures I had invited Yuri Gurevich to deliver in the years 1986, 1987 and 1991 to the computer science PhD program in Pisa. See [57, Ch.9] or [26] for historical details and references. 3 ASM refinement differs from other refinement concepts in the literature by allowing one to refine in combination both the data structures (which make up the ASM state) and the computation steps (which are described by the ASM rules). More precisely, to relate abstract and refined runs for stating and proving the desired run properties, one can determine five features: a) the targeted refined data structure, b) appropriate pairs of corresponding abstract and refined states of interest one wants to relate, c) segments of abstract and refined computation steps leading from one pair of corresponding states of interest to the next one, d) sets of abstract and refined locations of interest one wants to compare, e) the equivalence properties or whatever comparison one wants to establish, see [28,29] for details. Horizontal resp. vertical ASM refinement includes Java's "extends" resp. "implements". 4 The early work on specification and analysis of logic programming systems using ASMs, carried out in the period 1988-1994, is surveyed in the Proceedings of the first international ASM workshop which was organized as part of the 13th World Computer Congress, see [23].

show abstract

Section: Asm Interpreters For Domain Specific Languagesmentioning

confidence: 99%

The abstract state machines method for modular design and analysis of programming languages

Börger¹

2014

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…Note that these obstacles are raised by aiming at automatic formal verification, they naturally do not apply in general to proposals for formal semantics of UML, which in contrast use methods which intentionally do not require finite bounds and don't explicitly represent "not existing" objects, e.g [15,23,36,35]…”

mentioning

confidence: 99%

Live and Let Die: LSC-Based Verification of UML-Models

Damm

Westphal

2003

Formal Methods for Components and Objects

View full text Add to dashboard Cite

We present a strategy for automatic formal verification of Live Sequence Chart (LSC) specifications against UML models in the semantics of [7] employing the symmetry-based technique of Query Reduction [18, 34, 44] and the abstraction technique Data-type Reduction [34]. Altogether this allows for automatic formal verification without providing finite bounds on the numbers of objects created during a run of the system. Our presentation is grounded on a specific formal interpretation of LSCs for the UML domain in terms of [7] which is rich enough to in particular express properties about objects which are created only during activation of the LSC.

show abstract

“…One is to formalize UML diagrams on meta-model level [118]. The UML meta-model is a subset of class diagrams.…”

Section: Abstract State Machinesmentioning

confidence: 99%

A framework for transforming, analyzing, and realizing software designs in unified modeling language

Dong

View full text Add to dashboard Cite

Dong, Zhijiang, "A framework for transforming, analyzing, and realizing software designs in unified modeling language" (2006 and industrial production quality tool support. However, there is a lack of precise definition of the semantics of individual UML notations as well as the relationships among multiple UML models, which often introduces incomplete and inconsistent problems for software designs in UML, especially for complex systems. Furthermore, there is a lack of methodologies to ensure a correct implementation from a given UML design. The purpose of this investigation is to verify and validate software designs in UML, and to provide dependability assurance for the realization of a UML design.In my research, an approach is proposed to transform UML diagrams into a semantic domain, which is a formal component-based framework. The framework Iproposed consists of components and interactions through message passing, which are modeled by two-layer algebraic high-level nets and transformation rules respectively.In the transformation approach, class diagrams, state machine diagrams and activity vi

show abstract

An ASM Semantics of UML Derived from the Meta-model and Incorporating Actions

Cited by 13 publications

References 11 publications

The abstract state machines method for modular design and analysis of programming languages

The abstract state machines method for modular design and analysis of programming languages

Live and Let Die: LSC-Based Verification of UML-Models

A framework for transforming, analyzing, and realizing software designs in unified modeling language

Contact Info

Product

Resources

About