Incremental learning-based testing for reactive systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6706 LNCS, Issue , 2011, Pages 134-151

  Meinke, Karl ^a   Sindhu, Muddassar A ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TEST CASE GENERATION; BLACK-BOX TESTING; INCREMENTAL LEARNING; KRIPKE STRUCTURE; MODEL CHECKER; REACTIVE SYSTEM;

MODEL CHECKING; TEMPORAL LOGIC;

LEARNING ALGORITHMS;

EID: 79960247126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21768-5_11     Document Type: Conference Paper

References (18)

1. Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control 51(1), 76-87 (1981).
2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(1), 87-106 (1987). (Pubitemid 18535066)
3. Bohlin, T., Jonsson, B.: Regular inference for communication protocol entities. Technical Report 2008-024, Dept. of Information Technology, Uppsala University (2008).
4. Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NUSMV: A new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495-499. Springer, Heidelberg (1999).
5. Clarke, E., Gupta, A., Kukula, J., Strichman, O.: SAT based abstractionrefinement using ILP and machine learning techniques. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 265. Springer, Heidelberg (2002).
6. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999).
7. Dupont, P.: Incremental regular inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147. Springer, Heidelberg (1996).
8. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic Journal of the IGPL 14(5), 729-744 (2006). (Pubitemid 44964139)
9. Meinke, K.: Automated black-box testing of functional correctness using function approximation. In: ISSTA 2004: Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 143-153. ACM, New York (2004). (Pubitemid 41121386)
10. Meinke, K.: CGE: A sequential learning algorithm for Mealy automata. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 148-162. Springer, Heidelberg (2010).
11. Meinke, K., Niu, F.: A learning-based approach to unit testing of numerical software. In: Petrenko, A., Simão, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 221-235. Springer, Heidelberg (2010).
12. Meinke, K., Sindhu, M.: Correctness and performance of an incremental learning algorithm for Kripke structures. Technical report, School of Computer Science and Communication, Royal Institute of Technology, Stockholm (2010).
13. Meinke, K., Tucker, J.V.: Universal algebra. In: Handbook of Logic in Computer Science, 1st edn., pp. 189-411. Oxford University Press, Oxford (1993).
14. Norton, D.A.: Algorithms for testing equivalence of finite state automata, with a grading tool for jflap. Technical report, Rochester Institute of Technology, Department of Computer Science (2009).
15. Parekh, R.G., Nichitiu, C., Honavar, V.G.: A polynomial time incremental algorithm for regular grammar inference. In: Honavar, V.G., Slutzki, G. (eds.) ICGI.
16. Peled, D., Vardi, M.Y., Yannakakis, M.: Black-box checking. In: Formal Methods for Protocol Engineering and Distributed Systems FORTE/PSTV, pp. 225-240. Kluwer, Dordrecht (1999).
17. Raffelt, H., Steffen, B., Margaria, T.: Dynamic testing via automata learning. In: Yorav, K. (ed.) HVC 2007. LNCS, vol. 4899, pp. 136-152. Springer, Heidelberg (2008).
18. Walkinshaw, N., Bogdanov, K., Derrick, J., Paris, J.: Increasing functional coverage by inductive testing: a case study. In: Petrenko, A., Simão, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 126-141. Springer, Heidelberg (2010)