| 31. |
- Entekhabi, Sina, et al.
(author)
-
Locality-Based Test Selection for Autonomous Agents
- 2022
-
In: Testing Software and Systems. - Cham : Springer Science+Business Media B.V.. - 9783031046728 ; , s. 73-89
-
Conference paper (peer-reviewed)abstract
- 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.
|
|
| 32. |
- Fragal, Vanderson Hafemann, et al.
(author)
-
Reducing the Concretization Effort in FSM-Based Testing of Software Product Lines
- 2017
-
In: 10th IEEE International Conference on Software Testing, Verification and Validation Workshops - ICSTW 2017. - Los Alamitos, CA : IEEE. - 9781509066766 - 9781509066773 ; , s. 329-336
-
Conference paper (peer-reviewed)abstract
- 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.
|
|
| 33. |
- Fragal, Vanderson Hafemann, et al.
(author)
-
Validated Test Models for Software Product Lines : Featured Finite State Machines
- 2016
-
In: Formal Aspects of Component Software. - Cham : Springer. - 9783319576657 - 9783319576664 ; , s. 210-227
-
Conference paper (peer-reviewed)abstract
- Variants of the finite state machine (FSM) model have been extensively used to describe the behaviour of reactive systems. In particular, several model-based testing techniques have been developed to support test case generation and test case executions from FSMs. Most such techniques require several validation properties to hold for the underlying test models. In this paper, we propose an extension of the FSM test model for software product lines (SPLs), named featured finite state machine (FFSM). As the first step towards using FFSMs as test models, we define feature-oriented variants of basic test model validation criteria. We show how the high-level validation properties coincide with the necessary properties on the product FSMs. Moreover, we provide a mechanised tool prototype for checking the feature-oriented properties using satisfiability modulo theory (SMT) solver tools. We investigate the applicability of our approach by applying it to both randomly generated FFSMs as well as those from a realistic case study (the Body Comfort System). The results of our study show that for random FFSMs over 16 independent non-mandatory features, our technique provides substantial efficiency gains for the set of proposed validity checks. © Springer International Publishing AG 2017
|
|
| 34. |
- Gebler, Daniel, et al.
(author)
-
Algebraic Meta-Theory of Processes with Data
- 2013
-
In: Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics. - : Open Publishing Association. ; , s. 63-77
-
Conference paper (peer-reviewed)abstract
- There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong bisimilarity of processes. To our knowledge, this literature has never been extended to the setting with data (e.g. to model storage and memory). We show how the rule formats for algebraic properties can be exploited in a genericmanner in the setting with data. Moreover, we introduce a new approach for deriving sound and ground-complete axiom schemata for a notion of bisimilarity with data, called stateless bisimilarity, based on intuitive auxiliary function symbols for handling the store component. We do restrict, however, the axiomatization to the setting where the store component is only given in terms of constants. © Gebler, Goriac & Mousavi.
|
|
| 35. |
- Ghassemi, Fatemeh, et al.
(author)
-
Product Line Process Theory
- 2016
-
In: The Journal of logical and algebraic methods in programming. - Amsterdam : Elsevier. - 2352-2208 .- 2352-2216. ; 85:1, part 2, s. 200-226
-
Journal article (peer-reviewed)abstract
- Software product lines (SPLs) facilitate reuse and customization in software development by genuinely addressing the concept of variability. Product Line Calculus of Communicating Systems (PL-CCS) is a process calculus for behavioral modeling of SPLs, in which variability can be explicitly modeled by a binary variant operator. In this paper, we study different notions of behavioral equivalence for PL-CCS, based on Park and Milner's strong bisimilarity. These notions enable reasoning about the behavior of SPLs at different levels of abstraction. We study the compositionality property of these notions and the mutual relationship among them. We further show how the strengths of these notions can be consolidated in an equational reasoning method. Finally, we designate the notions of behavioral equivalence that are characterized by the property specification language for PL-CCS, called multi-valued modal μ-calculus. © 2015 The Authors. Published by Elsevier Inc.
|
|
| 36. |
|
|
| 37. |
|
|
| 38. |
- Hafemann Fragal, Vanderson, 1988-
(author)
-
Automatic generation of configurable test-suites for software product lines
- 2018
-
Doctoral thesis (other academic/artistic)abstract
- Software Product Line Engineering (SPLE) is an approach used in the development of similar products, which aims at systematic reuse of software artifacts. The SPLE process has several activities executed to assure software quality. Quality assurance is of vital importance for achieving and maintaining a high quality for various artifacts, such as products and processes. Testing activities are widely used in industry for quality assurance. However, the effort for applying testing is usually high, and increasing the testing efficiency is a major concern. A common means of increasing efficiency is automation of test design. Several techniques, processes, and strategies were developed for SPLE testing, but still many problems are open in this area of research. The challenge in focus is the reduction of the overall test effort required to test SPLE products. Test effort can be reduced by maximizing test reuse using models that take advantage of the similarity between products. The thesis goal is to automate the generation of small test-suites with high fault detection and low test redundancy between products. To achieve the goal, equivalent tests are identified for a set of products using complete and configurable test-suites. Two research directions are explored, one is product-based centered, and the other is product line-centered. For test design, test-suites that have full fault coverage were generated from state machines with and without feature constraints. A prototype tool was implemented for test design automation. In addition, the proposed approach was evaluated using examples, experimental studies, and an industrial case study for the automotive domain. The results of the product-based centered approach indicate a reduction of 36% on the number of test cases that need to be concretized. The results of the product line-centered approach indicate a reduction of 50% on the number of test cases generated for groups of product configurations.
|
|
| 39. |
- Hierons, Robert M., et al.
(author)
-
Hardness of deriving invertible sequences from finite state machines
- 2017
-
In: SOFSEM 2017: SOFSEM 2017: Theory and Practice of Computer Science. - Heidelberg : Springer Berlin/Heidelberg. - 9783319519623 - 9783319519630 ; , s. 147-160
-
Conference paper (peer-reviewed)abstract
- 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.
|
|
| 40. |
- Keshishzadeh, Sarmen, et al.
(author)
-
Early Fault Detection in DSLs using SMT Solving and Automated Debugging
- 2013
-
In: Software Engineering and Formal Methods. - Berlin : Springer Berlin/Heidelberg. - 9783642405600 ; , s. 182-196
-
Conference paper (peer-reviewed)abstract
- In the context of Domain Specic Languages (DSLs), westudy ways to detect faults early in the software development cycle. Wepropose techniques that validate a wide range of properties, classiedinto basic and advanced. Basic validation includes syntax checking, reference checking and type checking. Advanced validation concerns domainspecic properties related to the semantics of the DSL. For verication,we mechanically translate the DSL instance and the advanced propertiesinto Satisability Modulo Theory (SMT) problems, and solve these problems using an SMT solver. For user feedback, we extend the vericationwith automated debugging, which pinpoints the causes of the violatedproperties and traces them back to the syntactic constructs of the DSL.We illustrate this integration of techniques using an industrial case oncollision prevention for medical imaging equipment. © 2013 Springer-Verlag.
|
|
