Towards Deriving Test Sequences by Model Checking

Authors:
Adilson Luiz Bonifácio;Arnaldo Vieira Moura;Adenilso da Silva Simão;José Carlos Maldonado
Affiliations:
Computing Institute, University of Campinas, P.O. 6176 -- Campinas -- Brazil -- 13081-970;Computing Institute, University of Campinas, P.O. 6176 -- Campinas -- Brazil -- 13081-970;Mathematic Science and Computing Institute, University of São Paulo, P.O. 668 -- São Carlos -- Brazil -- 13560-970;Mathematic Science and Computing Institute, University of São Paulo, P.O. 668 -- São Carlos -- Brazil -- 13560-970
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 17
Cited 0

Test Selection Based on Finite State Models

IEEE Transactions on Software Engineering
A theory of timed automata

Theoretical Computer Science
Symbolic Model Checking

Symbolic Model Checking
Timed Wp-Method: Testing Real-Time Systems

IEEE Transactions on Software Engineering
Test Generation with Inputs, Outputs, and Quiescence

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Integrating BDD-Based and SAT-Based Symbolic Model Checking

FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Exploiting Behavioral Hierarchy for Efficient Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Generating Test Cases for a Timed I/O Automaton Model

Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Criteria for Generating Specification-Based Tests

ICECCS '99 Proceedings of the 5th International Conference on Engineering of Complex Computer Systems
Confirming Configurations in EFSM Testing

IEEE Transactions on Software Engineering
Efficient verification of timed automata with BDD-like data structures

International Journal on Software Tools for Technology Transfer (STTT)
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures

IEEE Transactions on Software Engineering
Testing from Partial Deterministic FSM Specifications

IEEE Transactions on Computers
A Method for the Design of Fault Detection Experiments

IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines

IEEE Transactions on Software Engineering
TCTL inevitability analysis of dense-time systems

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
An improved conformance testing method

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model-based testing automatically generates test cases from a model describing the behavior of the system under test. Although there exist several model-based formal testing methods, they usually do not address time constraints, mainly due to the fact that some supporting formalisms do not allow a suitable representation of time. In this paper, we consider such constraints in a framework of Timed Extended Finite State Machines (TEFSMs), which augment the Extended Finite State Machine (EFSM) model by including a notion of explicit and implicit time advancement. We use this extension to address conformance testing by reducing the confirming configuration problem to the problem of finding a path in a TEFSM product.