Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Conclusions and Future Work
References
All Topics
Computer Science
Software Engineering

Connectivity Testing Through Model-Checking

Profile image of Brian NielsenBrian NielsenProfile image of A. SkouA. Skou

2004, Lecture Notes in Computer Science

https://doi.org/10.1007/978-3-540-30232-2_11
visibility

…

description

18 pages

link

1 file

Abstract

In this paper we show how to automatically generate test sequences that are aimed at testing the interconnections of embedded and communicating systems. Our proposal is based on the connectivity fault model proposed by , where faults may occur in the interface between the software and its environment rather than in the software implementation. We show that the test generation task can be carried out by solving a reachability problem in a system consisting essentially of a specification of the communicating system and its fault model. Our technique can be applied using most off-the-shelf model-checking tools to synthesize minimal test sequences, and we demonstrate it using the UppAal realtime model-checker. We present two algorithms for generating minimal tests: one for single faults and one for multiple faults. Moreover, we demonstrate how to exploit the unique time-and cost-planning-facilities of UppAal to derive cheapest possible test suites for restricted types of timed systems.

Related papers

Formal Specification Based Automatic Test Generation for Embedded Network Systems
Nguyen Van Tang

Journal of Applied Mathematics, 2014

Embedded systems have become increasingly connected and communicate with each other, forming large-scaled and complicated network systems. To make their design and testing more reliable and robust, this paper proposes a formal specification language calledSENSand aSENS-based automatic test generation tool calledTGSENS. Our approach is summarized as follows: (1) A user describes requirements of target embedded network systems by logical property-based constraints usingSENS. (2) GivenSENSspecifications, test cases are automatically generated using a SAT-based solver. Filtering mechanisms to select efficient test cases are also available in our tool. (3) In addition, given a testing goal by the user, test sequences are automatically extracted from exhaustive test cases. We’ve implemented our approach and conducted several experiments on practical case studies. Through the experiments, we confirmed the efficiency of our approach in design and test generation of real embedded air-conditi...

View PDFchevron_right
Model-based Test Generation for Embedded Software
Peter Struss

Testing embedded software systems on the control units of vehicles is a safety-relevant task, and developing the test suites for performing the tests on test benches is time-consuming. We present the foundations and results of a case study to automate the generation of tests for control software of vehicle control units based on a specification of requirements in terms of finite state machines. This case study builds upon our previous work on generation of tests for physical systems based on relational behavior models. In order to apply the respective algorithms, the finite state machine representation is transformed into a relational model. We present the transformation, the application of the test generation algorithm to a real example, and discuss the results and some specific challenges regarding software testing.

View PDFchevron_right
Testing Real-Time Embedded Systems using Timed Automata based approaches
Saeed Atrab

Journal of Systems and Software, 2013

Real-time Embedded Systems (RTESs) have an increasing role in controlling society infrastructures that we use on a day-today basis. RTES behaviour is not based solely on the interactions it might have with its surrounding environment, but also on the timing requirements it induces. As a result, ensuring that an RTES behaves correctly is non-trivial, especially after adding time as a new dimension to the complexity of the testing process. This research addresses the problem of testing RTESs from Timed Automata (TA) specification by the following. First, a new Priority-based Approach (PA) for testing RTES modelled formally as UPPAAL timed automata (TA variant) is introduced. Test cases generated according to a proposed timed adequacy criterion (clock region coverage) are divided into three sets of priorities, namely boundary, out-boundary and inboundary. The selection of which set is most appropriate for a System Under Test (SUT) can be decided by the tester according to the system type, time specified for v ABBREVIATIONS AF Assessment Factor AHP Analytical Hierarchy Process ANP Analytical Network Process ASP Adding a new Starting Point of a clock B Boundary set BCT Boundary Checking Technique BDD Binary Decision Diagram CAN Controller Area Network CE Coupling Effect CFG Control Flow Graph CI Consistency Index CPH Competent Programmer Hypothesis CR Consistency Ratio CRC Clock Region Coverage CSP Communicating Sequential Process CSS Communication and Concurrency Systems DBM Difference Bound Matrix DEA Data Envelopment Analysis DMU Decision Making Units DOM Document Object Model DS Distinguishing Sequences ECC Extending Clock Conditions EFSM Extended Finite State Machine EIA Exchanging Input Actions EIP Exchanging Input Parameters EOA Exchanging Output Actions EOP Exchanging Output Parameters ERA Event Recording Automata vi FC Fault Coverage FSM Finite State Machine GA Grid Automata

View PDFchevron_right
An Approach for Testing Real Time Protocol Entities
Ahmed Khoumsi

IFIP Advances in Information and Communication Technology, 2000

View PDFchevron_right
Early verification of embedded systems: Testing automation for uml models
Johnny Armando Gomes da Silva

It is widely known that errors discovered in advanced stages of a project are expensive to fix. Therefore, it is important to look for errors as soon as possible within the design cycle. This work addresses the early verification of embedded and real-time systems based on testing the behavior specified in the high-level specifications. A tool to automate the execution of test cases on UML models is presented. Its initial goal is to support the engineers in detecting errors on the system behavior before the implementation phase. The engineers specify a set of test cases, describing: runtime scenarios; behaviors to be tested along with their input; and the expected results. The tool executes automatically each test case, reporting its success/failure as well as the obtained results. The proposed approach has been evaluated by means of a case study representing a real-world embedded system application. The achieved results demonstrate that it is feasible to test the system behavior even though when the implementation is still not available.

View PDFchevron_right
Test method for embedded real-time systems
Rachid Bouaziz

Testing is an ultimate phase of product life cycle to which particular attention is paid, namely when dependability is of great importance. This work is concerned with the checking of dependability requirements by means of tests experiments. Here we address real-time embedded systems for which validation encounters a complexity problem due to real-time requirements. In this paper we propose a partial technique aimed at avoiding this problem and illustrate it with an example.

View PDFchevron_right
SymTest: A Framework for Symbolic Testing of Embedded Software
Sujit Kumar Chakrabarti

Proceedings of the 9th India Software Engineering Conference, 2016

In test case generation methods based on symbolic testing and/or model checking, the primary emphasis is on covering code/model elements and not on optimising test sequence length. However, in certain domains, e.g. embedded systems, GUI, networking software, testing process may involve interaction with other physical subsystems, possibly remotely situated. Thus, test sequence length may have important implications on the cost of testing. In this paper, we present SymTest, a novel framework for test sequence generation for testing embedded systems. SymTest selects good control flow paths so as to generate shorter test sequences. In case of unsatisfiability, SymTest explores the neighbouring paths using backtracking and heuristics. SymTest is distinctive w.r.t. other related methods in its attempt to generate shorter test sequences while searching for feasible paths. The other novelty is that SymTest allows plugging in heuristics in a flexible way, a feature because of which we call S...

View PDFchevron_right
Testing real-time embedded software using UPPAAL-TRON
Brian Nielsen, A. Skou

Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05, 2005

UPPAAL-TRON is a new tool for model based online black-box conformance testing of real-time embedded systems specified as timed automata. In this paper we present our experiences in applying our tool and technique on an industrial case study. We conclude that the tool and technique is applicable to practical systems, and that it has promising error detection potential and execution performance.

View PDFchevron_right
Model based testing of real-time embedded components
ousmane Kone

2006

We study automatic test generation for analyzing functional and extra-functional quality of embedded components. The main inputs of the method are the descriptive model of the analyzed component and a time-dependent model of the quality requirements. The model-based approach enables automation of the quality testing process, and therefore contributes to reducing the development time while avoiding errors

View PDFchevron_right
Rapid embedded system testing using verification patterns
oasis education

Software, IEEE, 2005

A pattern approach to testing real-time embedded systems lets developers customize a set of test script templates and reuse them throughout an application's life cycle. embedded system development. He received his PhD in computer science from the Feng Zhu is a senior test engineer. His research interests include pattern-based requirements verification for real-time embedded systems; automated model-based testing methodology and process; and test classification-based, automated test-selection optimization for large-scale regression. He received his PhD in computer science and engineering from

View PDFchevron_right

References (16)

  1. R. Alur and D. L. Dill. A Theory of Timed Automata. Theoretical Computer Science, 126(2):183-235, April 1994. 181
  2. P. Ammann, P. E. Black, and W. Majurski. Using model checking to generate tests from specifications. In ICFEM, page 46, 1998. 170, 178
  3. P. Ammann, W. Ding, and D. Xu. Using a model checker to test safety properties. 170
  4. G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, and J. Romijn. Efficient Guiding Towards Cost-Optimality in Uppaal. In T. Margaria and W. Yi, editors, TACAS 2001, number 2031 in LNCS, pages 174-188. Springer-Verlag, 2001. 182
  5. J. Callahan, F. Schneider, and S. Easterbrook. Automated software testing using modelchecking. In 1996 SPIN Workshop, August 1996. Also WVU Report NASA- IVV-96-022. 170
  6. A. Engels, L. Feijs, and S. Mauw:. Test generation for intelligent networks using model checking. In Ed Brinksma, editor, Tools and Algorithms for the Construc- tion and Analysis of Systems. TACAS'97, number 1217 in LNCS, 1997. 170
  7. A. Gargantini and C. L. Heitmeyer. Using model checking to generate tests from requirements specifications. In ESEC / SIGSOFT FSE, pages 146-162, 1999. 170
  8. Jens Chr. Godskesen. Complexity issues in connectivity testing. In Ed Brinksma and Jan Tretmans, editors, Proceedings of the Workshop on Formal Approaches to Testing of Software, FATES '01, (Aalborg, Denmark, August 25, 2001), 2001. 167, 168, 169, 180
  9. A. Hessel, K. G. Larsen, B. Nielsen, P. Pettersson, and A. Skou. Time-Optimal Test Cases for Real-Time Systems. In 3rd Intl. Workshop on Formal Approaches to Testing of Software (FATES 2003), Montréal, Québec, Canada, October 2003. 170, 181
  10. H. Hong, I. Lee, O. Sokolsky, and S. Cha. Automatic test generation from state- charts using model checking. In Ed Brinksma and Jan Tretmans, editors, Work- shop on Formal Approaches to Testing of Software, FATES '01, (Aalborg, Den- mark, August 25, 2001), 2001. 170
  11. H. S. Hong, I. Lee, O. Sokolsky, and H. Ural. A Temporal Logic Based Theory of Test Coverage and Generation. In J.-P. Katoen and P. Stevens, editors, TACAS 2002, pages 327-341. Kluwer Academic Publishers, April 2002. 170
  12. K. G. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automat. In G. Berry, H. Comon, and A. Finkel, editors, Proc. of CAV 2001, number 2102 in LNSC, pages 493-505. Springer-Verlag, 2001. 182
  13. K. G. Larsen, P. Pettersson, and W. Yi. UppAal in a Nutshell. International Journal on Software Tools for Technology Transfer, 1(1):134-152, 1997. 169
  14. Magee and Kramer. Concurrency: State Models and Java Programs. Wiley, 2002. 178
  15. M. P. E. Heimdahl and S. Rayadurgam and W. Visser and G. Devaraj and J. Gao. Auto-generating Test Sequences Using Model Checkers: A Case Study. In A. Petrenko and A. Ulrich, editors, 3rd Intl. Workshop on Formal Approaches to Testing of Software, FATES 2003, volume 2931 of LNCS, pages 42-59, Montréal, Québec, CA, 2004. 170
  16. J. G. Springintveld, F. W. Vaandrager, and P. R. D'Argenio. Testing timed au- tomata. Theoretical Computer Science, 254(1-2), March 2001. 181

Related papers

Coping with Complexity of Testing Models for Real-Time Embedded Systems
Carsten Weise

2011 Fifth International Conference on Secure Software Integration and Reliability Improvement - Companion, 2011

Model based testing techniques are a breakthrough in the modern software development. The integration of state-ofthe-art tools to automatically generate and evaluate tests from a model of the software product allows reducing the effort of testing activities while maintaining quality. A major problem for model based techniques is however the effort and the timing for the model specification. In practice, modeling for test case generation will often happen during the test phase instead of the design phase, implying that there is a high time pressure within the modeling process. Model views can help to reduce the effort spent for the modeling. In our work, we will present an useful approach to views for timed testing models, thus reducing the complexity of the modeling process.

View PDFchevron_right
Software integration testing based on communication coverage criteria and partial model generation
Christopher Robinson-mallett

This paper considers the problem of integration testing the components of a timed distributed software system. We assume that communication between the components is specified using timed interface automata and use computational tree logic (CTL) to define communication-based coverage criteria that refer to send-and receive-statements and communication paths. The proposed method enables testers to focus during component integration on such parts of the specification, e.g. behaviour specifications or Markovian usage models, that are involved in the communication between components to be integrated. A more specific application area of this approach is the integration of test-models, e.g. a transmission gear can be tested based on separated models for the driver behaviour, the engine condition, and the mechanical and hydraulical transmission states. Given such a state-based specification of a distributed system and a concrete coverage goal, a model checker is used in order to determine the coverage or generate test sequences that achieve the goal. Given the generated test sequences we derive a partial test-model of the components from which the test sequences are derived. The partial model can be used to drive further testing and can also be used as the basis for producing additional partial models in incremental integration testing. While the process of deriving the test sequences could suffer from a combinatorial explosion, the effort required to generate the partial model is polynomial in the number of test sequences and their length. Thus, where it is not feasible to produce test sequences that achieve a given type of coverage it is still possible to produce a partial model on the basis of test sequences generated to achieve some other criterion. As a result, the process of generating a partial model has the potential to scale to large industrial software systems. While a particular model checker, UPPAAL, was used, it should be relatively straightforward to adapt the approach for use with other CTL based model checkers. A potential additional benefit of the approach is that it provides a visual description of the state-based testing of distributed systems, which may be beneficial in other contexts such as education and comprehension.

View PDFchevron_right
Analysis of Model-based Testing methods for Embedded Systems
Mehrdad Bagheri

2016

The work presented in this master's thesis is a part of the Artemis-MBAT project. MBAT will provide European industry with a new leading-edge Validation and Verification technology in the form of a ...

View PDFchevron_right
Test Generation for Time Critical Systems: Tool and Case Study
A. Skou

Generating timed test sequences by hand is error-prone and time consuming, and it is easy to overlook important scenarios. The paper presents a tool based on formal methods that automatically computes a test suite for conformance testing of time critical systems. The generated tests are selected on the basis of a coverage criterion of the specification. The tool guarantees production of sound test cases only, and is able to produce a complete covering test suite. We demonstrate the tool by generating test cases for the Philips Audio Protocol

View PDFchevron_right
Fault-Model-Based Test Generation for Embedded Software
Peter Struss

Testing embedded software systems on the control units of vehicles is a safety-relevant task, and developing the test suites for performing the tests on test benches is time-consuming. We present the foundations and results of a case study to automate the generation of tests for control software of vehicle control units based on a specification of requirements in terms of finite state machines. This case study builds upon our previous work on generation of tests for physical systems based on relational behavior models. In order to apply the respective algorithms, the finite state machine representation is transformed into a relational model. We present the transformation, the application of the test generation algorithm to a real example, and discuss the results and some specific challenges regarding software testing.

View PDFchevron_right

Related topics

  • Software Implementation
  • Automatic code generation
  • Test Generation
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved