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...
Main Authors: | Chockler, H, Kesseli, P, Kroenig, D, Strichman, O |
---|---|
格式: | Journal article |
语言: | English |
出版: |
AI Access Foundation
2020
|
相似书籍
-
Error Explanation with Distance Metrics
由: Groce, A, et al.
出版: (2006) -
Toward a Richer Language for Describing Software Errors
由: Levitin, Samuel M.
出版: (2008) -
Spoken Language Understanding Software for Language Learning
由: Hassan Alam, et al.
出版: (2008-04-01) -
THEORY OF ANALYSIS OF ERRORS IN LEARNING FOREIGN LANGUAGE
由: I.A. Salata
出版: (2008-06-01) -
A framework for Satisfiability Modulo Theories.
由: Kroening, D, et al.
出版: (2009)