22 citations · 44 across the 8 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.SE2016★ 9 cited
Complementing Model Learning with Mutation-Based Fuzzing
Rick Smetsers, Joshua Moerman, Mark Janssen +1
An ongoing challenge for learning algorithms formulated in the Minimally Adequate Teacher framework is to efficiently obtain counterexamples. In this paper we compare and combine c…
cs.FL2016★ 22 cited
Learning Nominal Automata
Joshua Moerman, Matteo Sammartino, Alexandra Silva +2
We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to s…