Formal Approaches to Software Testing: 4th International Workshop, FATES 2004, Linz, Austria, September 21, 2004, Revised Selected PapersJens Grabowski, Brian Nielsen Testing often accounts for more than 50% of the required e?ort during system development.Thechallengeforresearchistoreducethesecostsbyprovidingnew methods for the speci?cation and generation of high-quality tests. Experience has shown that the use of formal methods in testing represents a very important means for improving the testing process. Formal methods allow for the analysis andinterpretationofmodelsinarigorousandprecisemathematicalmanner.The use of formal methods is not restricted to system models only. Test models may alsobeexamined.Analyzingsystemmodelsprovidesthepossibilityofgenerating complete test suites in a systematic and possibly automated manner whereas examining test models allows for the detection of design errors in test suites and their optimization with respect to readability or compilation and execution time. Due to the numerous possibilities for their application, formal methods have become more and more popular in recent years. The Formal Approaches in Software Testing (FATES) workshop series also bene?ts from the growing popularity of formal methods. After the workshops in Aalborg (Denmark, 2001), Brno (Czech Republic, 2002) and Montr ́ eal (Canada, 2003), FATES 2004 in Linz (Austria) was the fourth workshop of this series. Similar to the workshop in 2003, FATES 2004 was organized in a?liation with the IEEE/ACM Conference on Automated Software Engineering (ASE 2004). FATES 2004 received 41 submissions. Each submission was reviewed by at least three independent reviewers from the Program Committee with the help of some additional reviewers. Based on their evaluations, 14 full papers and one wo- in-progress paper from 11 di?erent countries were selected for presentation. |
Contents
Symbolic Test Generation | 1 |
Symbolic Test Case Generation for Primitive Recursive Functions | 16 |
Preserving Contexts for Soft Conformance Relation | 33 |
Testing Nonfunctional Properties | 49 |
A Test Generation Framework for quiescent RealTime Systems | 64 |
Online Testing of RealTime Systems Using Uppaal | 79 |
A Formal Approach | 95 |
Test Development with Model Checking Techniques | 110 |
Specifying and Generating Test Cases Using Observer Automata | 125 |
Semiformal Development of a FaultTolerant Leader Election Protocol | 140 |
An AutomataTheoretic Approach for ModelChecking Systems with | 155 |
Test Optimization | 170 |
Ordering Mutants to Minimise Test Effort in Mutation Testing | 195 |
Testing COM Components Using Software Fault Injection | 210 |
225 | |
Other editions - View all
Common terms and phrases
abstract trace algorithm applied approach automata automaton behaviour bisimulation composition Computer Science conformance relation constraints context coverage criteria coverage item criterion customization d(maa defined Definition denoted detect du-pair edge Eff2 EFSM empirical study environment event example execution Fault Injection faults finite FIT/FIO flow graph formal function given hypothesis IEEE input actions integer interface ioco Isabelle/HOL Labelled Transition Systems LNCS LTL formula method model checking mutants mutation testing node observer operator oracle output actions paper parameterized possible probabilistic query quiescence random variable real-time systems recursive red-black trees result reuse selected soft conformation Software Testing specification subsumption graph symbolic template trees temporal logic test data test patterns test sequence test suite testing technique Theorem tool Topological Closure transition relation transition systems Tretmans u(maa unspecified components UPPAAL values verification