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...
Главные авторы: | Chockler, H, Kesseli, P, Kroenig, D, Strichman, O |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
AI Access Foundation
2020
|
Схожие документы
-
Error Explanation with Distance Metrics
по: Groce, A, и др.
Опубликовано: (2006) -
Toward a Richer Language for Describing Software Errors
по: Levitin, Samuel M.
Опубликовано: (2008) -
Spoken Language Understanding Software for Language Learning
по: Hassan Alam, и др.
Опубликовано: (2008-04-01) -
A framework for Satisfiability Modulo Theories.
по: Kroening, D, и др.
Опубликовано: (2009) -
Efficient Computation of Recurrence Diameters
по: Kroening, D, и др.
Опубликовано: (2003)