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...
Prif Awduron: | Chockler, H, Kesseli, P, Kroenig, D, Strichman, O |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
AI Access Foundation
2020
|
Eitemau Tebyg
-
Error Explanation with Distance Metrics
gan: Groce, A, et al.
Cyhoeddwyd: (2006) -
Toward a Richer Language for Describing Software Errors
gan: Levitin, Samuel M.
Cyhoeddwyd: (2008) -
Spoken Language Understanding Software for Language Learning
gan: Hassan Alam, et al.
Cyhoeddwyd: (2008-04-01) -
A framework for Satisfiability Modulo Theories.
gan: Kroening, D, et al.
Cyhoeddwyd: (2009) -
Efficient Computation of Recurrence Diameters
gan: Kroening, D, et al.
Cyhoeddwyd: (2003)