On the correspondence between conformance testing and regular inference

Lecture Notes in Computer Science

Volumn 3442, Issue , 2005, Pages 175-189

  Berg, Therese ^a   Grinchtein, Olga ^a   Jonsson, Bengt ^a   Leucker, Martin ^b   Raffelt, Harald ^c   Steffen, Bernhard ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC TESTING; COMPUTER SCIENCE; EQUIVALENCE CLASSES; INFERENCE ENGINES; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

BLACK BOX SYSTEM; CONFORMANCE TESTING; CONJECTURE MODEL; FINITE STATE MACHINES;

FINITE AUTOMATA;

EID: 24644523009     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31984-9_14     Document Type: Conference Paper

References (18)

1. [Ang81] Dana Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51(1):76-87, 1981.
2. [Ang87] Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87-106, 1987.
3. [BDG97] José L. Balcázar, Josep Díaz, and Ricard Gavaldá. Algorithms for learning finite automata from queries: A unified view. In Advances in Algorithms, Languages, and Complexity, pages 53-72. Kluwer, 1997.
4. [Cho78] Tsun S. Chow. Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering, 4(3): 178-187, May 1978. Special collection based on COMPSAC.
5. +91] S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selection based on finite state models. IEEE Trans. on Software Engineering, 17(6):591-603, June 1991.
6. [Gol67] E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
7. [Gol78] E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37(3):302-320, 1978.
8. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 357-370. Springer Verlag, 2002.
9. th Int. Conf. on Fundamental Approaches to Software Engineering, volume 2306 of Lecture Notes in Computer Science, pages 80-95. Springer Verlag, 2002.
10. th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 315-327, 2003.
11. [LY96] D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - a survey. Proc. IEEE, 84(8):1090-1126, 1996.
12. [OG92] J. Oncina and P. García. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, volume 1 of Series in Machine Perception and Artificial Intelligence, pages 49-61. World Scientific, 1992.
13. [PVY99] Doron Peled, Moshe Y. Vardi, and Mihalis Yannakakis. Black box checking. In Jianping Wu, Samuel T. Chanson, and Qiang Gao, editors, Formal Methods for Protocol Engineering and Distributed Systems, FORTE/PSTV, pages 225-240, Beijing, China, 1999. Kluwer.
14. [RS93] R.L. Rivest and R.E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103:299-347, 1993.
15. [SD88] Krishan Sabnani and Anton Dahbura. A protocol test generation procedure. Computer Networks and ISDN Systems, 15(4):285-297, September 1988.
16. [SH03] Bernhard Steffen and Hardi Hungar. Behavior-based model construction. In VMCAI 2003: Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation, volume 2575 of Lecture Notes in Computer Science, pages 5-19. Springer-Verlag, 2003.
17. [Vas73] M. P. Vasilevski. Failure diagnosis of automata. Cybernetic, 9(4):653-665, 1973.
18. [VCI90] S.T. Vuong, W.Y.L. Chan, and M.R. Ito. The UIOv-method for protocol test sequence generation. In Proc. 2nd Int. Workshop on Protocol Test Systems, pages 161-176. North-Holland, 1990.