Generating test data from state‐based specifications
By Jeff Offutt, Shaoying Liu, Aynur Abdurazik, Paul Ammann. Software testing, verification & reliability, 2003
388 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Software
View Paper: https://www.semanticscholar.org/paper/4633384a461b467c2f873a293f4cfcd84d7a5cd4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Software
- Mark Utting
- Bruno Legeard
- Roger T. Alexander
- Anneliese Amschler Andrews
- Alexander Pretschner
- Jeff Offutt
Citations in the corpus
- Testing Web applications by modeling with FSMs (2005, methodology): “Sequences of transitions for cluster and aggregate FSMs are generated by applying standard graph criteria such as all nodes or all edges [4, 7, 25].”
- A taxonomy of model‐based testing approaches (2012, background): “The general idea of test case generation with model checkers is to first formulate test case specifications as reachability properties, for instance, ‘eventually, a certain state is reached, or a certain transition fires’ (e.g. [ 47, 48 ] ).”