hh.sePublications
Change search
Link to record
Permanent link

Direct link
Mousavi, Mohammad RezaORCID iD iconorcid.org/0000-0002-4869-6794
Publications (10 of 116) Show all publications
Entekhabi, S., Mostowski, W. & Mousavi, M. R. (2023). Automated and Efficient Test-Generation for Grid-Based Multiagent Systems: Comparing Random Input Filtering versus Constraint Solving. ACM Transactions on Software Engineering and Methodology, 33(1), Article ID 12.
Open this publication in new window or tab >>Automated and Efficient Test-Generation for Grid-Based Multiagent Systems: Comparing Random Input Filtering versus Constraint Solving
2023 (English)In: ACM Transactions on Software Engineering and Methodology, ISSN 1049-331X, E-ISSN 1557-7392, Vol. 33, no 1, article id 12Article in journal (Refereed) Published
Abstract [en]

Automatic generation of random test inputs is an approach that can alleviate the challenges of manual test case design. However, random test cases may be ineffective in fault detection and increase testing cost, especially in systems where test execution is resource- and time-consuming. To remedy this, the domain knowledge of test engineers can be exploited to select potentially effective test cases. To this end, test selection constraints suggested by domain experts can be utilized either for filtering randomly generated test inputs or for direct generation of inputs using constraint solvers. In this article, we propose a domain specific language (DSL) for formalizing locality-based test selection constraints of autonomous agents and discuss the impact of test selection filters, specified in our DSL, on randomly generated test cases. We study and compare the performance of filtering and constraint solving approaches in generating selective test cases for different test scenario parameters and discuss the role of these parameters in test generation performance. Through our study, we provide criteria for suitability of the random data filtering approach versus the constraint solving one under the varying size and complexity of our testing problem. We formulate the corresponding research questions and answer them by designing and conducting experiments using QuickCheck for random test data generation with filtering and Z3 for constraint solving. Our observations and statistical analysis indicate that applying filters can significantly improve test efficiency of randomly generated test cases. Furthermore, we observe that test scenario parameters affect the performance of the filtering and constraint solving approaches differently. In particular, our results indicate that the two approaches have complementary strengths: random generation and filteringworks best for large agent numbers and long paths, while its performance degrades in the larger grid sizes and more strict constraints. On the contrary, constraint solving has a robust performance for large grid sizes and strict constraints, while its performance degrades with more agents and long paths. © 2023 Copyright held by the owner/author(s).

Place, publisher, year, edition, pages
New York, NY: Association for Computing Machinery (ACM), 2023
Keywords
autonomous agents, constraint solving, domain specific languages, grid-based systems, multiagent systems, test input filtering, Test input generation, test selection
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-52732 (URN)10.1145/3624736 (DOI)2-s2.0-85183761518 (Scopus ID)
Available from: 2024-02-21 Created: 2024-02-21 Last updated: 2024-02-21Bibliographically approved
Entekhabi, S., Mostowski, W., Mousavi, M. R. & Arts, T. (2022). Locality-Based Test Selection for Autonomous Agents. In: Clark D., Menendez H., Cavalli A.R. (Ed.), Testing Software and Systems: 33rd IFIP WG 6.1 International Conference on Testing Software Systems, ICTSS 2021, London, UK, November 10-12, 2021 Proceedings. Paper presented at 33rd IFIP WG 6.1 International Conference on Testing Software Systems, ICTSS 2021, 10 November 2021 through 12 November 2021, , 277709, 2022 (pp. 73-89). Springer Science+Business Media B.V., 13045
Open this publication in new window or tab >>Locality-Based Test Selection for Autonomous Agents
2022 (English)In: Testing Software and Systems: 33rd IFIP WG 6.1 International Conference on Testing Software Systems, ICTSS 2021, London, UK, November 10-12, 2021 Proceedings / [ed] Clark D., Menendez H., Cavalli A.R., Springer Science+Business Media B.V., 2022, Vol. 13045, p. 73-89Conference paper, Published paper (Refereed)
Abstract [en]

Automated random testing is useful in finding faulty corner cases that are difficult to find by using manually-defined fixed test suites. However, random test inputs can be inefficient in finding faults, particularly in systems where test execution is time- and resource-consuming. Hence, filtering out less-effective test cases by applying domain knowledge constraints can contribute to test effectiveness and efficiency. In this paper, we provide a domain specific language (DSL) for formalising locality-based test selection constraints for autonomous agents. We use this DSL for filtering randomly generated test inputs. To evaluate our approach, we use a simple case study of autonomous agents and evaluate our approach using the QuickCheck tool. The results of our experiments show that using domain knowledge and applying test selection filters significantly reduce the required number of potentially expensive test executions to discover still existing faults. We have also identified the need for applying filters earlier during the test data generation. This observation shows the need to make a more formal connection between the data generation and the DSL-based filtering, which will be addressed in future work. © 2022, IFIP International Federation for Information Processing.

Place, publisher, year, edition, pages
Springer Science+Business Media B.V., 2022
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 13045
Keywords
Autonomous agents, Domain specific languages, Model-based testing, Scenario-based testing, Test input generation, Test selection
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-49111 (URN)10.1007/978-3-031-04673-5_6 (DOI)000870696000006 ()2-s2.0-85130232932 (Scopus ID)9783031046728 (ISBN)
Conference
33rd IFIP WG 6.1 International Conference on Testing Software Systems, ICTSS 2021, 10 November 2021 through 12 November 2021, , 277709, 2022
Available from: 2023-01-05 Created: 2023-01-05 Last updated: 2023-10-05Bibliographically approved
Bin Ali, N., Engström, E., Taromirad, M., Mousavi, M. R., Minhas, N. M., Helgesson, D., . . . Varshosaz, M. (2019). On the search for industry-relevant regression testing research. Empirical Software Engineering, 24(4), 2020-2055
Open this publication in new window or tab >>On the search for industry-relevant regression testing research
Show others...
2019 (English)In: Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 24, no 4, p. 2020-2055Article in journal (Refereed) Published
Abstract [en]

Regression testing is a means to assure that a change in the software, or its execution environment, does not introduce new defects. It involves the expensive undertaking of rerunning test cases. Several techniques have been proposed to reduce the number of test cases to execute in regression testing, however, there is no research on how to assess industrial relevance and applicability of such techniques. We conducted a systematic literature review with the following two goals: firstly, to enable researchers to design and present regression testing research with a focus on industrial relevance and applicability and secondly, to facilitate the industrial adoption of such research by addressing the attributes of concern from the practitioners' perspective. Using a reference-based search approach, we identified 1068 papers on regression testing. We then reduced the scope to only include papers with explicit discussions about relevance and applicability (i.e. mainly studies involving industrial stakeholders). Uniquely in this literature review, practitioners were consulted at several steps to increase the likelihood of achieving our aim of identifying factors important for relevance and applicability. We have summarised the results of these consultations and an analysis of the literature in three taxonomies, which capture aspects of industrial-relevance regarding the regression testing techniques. Based on these taxonomies, we mapped 38 papers reporting the evaluation of 26 regression testing techniques in industrial settings. © The Author(s) 2019

Place, publisher, year, edition, pages
New York, NY: Springer, 2019
Keywords
Regression testing, Industrial relevance, Systematic literature review, Taxonomy, Recommendations
National Category
Software Engineering
Identifiers
urn:nbn:se:hh:diva-41451 (URN)10.1007/s10664-018-9670-1 (DOI)000477582700010 ()2-s2.0-85061506841 (Scopus ID)
Funder
ELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Research Council, 621-2014-5057Knowledge Foundation, 20140312
Note

Other funder: EASE, the Industrial Excellence Centre for Embedded Applications Software Engineering.

Available from: 2020-01-31 Created: 2020-01-31 Last updated: 2022-09-15Bibliographically approved
Varshosaz, M., Al-Hajjaji, M., Thüm, T., Runge, T., Mousavi, M. R. & Schaefer, I. (2018). A classification of product sampling for software product lines. In: Berger et al. (Ed.), SPLC '18 Proceedings of the 22nd International Systems and Software Product Line Conference - Volume 1: . Paper presented at 22nd International Systems and Software Product Line Conference, SPLC 2018, Gothenburg, Sweden, 10-14 September, 2018 (pp. 1-13). New York, NY: Association for Computing Machinery (ACM)
Open this publication in new window or tab >>A classification of product sampling for software product lines
Show others...
2018 (English)In: SPLC '18 Proceedings of the 22nd International Systems and Software Product Line Conference - Volume 1 / [ed] Berger et al., New York, NY: Association for Computing Machinery (ACM), 2018, p. 1-13Conference paper, Published paper (Refereed)
Abstract [en]

The analysis of software product lines is challenging due to the potentially large number of products, which grow exponentially in terms of the number of features. Product sampling is a technique used to avoid exhaustive testing, which is often infeasible. In this paper, we propose a classification for product sampling techniques and classify the existing literature accordingly. We distinguish the important characteristics of such approaches based on the information used for sampling, the kind of algorithm, and the achieved coverage criteria. Furthermore, we give an overview on existing tools and evaluations of product sampling techniques. We share our insights on the state-of-the-art of product sampling and discuss potential future work. © 2018 Association for Computing Machinery.

Place, publisher, year, edition, pages
New York, NY: Association for Computing Machinery (ACM), 2018
Series
ACM International Conference Proceeding Serie
Keywords
Domain models, Feature interaction, Sampling algorithms, Software product lines, Testing, Software design, Software testing, Coverage criteria, Domain model, Exhaustive testing, Feature interactions, Product samplings, Sampling algorithm, Software Product Line, State of the art, Importance sampling
National Category
Production Engineering, Human Work Science and Ergonomics
Identifiers
urn:nbn:se:hh:diva-38742 (URN)10.1145/3233027.3233035 (DOI)000697950100002 ()2-s2.0-85055486094 (Scopus ID)9781450363716 (ISBN)9781450364645 (ISBN)
Conference
22nd International Systems and Software Product Line Conference, SPLC 2018, Gothenburg, Sweden, 10-14 September, 2018
Note

Funding: partially supported by the European project ITEA 3 15010 REV aMP2 and by the German Research Foundation within the project IMoTEP (grant agreement LO 2198/2-1).

Available from: 2019-01-10 Created: 2019-01-10 Last updated: 2023-10-05Bibliographically approved
Varshosaz, M., Beohar, H. & Mousavi, M. R. (2018). Basic Behavioral Models For Software Product Lines: Revisited. Science of Computer Programming, 168, 171-185
Open this publication in new window or tab >>Basic Behavioral Models For Software Product Lines: Revisited
2018 (English)In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 168, p. 171-185Article in journal (Refereed) Published
Abstract [en]

In Beohar et al. (2016) [9], we established an expressiveness hierarchy and studied the notions of refinement and testing for three fundamental behavioral models for software product lines. These models were featured transition systems, product line labeled transition systems, and modal transition systems. It turns out that our definition of product line labeled transition systems is more restrictive than the one introduced by Gruler, Leucker, and Scheidemann. Adopting the original and more liberal notion changes the expressiveness results, as we demonstrate in this paper. Namely, we show that the original notion of product line labeled transition systems and featured transition systems are equally expressive. As an additional result, we show that there are featured transition systems for which the size of the corresponding product line labeled transition system, resulting from any sound encoding, is exponentially larger than the size of the original model. Furthermore, we show that each product line labeled transition system can be encoded into a featured transition system, such that the size of featured transition system is linear in terms of the size of the corresponding model. To summarize, featured transition systems are equally expressive as, but exponentially more succinct than, product line labeled transition systems. © 2018 Elsevier B.V.

Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2018
Keywords
Software product lines, Behavioral model, Featured transition systems, Calculus of communicating systems, Product line labeled transition systems
National Category
Embedded Systems
Identifiers
urn:nbn:se:hh:diva-33892 (URN)10.1016/j.scico.2018.09.001 (DOI)000450385200010 ()2-s2.0-85054040481 (Scopus ID)
Projects
AUTO-CAAS HoG
Funder
Knowledge Foundation, 20140312Swedish Research Council, 621-2014-5057ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2017-05-26 Created: 2017-05-26 Last updated: 2021-05-06Bibliographically approved
Aichernig, B. K., Mostowski, W., Mousavi, M. R., Tappler, M. & Taromirad, M. (2018). Model Learning and Model-Based Testing. In: Amel Bennaceur, Reiner Hähnle, Karl Meinke (Ed.), Amel Bennaceur, Reiner Hähnle, Karl Meinke (Ed.), Machine Learning for Dynamic Software Analysis: Potentials and Limits. Paper presented at Machine Learning for Dynamic Software Analysis: Potentials and Limits, International Dagstuhl Seminar 16172, Wadern, Germany, April 24-27, 2016 (pp. 74-100). Heidelberg: Springer
Open this publication in new window or tab >>Model Learning and Model-Based Testing
Show others...
2018 (English)In: Machine Learning for Dynamic Software Analysis: Potentials and Limits / [ed] Amel Bennaceur, Reiner Hähnle, Karl Meinke, Heidelberg: Springer, 2018, p. 74-100Conference paper, Published paper (Refereed)
Abstract [en]

We present a survey of the recent research efforts in integrating model learning with model-based testing. We distinguished two strands of work in this domain, namely test-based learning (also called test-based modeling) and learning-based testing. We classify the results in terms of their underlying models, their test purpose and techniques, and their target domains. © Springer International Publishing AG

Place, publisher, year, edition, pages
Heidelberg: Springer, 2018
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11026
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-38437 (URN)10.1007/978-3-319-96562-8_3 (DOI)000476941200003 ()2-s2.0-85051109384 (Scopus ID)978-3-319-96561-1 (ISBN)978-3-319-96562-8 (ISBN)
Conference
Machine Learning for Dynamic Software Analysis: Potentials and Limits, International Dagstuhl Seminar 16172, Wadern, Germany, April 24-27, 2016
Funder
Knowledge Foundation
Available from: 2018-11-28 Created: 2018-11-28 Last updated: 2021-05-19Bibliographically approved
Oliveira, B., Carvalho, G., Mousavi, M. R. & Sampaio, A. (2018). Simulation of hybrid systems from natural-language requirements. In: 2017 13th IEEE Conference on Automation Science and Engineering (CASE): . Paper presented at 13th IEEE Conference on Automation Science and Engineering, CASE 2017, 20-23 August, 2017 (pp. 1320-1325). Piscataway, NJ: IEEE Computer Society
Open this publication in new window or tab >>Simulation of hybrid systems from natural-language requirements
2018 (English)In: 2017 13th IEEE Conference on Automation Science and Engineering (CASE), Piscataway, NJ: IEEE Computer Society, 2018, p. 1320-1325Conference paper, Published paper (Refereed)
Abstract [en]

Cyber-physical systems are characterised by a massive and tight interaction between computer systems and physical components. Hybrid systems provide an abstraction for modelling cyber-physical systems by featuring the integration of discrete and continuous behavioural aspects. Simulation is an important tool for validating hybrid system models, which are often too complex to be treated using other validation and verification techniques. Motivated by the industrial need for such tools, we propose a strategy (h-NAT2TEST) for simulation of hybrid systems from natural-language requirements. Using the proposed approach, one writes the system specification using a controlled natural language, from which an informal semantics is automatically inferred based on the case grammar theory. Then, a formal representation is built considering a model of hybrid data-flow reactive systems (h-DFRS). Finally, in order to allow for rigorous simulation, an Acumen specification is derived from the h-DFRS model. Simulation is supported by the Acumen modelling environment. A DC-DC boost converter is used as a case study to illustrate the overall approach. © 2017 IEEE.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Computer Society, 2018
Series
IEEE International Conference on Automation Science and Engineering (CASE), E-ISSN 2161-8089
Keywords
Acumen, controlled natural language, data-flow reactive system, Hybrid systems, NAT2TEST, simulation, Cyber Physical System, Data flow analysis, Data transfer, DC-DC converters, Embedded systems, Natural language processing systems, Semantics, Specifications, Reactive system, Computer simulation languages
National Category
Embedded Systems
Identifiers
urn:nbn:se:hh:diva-38733 (URN)10.1109/COASE.2017.8256284 (DOI)000428014600218 ()2-s2.0-85044928177 (Scopus ID)978-1-5090-6781-7 (ISBN)978-1-5090-6780-0 (ISBN)978-1-5090-6782-4 (ISBN)
Conference
13th IEEE Conference on Automation Science and Engineering, CASE 2017, 20-23 August, 2017
Projects
Effective Model-Based Testing of Concurrent SystemsAUTO-CAAS HÖG
Funder
Swedish Research Council, 621-2014-5057Knowledge Foundation, 20140312ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funding: 

The work of Bruno Oliveira, Gustavo Carvalho and Augusto Sampaio was partially supported by the CIn-UFPE/Motorola cooperation project, as well as CNPq grants 303022/2012-4 and 132332/2015-9.

The work of Mohammad Reza Mousavi has been supported by (Vetenskapsrådet) award number: 621-2014-5057 (Effective Model-Based Testing of Concurrent Systems), by the Swedish Knowledge Foundation (Stiftelsen for Kunskaps- och Kompetensutveckling) in the context of the AUTO-CAAS HOG project (number: 20140312), and by the ELLIIT Strategic Research Environment.

Available from: 2019-01-08 Created: 2019-01-08 Last updated: 2019-01-08Bibliographically approved
Araujo, H., Carvalho, G., Sampaio, A., Mousavi, M. R. & Taromirad, M. (2017). A Process for Sound Conformance Testing of Cyber-Physical Systems. In: Randall Bilof (Ed.), 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW): . Paper presented at 10th IEEE International Conference on Software Testing, Verification and Validation (ICSTW), Tokyo, Japan, March 13-17, 2017 (pp. 46-50). Los Alamitos, CA: IEEE Computer Society, Article ID 7899032.
Open this publication in new window or tab >>A Process for Sound Conformance Testing of Cyber-Physical Systems
Show others...
2017 (English)In: 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) / [ed] Randall Bilof, Los Alamitos, CA: IEEE Computer Society, 2017, p. 46-50, article id 7899032Conference paper, Published paper (Refereed)
Abstract [en]

We present a process for sound conformance testing of cyber-physical systems, which involves functional but also non-functional aspects. The process starts with a hybrid model of cyber-physical systems in which the correct behavior of the system (at its interface level) is specified. Such a model captures both discrete behavior and evolution of continuous dynamics of the system in time. Since conformance testing inherently involves comparing continuous dynamics, the key parameters of the process are (1) the conformance bounds defining when two signals are sufficiently close to each other, and (2) the permitted error margin in the conformance analysis introduced by sampling of continuous signals. The final parameter of this process is (3) finding (and adjusting) the sampling rate of the dynamic behavior. In the specified process, we provide different alternatives for fixing the error margin of the conformance testing if the sampling rate is fixed, establishing the sampling rate if the error margin is fixed and finding conformance bounds once the sampling rate and the error margin are fixed. © 2017 IEEE.

Place, publisher, year, edition, pages
Los Alamitos, CA: IEEE Computer Society, 2017
Series
IEEE International Conference on Software Testing Verification and Validation Workshops, ISSN 2159-4848
Keywords
Conformance Testing, Cyber-Physical Systems, Hybrid Systems, Approximate Simulation, Conformance Bounds, Sampling Rate
National Category
Control Engineering
Identifiers
urn:nbn:se:hh:diva-35616 (URN)10.1109/ICSTW.2017.15 (DOI)000403392800009 ()2-s2.0-85018444759 (Scopus ID)978-1-5090-6676-6 (ISBN)978-1-5090-6677-3 (ISBN)
Conference
10th IEEE International Conference on Software Testing, Verification and Validation (ICSTW), Tokyo, Japan, March 13-17, 2017
Projects
AUTO-CAAS
Funder
Swedish Research Council, 621-2014-5057Knowledge Foundation, 20140312ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funding: The work of M. R. Mousavi has been partially supported by the Swedish Research Council (Vetenskapsrådet) award number: 621-2014-5057 (Effective Model-Based Testing of Concurrent Systems) and the Swedish Knowledge Foundation (Stiftelsen för Kunskaps- och Kompetensutveckling) in the context of the AUTO-CAAS HöG project (number: 20140312) and the Strategic Research Environment ELLIIT. The work of M. Taromirad has been partially supported by the Swedish Research Council (Vetenskapsrådet) award number: 621-2014-5057 (Effective Model-Based Testing of Concurrent Systems) and the Strategic Research Environment ELLIIT. The work of Hugo Araujo, Gustavo Carvalho and Augusto Sampaio was partially supported by the CIn-UFPE/Motorola cooperation project, as well as CNPq grants 303022/2012-4 and 132332/2015-9.

Available from: 2017-12-06 Created: 2017-12-06 Last updated: 2021-05-19Bibliographically approved
Mousavi, M. R. (2017). Combining Epistemic and Operational Aspects in Compositional Verification of Protocols. In: Alex Groce & Stefan Leue (Ed.), EPTCS 259: Proceedings 2nd International Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies. Uppsala, Sweden, 29th April 2017. Paper presented at 2nd International Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies, April 29, 2017, Uppsala, Sweden. Sydney: Open Publishing Association, 259(259)
Open this publication in new window or tab >>Combining Epistemic and Operational Aspects in Compositional Verification of Protocols
2017 (English)In: EPTCS 259: Proceedings 2nd International Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies. Uppsala, Sweden, 29th April 2017 / [ed] Alex Groce & Stefan Leue, Sydney: Open Publishing Association , 2017, Vol. 259, no 259Conference paper, Oral presentation with published abstract (Refereed)
Place, publisher, year, edition, pages
Sydney: Open Publishing Association, 2017
Series
Electronic Proceedings in Theoretical Computer Science, E-ISSN 2075-2180 ; 259
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-41578 (URN)10.4204/EPTCS.259 (DOI)000439358700007 ()
Conference
2nd International Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies, April 29, 2017, Uppsala, Sweden
Funder
Swedish Research Council, 621-2014-5057Knowledge Foundation, 20140312ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2020-02-05 Created: 2020-02-05 Last updated: 2020-02-05Bibliographically approved
Taromirad, M. & Mousavi, M. R. (2017). Gray-Box Conformance Testing for Symbolic Reactive State Machines. In: Mehdi Dastani & Marjan Sirjani (Ed.), Fundamentals of Software Engineering: 7th International Conference, FSEN 2017, Tehran, Iran, April 26–28, 2017, Revised Selected Papers. Paper presented at 7th International Conference, FSEN 2017, Tehran, Iran, April 26–28, 2017 (pp. 228-243). Heidelberg: Springer Berlin/Heidelberg
Open this publication in new window or tab >>Gray-Box Conformance Testing for Symbolic Reactive State Machines
2017 (English)In: Fundamentals of Software Engineering: 7th International Conference, FSEN 2017, Tehran, Iran, April 26–28, 2017, Revised Selected Papers / [ed] Mehdi Dastani & Marjan Sirjani, Heidelberg: Springer Berlin/Heidelberg, 2017, p. 228-243Conference paper, Published paper (Refereed)
Abstract [en]

Model-based testing (MBT) is typically a black-box testing technique. Therefore, generated test suites may leave some untested gaps in a given implementation under test (IUT). We propose an approach to use the structural and behavioural information exploited from the implementation domain to generate effective and efficient test suites. Our approach considers both specification models and implementation models, and generates an enriched test model which is used to automatically generate test suites. We show that the proposed approach is sound and exhaustive and cover both the specification and the implementation. We examine the applicability and the effectiveness of our approach by applying it to a well-known example from the railway domain. © 2017, IFIP International Federation for Information Processing.

Place, publisher, year, edition, pages
Heidelberg: Springer Berlin/Heidelberg, 2017
Series
Lecture Notes in Computer Science, ISSN 0302-9742 ; vol. 10522
Keywords
Model checking, Software engineering, Specifications, Testing, Conformance testing, Implementation models, Implementation under tests, Model based testing, Reactive state, Specification models, Test Modeling, Black-box testing
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-36432 (URN)10.1007/978-3-319-68972-2_15 (DOI)000452447400015 ()2-s2.0-85032873770 (Scopus ID)978-3-319-68971-5 (ISBN)978-3-319-68972-2 (ISBN)
Conference
7th International Conference, FSEN 2017, Tehran, Iran, April 26–28, 2017
Available from: 2018-03-15 Created: 2018-03-15 Last updated: 2021-05-19Bibliographically approved
Projects
Effective model-based testing of concurrent systems [2014-05057_VR]; Halmstad University
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-4869-6794

Search in DiVA

Show all publications