Information Technology Reference
In-Depth Information
4. Walkinshaw, N., Bogdanov, K., Holcombe, M., Salahuddin, S.: Improving Dynamic
Software Analysis by Applying Grammar Inference Principles. Journal of Software
Maintenance and Evolution: Research and Practice (2008)
5. Claessen, K., Hughes, J.: Quickcheck: A Lightweight Tool for Random Testing of
Haskell Programs. In: Proceedings of the International Conference on Functional
Programming (ICFP), pp. 268-279 (2000)
6. Walkinshaw, N., Bogdanov, K., Ali, S., Holcombe, M.: Automated discovery of
state transitions and their functions in source code. Software Testing, Verification
and Reliability 18(2) (2008)
7. Moore, E.F.: Gedanken-experiments on sequential machines. In: Shannon, C.E.,
McCarthy, J. (eds.) Annals of Mathematics Studies (34), Automata Studies, pp.
129-153. Princeton University Press, Princeton (1956)
8. Nerode, A.: Linear automata transformations. Proceedings of the American Math-
ematical Society 9, 541-544 (1958)
9. Gold, E.: Language Identification in the Limit. Information and Control 10, 447-
474 (1967)
10. Biermann, A., Feldman, J.: On the Synthesis of Finite-State Machines from Sam-
ples of their Behavior. IEEE Transactions on Computers 21, 592-597 (1972)
11. Dupont, P., Lambeau, B., Damas, C., van Lamsweerde, A.: The QSM Algorithm
and its Application to Software Behavior Model Induction. Applied Artificial In-
telligence 22, 77-115 (2008)
12. Walkinshaw, N., Bogdanov, K., Holcombe, M., Salahuddin, S.: Reverse Engineering
State Machines by Interactive Grammar Inference. In: 14th IEEE International
Working Conference on Reverse Engineering, WCRE (2007)
13. Cook, J., Wolf, A.: Discovering Models of Software Processes from Event-Based
Data. ACM Transactions on Software Engineering and Methodology 7(3), 215-249
(1998)
14. Ammons, G., Bodık, R., Larus, J.: Mining Specifications. In: 29th SIGPLAN-
SIGACT Symposium on Principles of Programming Languages (POPL), Portland,
Oregon, pp. 4-16 (2002)
15. Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Informa-
tion and Computation 75, 87-106 (1987)
16. Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D.R.
(eds.) FM 2009. LNCS, vol. 5850, pp. 207-222. Springer, Heidelberg (2009)
17. Lang, K., Pearlmutter, B., Price, R.: Results of the Abbadingo One DFA Learning
Competition and a New Evidence-Driven State Merging Algorithm. In: Honavar,
V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1-12. Springer,
Heidelberg (1998)
18. Biermann, A.W., Krishnaswamy, R.: Constructing programs from example com-
putations. IEEE Trans. on Software Engineering SE 2, 141-153 (1976)
19. Cicchello, O., Kremer, S.: Inducing grammars from sparse data sets: A survey of
algorithms and results. Journal of Machine Learning Research 4, 603-632 (2003)
20. Cheng, K., Krishnakumar, A.: Automatic functional test generation using the ex-
tended finite state machine model. In: 30th ACM/IEEE Design Automation Con-
ference, pp. 86-91 (1993)
21. Walkinshaw, N., Bogdanov, K.: Inferring Finite-State Models with Temporal Con-
straints. In: Proceedings of the 23rd International Conference on Automated Soft-
ware Engineering, ASE (2008)
22. Paris, J., Arts, T.: Automatic testing of tcp/ip implementations using quickcheck.
In: Proceedings of the 8th ACM SIGPLAN workshop on Erlang, Erlang 2009, pp.
83-92. ACM, New York (2009)
