hh.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Mousavi, Mohammad RezaORCID iD iconorcid.org/0000-0002-4869-6794
Publications (10 of 111) Show all publications
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)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: 2019-02-15Bibliographically 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 (Other academic) 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)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: 2019-02-15Bibliographically 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)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: 2018-12-11Bibliographically 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: 2017-12-06Bibliographically 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)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: 2018-03-15Bibliographically approved
Hierons, R. M., Mousavi, M. R., Thomsen, M. K. & Turker, U. C. (2017). Hardness of deriving invertible sequences from finite state machines. In: Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey & Tiziana Margaria (Ed.), SOFSEM 2017: SOFSEM 2017: Theory and Practice of Computer Science: 43rd International Conference on Current Trends in Theory and Practice of Computer Science Limerick, Ireland, January 16–20, 2017, Proceedings. Paper presented at 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Limerick, IRELAND, January 16-20, 2017 (pp. 147-160). Heidelberg: Springer Berlin/Heidelberg
Open this publication in new window or tab >>Hardness of deriving invertible sequences from finite state machines
2017 (English)In: SOFSEM 2017: SOFSEM 2017: Theory and Practice of Computer Science: 43rd International Conference on Current Trends in Theory and Practice of Computer Science Limerick, Ireland, January 16–20, 2017, Proceedings / [ed] Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey & Tiziana Margaria, Heidelberg: Springer Berlin/Heidelberg, 2017, p. 147-160Conference paper, Published paper (Refereed)
Abstract [en]

Many test generation algorithms use unique input/output sequences (UIOs) that identify states of the finite state machine specification M. However, it is known that UIO checking the existence of UIO sequences is PSPACE-complete. As a result, some UIO generation algorithms utilise what are called invertible sequences; these allow one to construct additional UIOs once a UIO has been found. We consider three optimisation problems associated with invertible sequences: deciding whether there is a (proper) invertible sequence of length at least K; deciding whether there is a set of invertible sequences for state set S′ that contains at most K input sequences; and deciding whether there is a single input sequence that defines invertible sequences that take state set S″ to state set S′. We prove that the first two problems are NP-complete and the third is PSPACE-complete. These results imply that we should investigate heuristics for these problems. © Springer International Publishing AG 2017.

Place, publisher, year, edition, pages
Heidelberg: Springer Berlin/Heidelberg, 2017
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; Vol. 10139
Keywords
Software testing, Generation algorithm, Input sequence, NP Complete, Optimisation problems, PSPACE-complete, Single input, Test generation algorithm, Unique input/output sequences, Optimization
National Category
Discrete Mathematics
Identifiers
urn:nbn:se:hh:diva-36431 (URN)10.1007/978-3-319-51963-0_12 (DOI)000418793100012 ()2-s2.0-85010657662 (Scopus ID)978-3-319-51962-3 (ISBN)978-3-319-51963-0 (ISBN)
Conference
43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Limerick, IRELAND, January 16-20, 2017
Available from: 2018-03-15 Created: 2018-03-15 Last updated: 2018-03-15Bibliographically approved
Castellani, I. & Mousavi, M. R. (2017). Preface: Special issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2014 and 2015). The Journal of logical and algebraic methods in programming, 87, 93-93
Open this publication in new window or tab >>Preface: Special issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2014 and 2015)
2017 (English)In: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 87, p. 93-93Article in journal, Editorial material (Other academic) Published
Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2017
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-33622 (URN)10.1016/j.jlamp.2017.01.002 (DOI)2-s2.0-85017507275 (Scopus ID)
Funder
ELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsKnowledge Foundation, 20140312Swedish Research Council, 621-2014-5057
Available from: 2017-03-27 Created: 2017-03-27 Last updated: 2018-01-13Bibliographically approved
Fragal, V. H., Simao, A., Endo, A. T. & Mousavi, M. R. (2017). Reducing the Concretization Effort in FSM-Based Testing of Software Product Lines. In: Randall Bilof (Ed.), 10th IEEE International Conference on Software Testing, Verification and Validation Workshops - ICSTW 2017: . Paper presented at 10th IEEE International Conference on Software Testing, Verification and Validation (ICSTW), Tokyo, Japan, March 13-17, 2017 (pp. 329-336). Los Alamitos, CA: IEEE
Open this publication in new window or tab >>Reducing the Concretization Effort in FSM-Based Testing of Software Product Lines
2017 (English)In: 10th IEEE International Conference on Software Testing, Verification and Validation Workshops - ICSTW 2017 / [ed] Randall Bilof, Los Alamitos, CA: IEEE , 2017, p. 329-336Conference paper, Published paper (Refereed)
Abstract [en]

To test a Software Product Line (SPL), the test artifacts and the techniques must be extended to support variability. In general, when new SPL products are developed, more tests are generated to cover new or modified features. A dominant source of extra effort for such tests is the concretization of newly generated tests. Thus, minimizing the amount of new non-concretized tests required to perform conformance testing on new products reduces the overall test effort. In this paper, we propose a test reuse strategy for conformance testing of SPL products that aims at reducing test effort. We use incremental test generation methods based on finite state machines (FSMs) to maximize test reuse. We combine these methods with a selection algorithm used to identify non-redundant concretized tests. We illustrate our strategy using examples and a case study with an embedded mobile SPL. The results indicate that our strategy can save up to 36% of test effort in comparison to current test reuse strategies for the same fault detection capability. © 2017 IEEE.

Place, publisher, year, edition, pages
Los Alamitos, CA: IEEE, 2017
Series
IEEE International Conference on Software Testing Verification and Validation Workshops, ISSN 2159-4848
Keywords
Conformance Testing, Test Case Reuse, Model-Based Testing, Finite State Machine, Software Product Lines
National Category
Software Engineering
Identifiers
urn:nbn:se:hh:diva-35617 (URN)10.1109/ICSTW.2017.61 (DOI)000403392800051 ()2-s2.0-85018410007 (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
Funder
Knowledge FoundationSwedish Research CouncilELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funding: The work of V. Hafemann has been partially supported by the Science Without Borders project number 201694/2015-8. The work of M.R. Mousavi has been supported by grants from the Swedish Knowledge Foundation (KKS), Swedish Research Council (VR), and the ELLIIT Strategic Research Environment.

Available from: 2017-12-01 Created: 2017-12-01 Last updated: 2018-12-20Bibliographically approved
Araujo, H., Carvalho, G., Mohaqeqi, M., Mousavi, M. R. & Sampaio, A. (2017). Sound conformance testing for cyber-physical systems: Theory and implementation. Science of Computer Programming, 162, 35-54
Open this publication in new window or tab >>Sound conformance testing for cyber-physical systems: Theory and implementation
Show others...
2017 (English)In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 162, p. 35-54Article in journal (Refereed) Published
Abstract [en]

Conformance testing is a formal and structured approach to verifying system correctness. We propose a conformance testing algorithm for cyber-physical systems, based on the notion of hybrid conformance by Abbas and Fainekos. We show how the dynamics of system specification and the sampling rate play an essential role in making sound verdicts. We specify and prove error bounds that lead to sound test-suites for a given specification and a given sampling rate. We use reachability analysis to find such bounds and implement the proposed approach using the CORA toolbox in Matlab. We apply the implemented approach on a case study from the automotive domain. © 2017 The Author(s).

Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2017
Keywords
Cyber-physical systems, Model-based testing, Conformance testing, Soundness, Reachability analysis
National Category
Embedded Systems
Identifiers
urn:nbn:se:hh:diva-36508 (URN)10.1016/j.scico.2017.07.002 (DOI)2-s2.0-85027519698 (Scopus ID)
Projects
AUTO-CAAS
Funder
Swedish Research Council, 621-2014-5057Knowledge Foundation, 20140312
Note

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: 2018-04-05 Created: 2018-04-05 Last updated: 2018-06-28Bibliographically 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