Integrating UML Static and Dynamic Views and Formalizing the Interaction Mechanism of UML State Machines

Cavarra, Alessandra; Riccobene, Elvinia; Scandurra, Patrizia

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

Cited by 8 publications

(8 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The ASM ground model and refinement concepts replace the loose character of human-centric UML models and of the links the UML framework offers between descriptions at different system design levels. Starting from the accurate ASM-based semantical definition of the various UML diagrams and related notations (see [32,33,50,51]), this equips UML-based practice with the degree of mathematical precision that distinguishes a scientifically rooted engineering discipline worth its name.…”

Section: Integrating Special Purpose Methodsmentioning

confidence: 99%

The Abstract State Machines Method for High-Level System Design and Analysis

Börger¹

2009

Formal Methods: State of the Art and New Directions

282

518

View full text Add to dashboard Cite

Section: Integrating Special Purpose Methodsmentioning

confidence: 99%

The Abstract State Machines Method for High-Level System Design and Analysis

Börger¹

2009

Formal Methods: State of the Art and New Directions

282

518

View full text Add to dashboard Cite

“…According to Kong et al (2009), "The intuitive nature of UML notations greatly facilitates distribution and communication of software artifacts among different developers." Although UML provides many notations, it is sufficient to use class diagrams and state diagrams (Cavarra et al, 2003 Cavarra et al (2003), one weakness of UML is the lack of a well-defined model design process that integrates the different kinds of diagrams; it is "a bunch of notations without an effective integration." Furthermore, "This leads to a more apparent than real understanding of models, difficulty to perform rigorous analysis, validation, verification, integrity of models and difficulty to develop tools supporting mechanical validation and verification" (Cavarra et al, 2003).…”

Section: Applying the Tm Model To A Case Study: Tendering Systemmentioning

confidence: 99%

Thinging-Based Conceptual Modeling: Case Study of a Tendering System

Al-Fedaghi¹,

Haidar²

2020

Journal of Computer Science

View full text Add to dashboard Cite

In computer science, models are made explicit to provide formality and a precise understanding of small, contingent "universes" (e.g., an organization), as constructed from stakeholder requirements. Conceptual modeling is a fundamental discipline in this context whose main concerns are identifying, analyzing and describing the critical concepts of a universe of discourse. In the information systems field, one of the reasons why projects fail is an inability to capture requirements in a way that can be technically used to configure a system. This problem of requirements specification is considered to have "deficiencies in theory". We apply a recently developed model called the Thinging Machine (TM) model which uniformly integrates static and dynamic modeling features to this problem of requirements specification. The object-Oriented (OO) approach to modeling, as applied in Unified Modeling Language, is by far the most applied and accepted standard in software engineering; nevertheless, new notions in the field may enhance and facilitate a supplementary understanding of the OO model itself. We aim to contribute to the field of conceptual modeling by introducing the TM model's philosophical foundation of requirements analysis. The TM model has only five generic processes of things (e.g., objects), in which genericity indicates generality, as in the generic Aristotelian concepts based on abstraction. We show the TM model's viability by applying it to a real business system.

show abstract

“…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

Integrating UML Static and Dynamic Views and Formalizing the Interaction Mechanism of UML State Machines

Cited by 8 publications

References 3 publications

The Abstract State Machines Method for High-Level System Design and Analysis

The Abstract State Machines Method for High-Level System Design and Analysis

Thinging-Based Conceptual Modeling: Case Study of a Tendering System

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

Contact Info

Product

Resources

About