Abstract | ||
---|---|---|
A test case describes a specific execution scenario of the system under test (SUT). Its goal is to discover errors by means of its oracle, that emits a pass or fail verdict depending on the SUT behavior. The test case has a sequence of calls to SUT's operations with specific test data, which may come from the application of a combinatorial algorithm. This paper describes a method to describe generic test scenarios by means of regular expressions, whose symbols point to a SUT operation. The tester assigns values to each operation's parameter. A further step expands the regular expression and produces a set of operation sequences, which are then passed to a combinatorial algorithm to generate actual test cases. Regular expressions are annotated with a set of when clauses, that are processed by the combinatorial algorithm to include the oracle in the generated test cases. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1109/ICSTW.2017.38 | 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) |
Keywords | Field | DocType |
Software testing,Test case generation,Oracles,Regular expressions | Test suite,Test harness,System under test,Regular expression,Computer science,Algorithm,Oracle,Theoretical computer science,Scenario testing,Test data,Test case | Conference |
ISSN | ISBN | Citations |
2159-4848 | 978-1-5090-6677-3 | 2 |
PageRank | References | Authors |
0.40 | 10 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Macario Polo Usaola | 1 | 205 | 15.59 |
Francisco Ruiz Romero | 2 | 2 | 0.40 |
Rosana Rodriguez-Bobada Aranda | 3 | 2 | 0.40 |
Ignacio García Rodríguez De Guzmán | 4 | 191 | 23.48 |