39 citations · 39 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2017
Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples
Mikaël Mayer, Jad Hamza, Viktor Kuncak
Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed…
cs.FL2016
Optimal Test Sets for Context-Free Languages
Mikaël Mayer, Jad Hamza
A test set for a formal language (set of strings) L is a subset T of L such that for any two string homomorphisms f and g defined on L, if the restrictions of f and g on T are iden…