about summary refs log tree commit diff
path: root/docs
diff options
context:
space:
mode:
authorvan Hauser <vh@thc.org>2020-06-25 10:33:59 +0200
committervan Hauser <vh@thc.org>2020-06-25 10:33:59 +0200
commitb5573b3adbe01681156598ce064c228c0140f782 (patch)
tree25a29e5aed99cad5ecb33ab7dbf1578da9d9c604 /docs
parent15dd4ad177b4822ad25eaec26897bb55e5cd5785 (diff)
downloadafl++-b5573b3adbe01681156598ce064c228c0140f782.tar.gz
add seek power schedule, remove update stats in calibration, fix help output
Diffstat (limited to 'docs')
-rw-r--r--docs/Changelog.md2
-rw-r--r--docs/power_schedules.md1
2 files changed, 3 insertions, 0 deletions
diff --git a/docs/Changelog.md b/docs/Changelog.md
index 336dca01..a692571e 100644
--- a/docs/Changelog.md
+++ b/docs/Changelog.md
@@ -24,6 +24,8 @@ sending a mail to <afl-users+subscribe@googlegroups.com>.
      - Ensure that the targets are killed on exit
      - fix/update to MOpt (thanks to arnow117)
      - added MOpt dictionary support from repo
+     - added experimental SEEK power schedule. It is EXPLORE with ignoring
+       the runtime and less focus on the length of the test case
   - llvm_mode:
     - the default instrumentation is now PCGUARD if the llvm version is >= 7,
       as it is faster and provides better coverage. The original afl
diff --git a/docs/power_schedules.md b/docs/power_schedules.md
index 067a1d91..06fefa12 100644
--- a/docs/power_schedules.md
+++ b/docs/power_schedules.md
@@ -21,6 +21,7 @@ We find that AFL's exploitation-based constant schedule assigns **too much energ
 | `-p exploit` (AFL) | ![LIN](http://latex.codecogs.com/gif.latex?p%28i%29%20%3D%20%5Calpha%28i%29) |
 | `-p mmopt` | Experimental: `explore` with no weighting to runtime and increased weighting on the last 5 queue entries |
 | `-p rare` | Experimental: `rare` puts focus on queue entries that hit rare edges |
+| `-p seek` | Experimental: `seek` is EXPLORE but ignoring the runtime of the queue input and less focus on the size |
 where *α(i)* is the performance score that AFL uses to compute for the seed input *i*, *β(i)>1* is a constant, *s(i)* is the number of times that seed *i* has been chosen from the queue, *f(i)* is the number of generated inputs that exercise the same path as seed *i*, and *μ* is the average number of generated inputs exercising a path.
   
 More details can be found in the paper that was accepted at the [23rd ACM Conference on Computer and Communications Security (CCS'16)](https://www.sigsac.org/ccs/CCS2016/accepted-papers/).