From ff075147517eca19b4c650dbf9d7c3b21d9bb2ae Mon Sep 17 00:00:00 2001 From: Tamino Dauth Date: Tue, 30 Apr 2019 16:29:57 +0200 Subject: [PATCH 1/2] Explain NFA --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 3d7270d..4e120ae 100644 --- a/README.md +++ b/README.md @@ -53,6 +53,8 @@ The actions executed by the user on GUI elements are represented by transitions. If an action has not been executed yet from a state, it leads to the so-called unknown state *s?*. The unknown state is a special state from which all actions could be executed. Whenever an action, which previously led to *s?*, is being executed and then leads to a newly discovered state, the NFA has to be updated. +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: From 47964012987a28388ba21fcd355ef865007d117d Mon Sep 17 00:00:00 2001 From: Tamino Dauth Date: Tue, 30 Apr 2019 16:37:19 +0200 Subject: [PATCH 2/2] Mention insert in mutation --- README.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 4e120ae..39f2211 100644 --- a/README.md +++ b/README.md @@ -56,10 +56,11 @@ Whenever an action, which previously led to *s?*, 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