Skip to content
This repository has been archived by the owner on Mar 12, 2020. It is now read-only.

Commit

Permalink
Mention insert in mutation
Browse files Browse the repository at this point in the history
  • Loading branch information
tdauth committed Apr 30, 2019
1 parent ff07514 commit 4796401
Showing 1 changed file with 3 additions and 2 deletions.
5 changes: 3 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -56,10 +56,11 @@ Whenever an action, which previously led to *s<sub>?</sub>*, is being executed a
The same action might lead from one single state to different states since the states do not capture the whole program behavior.
This makes the finite automaton nondeterministic.

The NFA is based on the UI model from ["Search-Based System Testing: High Coverage, No False Alarms"](http://www.specmate.org/papers/2012-07-Search-basedSystemTesting-HighCoverageNoFalseAlarms.pdf) (section "4.5 UI Model"). Originally, it has been used together with a genetic algorithm for search-based system testing, where it served two purposes:
The NFA is based on the UI model from ["Search-Based System Testing: High Coverage, No False Alarms"](http://www.specmate.org/papers/2012-07-Search-basedSystemTesting-HighCoverageNoFalseAlarms.pdf) (section "4.5 UI Model"). Originally, it has been used together with a genetic algorithm for search-based system testing, where it served three purposes:

1. Population initialization: to give precedence to unexplored actions.
2. Mutation: to repair test cases.
2. Mutation: to insert unexplored actions.
3. Mutation: to repair test cases which became invalid by the mutation.

## Concurrency

Expand Down

0 comments on commit 4796401

Please sign in to comment.