Semantics of Message Sequence Charts

Letichevsky, Alexander A.; Kapitonova, J. V.; Kotlyarov, Vsevolod; Volkov, V. A.; Weigert, Thomas

doi:10.1007/11506843_8

Cited by 11 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…В [3] наведений алгоритм оптимізації структур даних Cobol за ознаками схожості для мінімізації згенерованих Java класів. Для генерації тестів часто використовують моделі, описані в окремих мовах моделювання, що потребує ручної роботи [4][5][6][7].…”

Section: вступunclassified

Generation of multipurpose formal models from legacy code

Potiyenko

Kolchin

2022

View full text Add to dashboard Cite

In this paper a method for generation of formal models from legacy systems code is proposed. The purpose of these models is to have a possibility of their application in different tasks such as automatic generation of executable tests, translation to modern programming languages, reverse engineering. The method pursues goals to decrease complexity of state space search and checking formulas satisfiability in relation to the direct code modeling, and to help legacy systems understanding and implementing in modern technologies. We focused on formalization of Cobol memory model as it is the most common language in legacy systems. Formal model is an attribute transition system with control flow. We proposed an algorithm for building enumerated types for any variables whose usage fulfills certain conditions, including translation procedure of numeric variables to enumerated ones. We considered a problem of translating non-comparable structures which overlap in memory (operator redefines in Cobol), are copied or compared with each other. In opposite to common approach of using union semantics (like union construction in C++), we described a method of structure fields decomposition which has no drawbacks of unions and makes for minimization of bytewise approach. We considered the developed method on the examples of structures as with simple fields as with arrays. We also gave examples of realization of bytewise approach in Java and C++ languages for those variables that cannot be represented as enumerated or numeric attributes. We tried this work for tests generation for middle-sized projects (up to 100 000 lines of code) where it showed efficiency of developed method, also generated formal models were used for debugging of Cobol to Java translator and business rules extraction.

show abstract

Section: вступunclassified

Generation of multipurpose formal models from legacy code

Potiyenko

Kolchin

2022

View full text Add to dashboard Cite

show abstract

“…In contrast to a precondition, a postcondition can contain assignment operators in addition to logical formulas. A process Ð is represented in terms of MSC diagrams [11][12][13][14] and describes a scenario of the behavior of the specified environment with agents inserted into it. The scenario can be activated when the corresponding precondition is satisfied.…”

Section: Attribute Expressionsmentioning

confidence: 99%

Properties of a predicate transformer of the VRS system

et al. 2010

Self Cite

View full text Add to dashboard Cite

Models specified in the language of basic protocols are considered. These models are attribute transition systems, and their states are defined by formulas of multisort first-order predicate calculus over system attributes. Attributes of simple numeric and symbolic types, functional types, and queues are allowed. Assignment operators, queue update operators, and arbitrary formulas are used in postconditions of basic protocols. To pass from one state to another, a predicate transformer is constructed as a function of formula transformation. The following main property of the predicate transformer is proved: it calculates the strongest postcondition for symbolic states.

show abstract

“…al. define the semantics of MSC based on the theory of interaction of agents and environments [1]. MSCs, compared with UML 2 Sequence Diagrams, are less expressive in that they support only synchronous messages without conditions and a small set of compositions, not including interleaving and critical region, .…”

Section: Related Workmentioning

confidence: 99%

Formalize UML 2 Sequence Diagrams

Shen

Virani

Niu

2008

2008 11th IEEE High Assurance Systems Engineering Symposium

View full text Add to dashboard Cite

Abstract-UML 1 sequence diagrams have been widely employed for modeling software requirements and design. UML 2 introduced many new features, such as Combined Fragments, to make sequence diagrams more expressive than UML 1. However, the lack of formal semantics descriptions of these features makes it difficult for practitioners and tool builders to construct and analyze sequence diagrams that specify high assurance systems. In previous work, we presented a formalism, template semantics, for describing the operational semantics of behavioral notations. In this paper, we adapt template semantics to describe the combined fragments and other constructs of sequence diagrams. We believe that formalizing the semantics of sequence diagrams is an important step towards synthesizing multiple sequence diagrams into behavioral models (i.e., state machines) and formally analyzing them.

show abstract

Semantics of Message Sequence Charts

Cited by 11 publications

References 4 publications

Generation of multipurpose formal models from legacy code

Generation of multipurpose formal models from legacy code

Properties of a predicate transformer of the VRS system

Formalize UML 2 Sequence Diagrams

Contact Info

Product

Resources

About