Modelirovanie i Analiz Informatsionnykh Sistem
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Modelirovanie i Analiz Informatsionnykh Sistem, 2017, Volume 24, Number 6, Pages 691–703
DOI: https://doi.org/10.18255/1818-1015-2017-6-691-703
(Mi mais593)
 

Towards measuring the abstractness of state machines based on mutation testing

Thomas Baar

University of Applied Sciences (Hochschule für Technik und Wirtschaft (HTW) Berlin) Wilhelminenhofstrasse 75 A, D-12459, Berlin, Germany
References:
Abstract: The notation of state machines is widely adopted as a formalism to describe the behaviour of systems. Usually, multiple state machine models can be developed for the very same software system. Some of these models might turn out to be equivalent, but, in many cases, different state machines describing the same system also differ in their level of abstraction.
In this paper, we present an approach to actually measure the abstractness level of state machines w.r.t. a given implemented software system. A state machine is considered to be less abstract when it is conceptionally closer to the implemented system. In our approach, this distance between state machine and implementation is measured by applying coverage criteria known from software mutation testing.
Abstractness of state machines can be considered as a new metric. As for other metrics as well, a known value for the abstractness of a given state machine allows to assess its quality in terms of a simple number. In model-based software development projects, the abstract metric can help to prevent model degradation since it can actually measure the semantic distance from the behavioural specification of a system in form of a state machine to the current implementation of the system.
In contrast to other metrics for state machines, the abstractness cannot be statically computed based on the state machine's structure, but requires to execute both state machine and corresponding system implementation.
The article is published in the author’s wording.
Keywords: model-based software development, metric, state machine, mutation testing.
Received: 30.10.2017
Bibliographic databases:
Document Type: Article
UDC: 519.686.2
Language: English
Citation: Thomas Baar, “Towards measuring the abstractness of state machines based on mutation testing”, Model. Anal. Inform. Sist., 24:6 (2017), 691–703
Citation in format AMSBIB
\Bibitem{Baa17}
\by Thomas~Baar
\paper Towards measuring the abstractness of state machines based on mutation testing
\jour Model. Anal. Inform. Sist.
\yr 2017
\vol 24
\issue 6
\pages 691--703
\mathnet{http://mi.mathnet.ru/mais593}
\crossref{https://doi.org/10.18255/1818-1015-2017-6-691-703}
\elib{https://elibrary.ru/item.asp?id=30730609}
Linking options:
  • https://www.mathnet.ru/eng/mais593
  • https://www.mathnet.ru/eng/mais/v24/i6/p691
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Моделирование и анализ информационных систем
    Statistics & downloads:
    Abstract page:528
    Full-text PDF :96
    References:21
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024