Learning the language of software errors

We propose to use algorithms for learning deterministic finite automata (DFA), such as Angluin’s L ∗ algorithm, for learning a DFA that describes the possible scenarios under which a given program error occurs. The alphabet of this automaton is given by the user (for instance, a subset of the functi...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy: Chockler, H, Kesseli, P, Kroenig, D, Strichman, O
Format: Journal article
Język:English
Wydane: AI Access Foundation 2020