Applying Extended Finite State Machines in Software Testing of Interactive Systems

@inproceedings{Fantinato2003ApplyingEF,
  title={Applying Extended Finite State Machines in Software Testing of Interactive Systems},
  author={Marcelo Fantinato and Mario Jino},
  booktitle={DSV-IS},
  year={2003}
}
Model Based Testing (MBT) is a functional testing technique that makes use of information from behavioral models of the software to carry out the testing task. This technique has been commonly used in testing of interactive systems, where the used model represents the system behavior reacting to user’s actions. Finite State Machines (FSMs) are one of the most used modeling techniques for MBT. However, traditional FSMs do not provide mechanisms to model important behavioral aspects of the… Expand
Fail-Safe Testing of Safety-Critical Systems
  • A. Gario, A. Andrews
  • Computer Science
  • 2014 23rd Australian Software Engineering Conference
  • 2014
TLDR
This paper proposes an approach for testing of safety critical systems based on a behavioral and a fault model which results in an integrated model which then can be used to generate tests using a variety of testing criteria. Expand
Integrating Safety Certification Into Model-Based Testing of Safety-Critical Systems
  • Aiman Gannous, A. Andrews
  • Computer Science
  • 2019 IEEE 30th International Symposium on Software Reliability Engineering (ISSRE)
  • 2019
TLDR
A concrete application of Model-Combinatorial based testing with an application to a case study showed that MCbt is more efficient and produces more safety evidences compared to state-of-the-art testing approaches. Expand
Developing a Framework for Testing Android Applications based on Reverse Engineering Techniques
TLDR
A framework for testing mobile applications and automatically extracting a GUI (Graphical User Interface) model based on reverse engineering techniques is developed, which is evaluated by testing two android applications and comparing the testing outcomes with similar frameworks. Expand
Event-Based Mutation Testing vs. State-Based Mutation Testing - An Experimental Comparison
  • F. Belli, Mutlu Beyazit
  • Engineering, Computer Science
  • 2011 IEEE 35th Annual Computer Software and Applications Conference
  • 2011
TLDR
This paper compares both techniques using mutation testing, which is originally code-based, but has recently been extended to enable also MBT, and introduces frameworks that are composed of a set of models, aset of mutation operators, aSet of coverage criteria, and a setof test generation algorithms. Expand
Automata-Based Software Reliability Model: The Key to Reliable Software
TLDR
It is proposed that a Finite State Automata (FSA) based reliability model can serve as a befitting solution to all existing software reliability challenges and estimates actual system reliability at runtime. Expand
Toward a Systematic and Safety Evidence Productive Verification Approach for Safety-Critical Systems
TLDR
This paper proposes a systematic approach for verifying safety-critical systems efficiently by integrating model-based testing, combinatorial testing, and safety analysis; this is all driven by providing safety assurance. Expand
A Formal Framework for Mutation Testing
  • F. Belli, Mutlu Beyazit
  • Computer Science
  • 2010 Fourth International Conference on Secure Software Integration and Reliability Improvement
  • 2010
TLDR
A grammar-based mutation testing framework is proposed, together with effective mutation operators, coverage concepts and algorithms for test sequence generation, which enables complementary or alternative use of regular grammars, depending on the preferences of the test engineer. Expand
Fail-Safe Test Generation in Safety Critical Systems
TLDR
This paper builds failure-mitigation tests from an existing behavioral test suite, using an explicit mitigation model for which mitigation paths are generated which are then woven at selected failure points into the original test suite to create failure-Mitigation tests. Expand
Robustness Testing of Safety-critical Systems: A Portable Insulin Pump Application
As a consequence of software becoming an indispensable component of any safety-critical system, verification of such systems will not be sufficient without showing that the software will not createExpand
Fundamental results for learning deterministic extended finite state machines from queries
TLDR
This paper investigates fundamental properties of extended finite state machines in relation to Angluin's language inference problem and provides an inference algorithm for such models. Expand
...
1
2
...

References

SHOWING 1-10 OF 40 REFERENCES
F INITE STATE MODEL-BASED TESTING ON A SHOESTRING
TLDR
This paper shows how anyone willing to do some test programming can implement model-based testing in low-cost test language tools. Expand
Test Selection Based on Finite State Models
TLDR
A method for the selection of appropriate test case, an important issue for conformance testing of protocol implementations as well as software engineering, is presented and is shown to have general applicability, full fault-detection power, and yields shorter test suites than the W-method. Expand
Automatic Test Generation for EFSM-based Systems
TLDR
This work proposes a methodology which will solve, if not completely, partially the executability problem and mainly the problem of including all the influencing loops in the test sequences and finding how many times an unbounded loop must be executed. Expand
Model-based testing of a highly programmable system
TLDR
This work used automatic test case generation technology to develop sets of self checking test cases based on a machine readable specification of the messages in the protocol under test, and found the combinatorial approach of covering pairwise interactions between input fields to be highly effective. Expand
Model Based Testing
TLDR
This paper will focus on the testing benefits and review some of the historical challenges that prevented model based testing and present the solutions that overcame these challenges. Expand
Generating Conformance Test Sequences for Combined Control and Data Flow of Communication Protocols
Using a limited version of Estelle, from which a specification can be represented in terms of an Extended Finite State Machine (EFSM), we develop a technique to generate conformance tests which testExpand
Testing Software Design Modeled by Finite-State Machines
  • T. S. Chow
  • Computer Science
  • IEEE Transactions on Software Engineering
  • 1978
TLDR
The method is based on a result in automata theory and can be applied to software testing and its error-detecting capability is compared with that of other approaches. Expand
Mutation testing applied to validate specifications based on statecharts
TLDR
A mutation operator set for statecharts, one of the crucial points for effectively applying mutation testing is defined, and strategies to abstract the statechart components according to different statechart features that may comprise the testing and validation activity aims are provided. Expand
A test sequence selection method for protocol testing
A method for automated selection of test sequences from a protocol specification given in Estelle for the purpose of testing both control and data flow aspects of a protocol implementation isExpand
Generating test data from state‐based specifications
TLDR
This paper presents formal testing criteria for system level testing that are based on formal specifications of the software, which represent a significant opportunity for testing. Expand
...
1
2
3
4
...