Markus Zimmermann

https://code.google.com/p/gocc/

Dynamic values are not correctly working in repeat to/from attributes

2

``` As = +3("a") Bs = +2,$As.Count("b") START = As Bs ``` This should permutate to "aaabb" and "aaabbb" but does currently only permutate to "aaabbb" Not working with the...

Implement variable inlining / verbs like in fmt.Printf

1

Implement something like ``` ... '{ user: { id: ${id}, name: "${name}" } }' ``` Where id and name are tokens which are embedded into the string.

Scopes for token attributes are just wrong

1

The following format ``` tavor Number = +,10([0-9]) Inner = "\t i1.before: " $Number.Count "\n", "\t i1: " Number "\n", "\t i1.after: " $Number.Count "\n", "\t i2.before: " $Number.Count "\n",...

Write a fuzzer strategey which can be given a percentage on how many tokens should be covered as soon as possible. So that a minimum on outputs can be generated.

See http://www.whyprogramsfail.com/ and https://www.st.cs.uni-saarland.de/dd/ for more information. This is quite complex to implement in a generic way.

- [ ] Rename the old BinarySearchStrategy to "SimpleStrategy" and remove all TODO from it if possible. - [ ] Implement a real binary-search delta-debugging algorithm

"not in" is already allowed in the tavor format so the complement "in" is needed too.

Plan and implement the groundwork for mutation based fuzzing

Online fuzzing

1

Plan and implement the groundwork for online fuzzing through the binary. Online fuzzing can be already done programmatically or by using an executable which parses the fuzzing output and executes...