Sciweavers

1422 search results - page 2 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
IJCAI
2007
13 years 6 months ago
Fault-Model-Based Test Generation for Embedded Software
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-consu...
Michael Esser, Peter Struss
FATES
2004
Springer
13 years 9 months ago
Test Generation Based on Symbolic Specifications
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse
DLT
2003
13 years 6 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
PTS
2008
165views Hardware» more  PTS 2008»
13 years 6 months ago
Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
Farn Wang, Geng-Dian Huang
FATES
2006
Springer
13 years 9 months ago
A Symbolic Framework for Model-Based Testing
Abstract. The starting point for Model-Based Testing is an implementation relation that formally defines when a formal model representing the System Under Test conforms to a formal...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse