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)