mdh.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (9 of 9) Show all publications
Tahvili, S., Hatvani, L., Felderer, M., Afzal, W. & Bohlin, M. (2019). Automated Functional Dependency Detection Between Test Cases Using Text Semantic Similarity. In: 2019 IEEE International Conference On Artificial Intelligence Testing (AITest): . Paper presented at 2019 IEEE International Conference On Artificial Intelligence Testing (AITest), 4-9 April 2019, Newark, CA, USA (pp. 19-26). , Article ID 8718215.
Open this publication in new window or tab >>Automated Functional Dependency Detection Between Test Cases Using Text Semantic Similarity
Show others...
2019 (English)In: 2019 IEEE International Conference On Artificial Intelligence Testing (AITest), 2019, p. 19-26, article id 8718215Conference paper, Published paper (Other academic)
Abstract [en]

Knowing about dependencies and similarities between test cases is beneficial for prioritizing them for cost-effective test execution. This holds especially true for the time consuming, manual execution of integration test cases written in natural language. Test case dependencies are typically derived from requirements and design artifacts. However, such artifacts are not always available, and the derivation process can be very time-consuming. In this paper, we propose, apply and evaluate a novel approach that derives test cases' similarities and functional dependencies directly from the test specification documents written in natural language, without requiring any other data source. Our approach uses an implementation of Doc2Vec algorithm to detect text-semantic similarities between test cases and then groups them using two clustering algorithms HDBSCAN and FCM. The correlation between test case text-semantic similarities and their functional dependencies is evaluated in the context of an on-board train control system from Bombardier Transportation AB in Sweden. For this system, the dependencies between the test cases were previously derived and are compared to the results our approach. The results show that of the two evaluated clustering algorithms, HDBSCAN has better performance than FCM or a dummy classifier. The classification methods' results are of reasonable quality and especially useful from an industrial point of view. Finally, performing a random undersampling approach to correct the imbalanced data distribution results in an F1 Score of up to 75% when applying the HDBSCAN clustering algorithm.

National Category
Embedded Systems
Identifiers
urn:nbn:se:mdh:diva-41272 (URN)10.1109/AITest.2019.00-13 (DOI)000470916100004 ()2-s2.0-85067096441 (Scopus ID)9781728104928 (ISBN)
Conference
2019 IEEE International Conference On Artificial Intelligence Testing (AITest), 4-9 April 2019, Newark, CA, USA
Available from: 2018-11-01 Created: 2018-11-01 Last updated: 2019-06-27Bibliographically approved
Tahvili, S., Hatvani, L., Felderer, M., Afzal, W., Saadatmand, M. & Bohlin, M. (2018). Cluster-Based Test Scheduling Strategies Using Semantic Relationships between Test Specifications. In: 5th International Workshop on Requirements Engineering and Testing RET'18: . Paper presented at 5th International Workshop on Requirements Engineering and Testing RET'18, 02 Jun 2018, Gothenburg, Sweden (pp. 1-4). , F137811
Open this publication in new window or tab >>Cluster-Based Test Scheduling Strategies Using Semantic Relationships between Test Specifications
Show others...
2018 (English)In: 5th International Workshop on Requirements Engineering and Testing RET'18, 2018, Vol. F137811, p. 1-4Conference paper, Published paper (Refereed)
Abstract [en]

One of the challenging issues in improving the test efficiency is that of achieving a balance between testing goals and testing resources. Test execution scheduling is one way of saving time and budget, where a set of test cases are grouped and tested at the same time. To have an optimal test execution schedule, all related information of a test case (e.g. execution time, functionality to be tested, dependency and similarity with other test cases) need to be analyzed. Test scheduling problem becomes more complicated at high-level testing, such as integration testing and especially in manual testing procedure. Test specifications at high-level are generally written in natural text by humans and usually contain ambiguity and uncertainty. Therefore, analyzing a test specification demands a strong learning algorithm. In this position paper, we propose a natural language processing (NLP) based approach that, given test specifications at the integration level, allows automatic detection of test cases’ semantic dependencies. The proposed approach utilizes the Doc2Vec algorithm and converts each test case into a vector in n-dimensional space. These vectors are then grouped using the HDBSCAN clustering algorithm into semantic clusters. Finally, a set of cluster-based test scheduling strategies are proposed for execution. The proposed approach has been applied in a sub-system from the railway domain by analyzing an ongoing testing project at Bombardier Transportation AB, Sweden.

Keywords
Software testing, Test scheduling, NLP, Dependency, Clustering, Doc2Vec, Optimization, HDBSCAN
National Category
Computer Systems
Identifiers
urn:nbn:se:mdh:diva-38953 (URN)10.1145/3195538.3195540 (DOI)2-s2.0-85051238162 (Scopus ID)9781450357494 (ISBN)
Conference
5th International Workshop on Requirements Engineering and Testing RET'18, 02 Jun 2018, Gothenburg, Sweden
Projects
ITS-EASY Post Graduate School for Embedded Software and SystemsTOCSYC - Testing of Critical System Characteristics (KKS)MegaMaRt2 - Megamodelling at Runtime (ECSEL/Vinnova)TESTOMAT Project - The Next Level of Test Automation
Available from: 2018-05-15 Created: 2018-05-15 Last updated: 2018-08-23Bibliographically approved
Hatvani, L., Afshar, S. Z. & J. Bril, R. (2018). Optimal Priority and Threshold Assignment for Fixed-priority Preemption Threshold Scheduling. Paper presented at 7th Embedded Operating Systems Workshop EWiLi'17, 06 Oct 2017, Seoul, South Korea. ACM SIGBED Review (1), 43-49
Open this publication in new window or tab >>Optimal Priority and Threshold Assignment for Fixed-priority Preemption Threshold Scheduling
2018 (English)In: ACM SIGBED Review, E-ISSN 1551-3688, no 1, p. 43-49Article in journal (Refereed) Published
Abstract [en]

Fixed-priority preemption-threshold scheduling (FPTS) is a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). Since FPPS and FPNS are incomparable in terms of potential schedulability, FPTS has the advantage that it can schedule any task set schedulable by FPPS or FPNS and some that are not schedulable by either. FPTS is based on the idea that each task is assigned a priority and a preemption threshold. While tasks are admitted into the system according to their priorities, they can only be preempted by tasks that have priority higher than the preemption threshold.

This paper presents a new optimal priority and preemption threshold assignment (OPTA) algorithm for FPTS which in general outperforms the existing algorithms in terms of the size of the explored state-space and the total number of worst case response time calculations performed. The algorithm is based on back-tracking, i.e. it traverses the space of potential priorities and preemption thresholds, while pruning infeasible paths, and returns the first assignment deemed schedulable.

We present the evaluation results where we compare the complexity of the new algorithm with the existing one. We show that the new algorithm significantly reduces the time needed to find a solution. Through a comparative evaluation, we show the improvements that can be achieved in terms of schedulability ratio by our OPTA compared to a deadline monotonic priority assignment.

National Category
Computer Systems
Identifiers
urn:nbn:se:mdh:diva-37058 (URN)2-s2.0-84992364765 (Scopus ID)
Conference
7th Embedded Operating Systems Workshop EWiLi'17, 06 Oct 2017, Seoul, South Korea
Projects
PRESS - Predictable Embedded Software Systems
Available from: 2017-11-07 Created: 2017-11-07 Last updated: 2019-01-28Bibliographically approved
Hatvani, L., David, A., Seceleanu, C. & Pettersson, P. (2014). Adaptive Task Automata with Earliest-Deadline-First Scheduling. Sweden
Open this publication in new window or tab >>Adaptive Task Automata with Earliest-Deadline-First Scheduling
2014 (English)Report (Other (popular science, discussion, etc.))
Abstract [en]

Adjusting to resource changes, dynamic environmental conditions, or new usage modes are some of the reasons why real-time embedded systems need to be adaptive. This requires a rigorous framework for designing such systems, to ensure that the adaptivity does not result in invalidating the system's real-time constraints.

To address this need, we have recently introduced adaptive task automata, a framework for modeling, verification, and schedulability analysis in adaptive, hard real-time embedded systems, assuming a fixed-priority scheduler.

In this work, we extend the adaptive task automata framework to incorporate the earliest-deadline-first scheduling policy, as well as enable implementation of any other dynamic scheduling policy. To prove the decidability of our model, and at the same time maintain a manageable degree of conciseness, we show an encoding of our model as a network of timed automata with clock updates. To support this, we also show that reachability in our class of timed automata with updates is decidable. Our contribution helps to streamline the process of designing safety critical adaptive embedded systems.

Place, publisher, year, edition, pages
Sweden: , 2014. p. 18
Series
MRTC Reports, ISSN 1404-3041
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-25965 (URN)MDH-MRTC-287/2014-1-SE (ISRN)
Projects
ARROWS - Design Techniques for Adaptive Embedded Systems
Available from: 2014-09-17 Created: 2014-09-17 Last updated: 2014-11-11Bibliographically approved
Hatvani, L., David, A., Seceleanu, C. & Pettersson, P. (2014). Adaptive Task Automata with Earliest-Deadline-First Scheduling. Paper presented at 14th International Workshop on Automated Verification of Critical Systems (AVoCS 2014), Enschede, Netherlands, September 24-26, 2014.. Electronic Communications of the EASST, 70
Open this publication in new window or tab >>Adaptive Task Automata with Earliest-Deadline-First Scheduling
2014 (English)In: Electronic Communications of the EASST, ISSN 1863-2122, E-ISSN 1863-2122, Vol. 70Article in journal (Refereed) Published
Abstract [en]

Adjusting to resource changes, dynamic environmental conditions, or new usage modes are some of the reasons why real-time embedded systems need to be adaptive. This requires a rigorous framework for designing such systems, to ensure that the adaptivity does not result in invalidating the system's real-time constraints.

To address this need, we have recently introduced adaptive task automata, a framework for modeling, verification, and schedulability analysis in adaptive, hard real-time embedded systems, assuming a fixed-priority scheduler.

In this work, we extend the adaptive task automata framework to incorporate the earliest-deadline-first scheduling policy, as well as enable implementation of any other dynamic scheduling policy. To prove the decidability of our model, and at the same time maintain a manageable degree of conciseness, we show an encoding of our model as a network of timed automata with clock updates. To support this, we also show that reachability in our class of timed automata with updates is decidable. Our contribution helps to streamline the process of designing safety critical adaptive embedded systems.

National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-26126 (URN)10.14279/tuj.eceasst.70.975 (DOI)2-s2.0-85042925051 (Scopus ID)
Conference
14th International Workshop on Automated Verification of Critical Systems (AVoCS 2014), Enschede, Netherlands, September 24-26, 2014.
Projects
ARROWS - Design Techniques for Adaptive Embedded Systems
Available from: 2014-10-20 Created: 2014-10-20 Last updated: 2018-03-15Bibliographically approved
Hatvani, L. (2014). Formal Verification of Adaptive Real-Time Systems by Extending Task Automata. (Licentiate dissertation). Västerås: Mälardalen University
Open this publication in new window or tab >>Formal Verification of Adaptive Real-Time Systems by Extending Task Automata
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Recently, we have seen an increase in the deployment of safety critical embedded systems in rapidly changing environments, as well as requirement for on-site customizations and rapid adaptation. To address the extended range of requirements, adaptation mechanism are added to the systems to handle large number of situations appropriately. Although necessary, adaptations can cause inconsistent and unstable configurations that must be prevented for the embedded system to remain dependable and safe. Therefore, verifying the behavior of adaptive embedded systems during the design phase of the production process is highly desirable.

A hard real time embedded system and its environment can be modeled using timed automata. Such model can describe the system at various levels of abstraction. In this thesis, we model the adaptive responses of a system in terms of tasks that are executed to handle changes in the environmental or internal parameters.

Schedulability, a property that all tasks complete execution within their respective deadlines, is a key element in designing hard real-time embedded systems. A system that is unschedulable immediately compromises safety and hard real-time requirements and can cause fatal failure. Given specifications of all tasks in the system, we can model the system, an abstraction of the environment, and adaptive strategies to investigate whether the system retains safety properties, including schedulability, regardless of the changes in the environment and adaptations to those changes.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2014
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 185
Keywords
formal verification, embedded systems, timed automata, scheduling
National Category
Embedded Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-26129 (URN)978-91-7485-172-4 (ISBN)
Presentation
2014-11-28, Kappa, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2014-10-23 Created: 2014-10-20 Last updated: 2014-11-20Bibliographically approved
Hatvani, L., Seceleanu, C. & Pettersson, P. (2013). Modeling and Analysis of Adaptive Embedded Systems using Adaptive Task Automata. SIGBED Rev., 10(1), 43-47
Open this publication in new window or tab >>Modeling and Analysis of Adaptive Embedded Systems using Adaptive Task Automata
2013 (English)In: SIGBED Rev., ISSN 1551-3688, Vol. 10, no 1, p. 43-47Article in journal (Refereed) Published
Abstract [en]

Most embedded systems need to continually function in unpredictable environments. One way to achieve high dependability is to make the system adaptive to changes, if possible, without sacrificing maintainability. To be able to reason about adaptivity, one needs a modeling and analysis framework suitable for adaptive systems. Recently, we have introduced Adaptive Task Automata, to meet this goal. In this paper, we overview the current functionality implemented in the Adaptive Task Automata framework (ATA), as well as some of the challenges encountered during the development. In the end, we enumerate possible future extensions of ATA.

Place, publisher, year, edition, pages
New York, NY, USA: Association for Computing Machinery (ACM), 2013
Keywords
adaptive embedded systems, adaptive task automata, schedulability verification, task automata
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:mdh:diva-25871 (URN)10.1145/2492385.2492393 (DOI)
Projects
ARROWS - Design Techniques for Adaptive Embedded Systems
Available from: 2014-09-05 Created: 2014-09-05 Last updated: 2015-02-06Bibliographically approved
Hatvani, L., Pettersson, P. & Seceleanu, C. (2012). Adaptive task automata: A framework for verifying adaptive embedded systems. In: Lecture Notes in Computer Science, vol. 7212: (pp. 115-129). Springer
Open this publication in new window or tab >>Adaptive task automata: A framework for verifying adaptive embedded systems
2012 (English)In: Lecture Notes in Computer Science, vol. 7212, Springer, 2012, p. 115-129Chapter in book (Refereed)
Abstract [en]

We present a framework for modeling and analysis of adaptive embedded systems, based on the model of timed automata with tasks. The model is extended with primitives allowing modeling of adaptivity, by testing the potential schedulability of a given task, in the context of the set of currently enqueued tasks. This makes it possible to describe adaptive embedded systems, in which decisions to admit further tasks or take other measures of adaptivity is based on available CPU resources, external, or internal events. We show that this model can be encoded in the framework of timed automata, and hence that the problem is decidable. We also validate the framework, by using the Uppaal tool.

Place, publisher, year, edition, pages
Springer, 2012
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7212
National Category
Engineering and Technology
Identifiers
urn:nbn:se:mdh:diva-17227 (URN)10.1007/978-3-642-28872-2_9 (DOI)000343044000009 ()2-s2.0-84859124356 (Scopus ID)9783642288715 (ISBN)
Note

15th International Conference on Fundamental Approaches to Software Engineering, FASE 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012; Tallinn; 24 March 2012 through 1 April 2012

Available from: 2012-12-20 Created: 2012-12-20 Last updated: 2018-08-08Bibliographically approved
Hatvani, L., Jansen, A., Seceleanu, C. & Pettersson, P. (2010). An integrated tool for trade-off analysis of quality-of-service attributes. In: Proceedings of The 2nd International Workshop on the Quality of Service-Oriented Software Systems. Paper presented at 2nd International Workshop on the Quality of Service-Oriented Software Systems, QUASOSS '10;Oslo;4 October 2010through4 October 2010 (pp. Art no. 2). New York: ACM
Open this publication in new window or tab >>An integrated tool for trade-off analysis of quality-of-service attributes
2010 (English)In: Proceedings of The 2nd International Workshop on the Quality of Service-Oriented Software Systems, New York: ACM , 2010, p. Art no. 2-Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we present a tool for performing trade-off analysis of Quality-of-Service attributes of design solutions resulted from architectural, behavioral, or deployment changes in service-oriented systems. The tool allows for comparing the performance, reliability, and maintainability of such solutions, in an attempt to compute the optimal one with respect to the weighted sum of the considered quality attributes. Our tool uses the Analytic Hierarchy Process for computing trade-offs, and is integrated into the Quality Impact Prediction for Evolving Service-Oriented Software IDE.

Place, publisher, year, edition, pages
New York: ACM, 2010
National Category
Engineering and Technology
Identifiers
urn:nbn:se:mdh:diva-10867 (URN)10.1145/1858263.1858266 (DOI)2-s2.0-78650494581 (Scopus ID)978-1-4503-0239-5 (ISBN)
Conference
2nd International Workshop on the Quality of Service-Oriented Software Systems, QUASOSS '10;Oslo;4 October 2010through4 October 2010
Available from: 2010-11-10 Created: 2010-11-10 Last updated: 2013-12-03Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-0073-1674

Search in DiVA

Show all publications