Databases Reference
In-Depth Information
gkTail and KLFA can represent constraints and recurrences on the values
that can be assigned to attributes, but cannot identify more complicated re-
lations that may occur in program behaviors. Adding such capabilities, for
instance by integrating static and dynamic analysis, is still an open research
direction.
Bibliography
[1] G. Ammons, R. Bodik, and J.R. Larus. Mining specications. In Pro-
ceedings of the 29th Symposium on Principles of Programming Languages.
ACM Press, 2002.
[2] J.H. Andrews and Y. Zhang. Broad-spectrum studies of log file anal-
ysis. In Proceedings of the 22nd International Conference on Software
Engineering, 2000.
[3] A. Biermann and J. Feldman. On the synthesis of finite state machines
from samples of their behavior. IEEE Transactions on Computer, 21:592{
597, June 1972.
[4] M. Broy, B. Jonsson, J.-P. Katoen, M. Leuckerand, and A. Pretschner,
editors. Model-Based Testing of Reactive Systems, volume 3472 of Lecture
Notes in Computer Science. Springer, 2005.
[5] Orlando Cicchello and Stefan C. Kremer. Inducing grammars from sparse
data sets: a survey of algorithms and results. Journal of Machine Learning
Research, 4:603{632, 2003.
[6] J.E. Cook and A.L. Wolf. Discovering models of software processes
from event-based data. ACM Transactions on Software Engineering and
Methodology, 7(3):215{249, 1998.
[7] V. Dallmeier, C. Lindig, A. Wasylkowski, and A. Zeller. Mining object
behavior with ADABU. In Proceedings of the International Workshop on
Dynamic Systems Analysis (WODA). ACM Press, 2006.
[8] M. El-Ramly, E. Stroulia, and P. Sorenson. Interaction-pattern min-
ing: extracting usage scenarios from run-time behavior traces. In ACM
SIGKDD International Conference on Knowledge Discovery and Data
Mining, 2002.
[9] M.D. Ernst, J. Cockrell, W.G. Griswold, and D. Notkin. Dynamically
discovering likely program invariants to support program evolution. IEEE
Transaction on Software Engineering, 27(2):99{123, February 2001.
Search WWH ::
Custom Search