Model checking

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

Volumn 3472 LNCS, Issue , 2005, Pages 557-651

  Berg, Therese ^a   Raffelt, Harald ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECISION TREES; LEARNING ALGORITHMS; LEARNING SYSTEMS; LOGIC PROGRAMMING;

COMPUTATIONAL TREE LOGIC (CTL); DISCRIMINATION TREE ALGORITHMS; KRIPKE TRANSITION SYSTEMS; LINEAR TIME LOGIC (LTL);

MODEL CHECKING;

EID: 36949005206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11498490_25     Document Type: Conference Paper

References (483)

1. Paul Ammann and Paul E. Black. A specification-based coverage metric to evaluate test sets. In Proceedings of the 4th IEEE International Symposium on High-Assurance Systems Engineering (HASE 1999), pages 239-248. IEEE Computer Society Press, 1999. [352]
2. Paul Ammann, Paul E. Black, and William Majurski. Using model checking to generate tests from specifications. In Proceedings of the 2nd IEEE International Conference on Formal Engineering Methods (ICFEM 1998), pages 46-54. IEEE Computer Society Press, 1998. [352]
3. Samson Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225-241, 1987. [120, 123, 124, 126, 129, 131, 132]
4. J-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996. [343]
5. R. Alur, C. Courcoubetis, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
6. A preliminary version appeared in Guy Cohen, editor, Proceedings of 11th International Conference on Analysis and Optimization of Systems (ICAOS 1994): Discrete Event Systems, volume 199 of Lecture Notes in Control and Information Science, pages 331-351. Springer-Verlag, 1994. [375]
7. Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994. [201, 203, 204, 205, 212, 216, 360, 367, 371]
8. R. Alur, T. Dang, J. Esposito, R. Fierro, Y. Hur, F. Ivanč ić, V. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky. Hierarchical hybrid modeling of embedded systems. In T. A. Henzinger and C. M. Kirsch, editors, Proceedings of the 1st International Workshop on Embedded Software (EMSOFT 2001), volume 2211, pages 14-31. Springer-Verlag, 2001. [375, 376]
9. R. Alur, T. Dang, J. Esposito, Y. Hur, F. Ivančić, V. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky. Hierarchical hybrid modeling and analysis of embedded systems. Proceedings of the IEEE, 91(1):11-28, January 2003. [375, 376]
10. C. Artho, D. Drusinsky, A. Goldberg, K. Havelund, M. Lowry, C. Pasareanu, G. Roşu, and W. Visser. Experiments with test case generation and run-time analysis. In E. Borger, A. Gargantini, and E. Riccobene, editors, Proceedings of the 10th International Workshop on Abstract State Machines (ASM 2003), volume 2589 of Lecture Notes in Computer Science, pages 87-107, Taormina, Italy, 2003. Springer-Verlag. Invited paper. [552, 553]
11. A. Aho, A. Dahbura, D. Lee, and U. Uyar. An optimization technique for protocol conformance test generation based on uio sequences and rural chinese postman tours. IEEE Transactions on Communications, 39(11):1604-1615, November 1991. [70, 72, 101, 104]
12. Rajeev Alur, Limor Fix, and Thomas A. Henzinger. Event-clock automata: A determinizable class of timed automata. In Proceedings of the 16th International Conference on Computer-aided Verification (CAV 1994), volume 818 of Lecture Notes in Computer Science, pages 1-13. Springer-Verlag, 1994. [205, 206, 371]
13. AGEDIS homepage, http://www.agedis.de. [427]
14. Rajeev Alur, Radu Grosu, Insup Lee, and Oleg Sokolsky. Compositional refinement for hierarchical hybrid systems. In Maria Domenica Di Benedetto and Alberto L. Sangiovanni-Vincentelli, editors, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control (HSCC 2001), volume 2034 of Lecture Notes in Computer Science, pages 33-48. Springer-Verlag, 2001. [375, 376]
15. Roy Adler, L. Wayne Goodwyn, and Benjamin Weiss. Equivalence of topological Markov shifts. Israel Journal of Mathemtics, 27(1):49-63, 1977. [32]
16. Rajeev Alur and Thomas A. Henzinger. Real-time system = discrete system + clock variables. International Journal on Software Tools for Technology Transfer, 1(1-2):86-109, 1997. [201]
17. C. Artho, K. Havelund, and A. Biere. High-level data races. Software Testing, Verification and Reliability, 03(4):207-227, December 2003.
18. Extended version of a paper in P. T. Isaías, F. Sedes, J. C. Augusto, and U. Ultes-Nitsche, editors, New Technologies for Information Systems: Proceedings of the 3rd International Workshop on New Developments in Digital Libraries (NDDL 2003) and the 1st International Workshop on Validation and Verification of Software for Enterprise Information Systems (VVEIS 2003);
19. in conjunction with the 5th International Conference on Enterprise Information Systems, pages 82-93. ICEIS Press, 2003. [552, 553]
20. Pavel Atanassov, Stefan Haberl, and Peter Puschner. Heuristic worst-case execution time analysis. In Proceedings of the 10th European Workshop on Dependable Computing, pages 109-114. Austrian Computer Society (OCG), May 1999. [383]
21. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. [612, 613]
22. Rudie Alderden. COOPER - the compositional construction of a canonical tester. In Son T. Vuong, editor, Proceedings of the IFIP TC/WG6.1 2nd International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE 1989), pages 13-17, Vancouver, BC, Canada, 1990. North-Holland. [414, 417]
23. Rajeev Alur. Timed automata. In Nicolas Halbwachs and Doron Peled, editors, Proceedings of the 11th Internation Conference on Computer Aided Verification (CAV 1999), volume 1633 of Lecture Notes in Computer Science, pages 8-22. Springer-Verlag, 1999. [202, 204, 206]
24. Erika Ábrahám-Mumm, Ulrich Hannemann, and Martin Steffen. Verification of hybrid systems: Formalization and proof rules in PVS. In Proceedings of the 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), pages 48-57. IEEE Computer Society Press, 2001. [375]
25. Peter Amthor. Structural Decomposition of Hybrid Systems. Number 13 in Monographs of the Bremen Institute of Safe Systems. University of Bremen, 2000. [375]
26. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987. [582, 594, 599]
27. ASM homepage, http://www.eecs.umich.edu/gasm/. [412]
28. AsmL download, http://research.microsoft.com/fse/asml/. [412]
29. T. M. Austin. DIVA: A reliable substrate for deep submicron microarchitecture design. In Proceedings of the 32nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 1999), pages 196-207, November 1999. [527]
30. Tommaso Bolognesi and Ed Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks, 14:25-29, 1987. [120, 163, 417, 423]
31. Kirsten Berkenkötter, Stefan Bisanz, Ulrich Hannemann, and Jan Peleska. HybridUML profile for UML 2.0. In Proceedings of the Workshop on Specification and Validation of UML models for Real Time and Embedded Systems (SVERTS) in conjunction with the ((UML)) 2003 Conference, October 2003. Available at http://www-verimag.imag.fr/EVENTS/2003/SVERTS. [375, 376]
32. Gérard Berry and Laurent Cosserat. The ESTEREL synchronous programming language. In Stephen D. Brookes, A. W. Roscoe, and Glynn Winskel, editors, Proceedings of the Seminar on Concurrency, 1984, volume 197 of Lecture Notes in Computer Science, pages 389-448. Springer-Verlag, 1985. [395]
33. M. Bernardo and R. Cleaveland. A theory of testing for Markovian processes. In C. Palamidessi, editor, Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000), number 1877 in Lecture Notes in Computer Science, pages 305-319. Springer-Verlag, 2000. [234, 244, 256, 257, 263, 264, 265, 267, 268]
34. Dahananjay S. Brahme, Steven Cox, Jim Gallo, Mark Glasser, William Grundmann, C. Norris Ip, William Paulsen, John L. Pierce, John Rose, Dean Shea, and Karl Whiting. The transaction-based verification methodology. Technical report, Cadence Design Systems, Inc., August 2000. [455]
35. Simon Burton, John A. Clark, Andy J. Galloway, and John A. McDermid. Automated V&V for high integrity systems, a target formal methods approach. In C. Michael Holloway, editor, Proceedings of the 5th NASA Langley Formal Methods Workshop (Lfm 2000), number NASA/CP-2000-210100 in NASA Conference Publications, pages 129-140, 2000. [333]
36. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the International Conference on Very Large Scale Integration (VLSI 1991), volume A-1 of IFIP Transactions, pages 49-58, Edinburgh, Scotland, 1992. North-Holland. [567]
37. Simon Burton, John A. Clark, and John A. McDermid. Testing, proof and automation. An integrated approach. In Proceedings of the 1st International Workshop of Automated Program Analysis, Testing and Verification (WAPATV 2000), pages 57-63, 2000. In Conjunction with the 22nd International Conference on Software Engineering (ICSE 2000). [331]
38. Simon Burton, John A. Clark, and John A. McDermid. Automatic generation of tests from Statechart specifications. In Ed Brinksma and Jan Tretmans, editors, Proceedings of the 1st International Workshop on Formal Approaches to Testing of Software (FATES 2001), number BRICS NS-01-4 in Basic Research in Computer Science (BRICS) Notes Series, pages 31-46, 2001. [333]
39. J. R. Burch, E. M. Clarke, K. L. McMillan, and David L. Dill. Sequential circuit verification using symbolic model checking. In Proceedings of the 27th ACM/IEEE Conference on Design Automation Conference (DAC 1990), pages 46-51. ACM Press, 1990. [567]
40. O. Burkart, D. Caucal, F. Moller, and Bernhard Steffen. Verification on infinite structures. In S. Smolka J. Bergstra, A. Pons, editor, Handbook on Process Algebra. North-Holland, 2001. [560]
41. J. L. Balcázar, J. Díaz, R. Gavaldà, and O. Watanabe. The query complexity of learning DFA. New Generation Computing, 12:337-358, 1994. [599]
42. J. L. Balcázar, J. Díaz, R. Gavaldà, and O. Watanabe. Algorithms for learning finite automata from queries: A unified view. In Ding-Zhu Du, Ker-I Ko, and Dingzhu Du, editors, Advances in Algorithms, Languages, and Complexity. Kluwer Academic, February 1997. In Honor of Ronald V. Book. [577, 590, 595]
43. B. Beizer. Black-Box Testing. John Wiley & Sons, 1995. [498]
44. R. Bellman. Dynamic programming. Princeton University Press, 1957. [206]
45. A. Belinfante, J. Feenstra, R. G. de Vries, J. Tretmans, N. Goga, L. Feijs, S. Mauw, and L. Heerink. Formal test automation: A simple experiment. In G. Csopaki, S. Dibuz, and K. Tarnay, editors, Proceedings of the 12th International Workshop on Testing of Communicating Systems (IWTCS 1999), volume 147 of IFIP Conference Proceedings, pages 179-196. Kluwer Academic, 1999. [420, 424, 435, 438, 439, 443, 444, 446, 447, 448, 449, 456, 459]
46. Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Susanne Graf, Jean-Pierre Krimm, and Laurent Mounier. IF: An intermediate representation and validation environment for timed asynchronous systems. In Jeannette M. Wing, Jim Woodcock, and Jim Davies, editors, Proceedings of the World Congress on Formal Methods in the Development of Computing Systems, Volume I (FM 1999), volume 1708 of Lecture Notes in Computer Science, pages 307-327, Toulouse, France, 1999. Springer-Verlag. [419, 420]
47. D. Bartetzko, C. Fischer, M. Moller, and H. Wehrheim. Jass - Java with assertions. In Klaus Havelund and Grigore Rosu, editors, Runtime Verification (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. [555]
48. M. Bernardo and R. Gorrieri. Extended markovian process algebra. In U. Montanari and V. Sassone, editors, Proceedings of the 7th International Conference on Concurrency Theory (CONCUR 1996), volume 1119 of Lecture Notes in Computer Science, pages 315-330. Springer-Verlag, 1996. [242]
49. N. H. Bshouty, S. A. Goldman, T. R. Hancock, and S. Matar. Asking queries to minimize errors. Journal of Computer and Systems Science, 52:268-286, 1996. [599]
50. K. Bhargavan, C. A. Gunter, M. Kim, I. Lee, D. Obradovic, O. Sokolsky, and M. Viswanathan. Verisim: Formal analysis of network simulations. IEEE Transactions on Software Engineering, 28(2): 129-145, February 2002. [553]
51. Gilles Bernot, Marie-Claude Gaudel, and Bruno Marre. Software testing based on formal specifications: A theory and a tool. Software Engineering Journal, 6(6):387-405, 1991. [294, 334, 335]
52. Mike Barnett, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillman, and Margus Veanes. Towards a tool environment for model-based testing with AsmL. In Proceedings of the 3rd International Workshop on Formal Approaches to Testing of Software (FATES 2003), volume 2931 of Lecture Notes in Computer Science, pages 252-266. Springer-Verlag, 2003. [414]
53. Ferenc Belina and Dieter Hogrefe. The CCITT Specification and Description Language SDL. Computer Networks and ISDN Systems, 16(4):311-341, March 1989. [1]
54. Christel Baier, Holger Hermanns, Joost-Pieter Katoen, and Verena Wolf. Comparative branching time semantics for Markov chains. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR 2003), volume 2761 of Lecture Notes in Computer Science, pages 492-507. Springer-Verlag, 2003. [243, 271]
55. Stojan Bogdanović, Balázs Imreh, Miroslav Ćirić, and Tatjana Petković. Directable automata and their generalizations. Novi Sad Journal of Mathematics, 29(2):29-69, 1999. [6, 31]
56. R. Binder. Testing Object-Oriented Systems: Models, Patterns, and Tools. Addison Wesley, 1999. [281]
57. Therese Berg, Bengt Jonsson, Martin Leucker, and Mayank Saksena. Insights to Angluin's learning. In Proceedings of the International Workshop on Software Verification and Validation (SVV 2003), Electronic Notes in Theoretical Computer Science, December 2003. To appear. [597]
58. Johan Bengtsson, Kim G. Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. UPPAAL - A tool suite for automatic verification of real-time systems. In Proceedings of the 3rd DIMACS/SYCON Workshop on Hybrid Systems: Verification and Control, volume 1066 of Lecture Notes in Computer Science, pages 232-243. Springer-Verlag, October 1995. [222, 224]
59. Bluetooth Project, http://www.iti.uni-luebeck.de/Research/MUC/EKG/. [506]
60. Bluetooth Special Interest Group. Specification of the Bluetooth System (version 1.1). http://www.bluetooth.com. [506]
61. Béatrice Bérard, Antoine Petit, Volker Diekert, and Paul Gastin. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 36(2-3):142-182, November 1998. [204]
62. L. Boullier, M. Phalippou, and A. Rouger. Experimenting test selection strategies. In Proceedings of the 6th SDL Forum, 1993, pages 267-278. Elsevier Science Publishers, 1993. [200]
63. P. Berman and R. Roos. Learning one-counter languages in polynomial time. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science (FOCS 1987), pages 61-67, Los Alamitos, CA, 1987. IEEE Computer Society Press. [599]
64. E. Brinksma. A theory for the derivation of tests. In S. Aggarwal and K. Sabnani, editors, Proceedings of the 8th IFIP Symposium on Protocol Specification, Testing and Verification (PSTV 1988). North-Holland, 1989. [153, 154, 163, 199, 414, 415, 417]
65. Amar Bouali, Anni Ressouche, Valérie Roy, and Robert de Simone. The FCTOOLS user manual. Technical report, INRIA Sophia Antipolis, April 1996. [211]
66. Ed Brinksma, Arend Rensink, and Walter Vogler. Fair testing. In Insup Lee and Scott A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory (CONCUR 1995), volume 962 of Lecture Notes in Computer Science, pages 313-327. Springer-Verlag, 1995. [143, 144, 145]
67. R. E. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In Proceedings of the 22nd ACM/IEEE Design Automation Conference (DAC 1985), pages 688-694. IEEE Computer Society Press, June 1985. [398]
68. Mike Barnett and Wolfram Schulte. Spying on components: A runtime verification technique. In Proceedings of the OOPSLA 2001 Workshop on Specification and Verification of Component-Based Systems (SAVBS 2001), 2001. Published as Technical Report ISU TR #01-09a, Iowa State University. [531]
69. M. Broy and K. Stølen. Specification and Development of Interactive Systems - Focus on Streams, Interfaces, and Refinement. Springer-Verlag, 2001. [286]
70. J. R. Büchi. On a decision method in restricted second-order arithmetic. In E. Nagel, P. Suppes, and A. Tarski, editors, Proceedings of the 1st International Congress for Logic, Methodology, and Philosophy of Science (LMPS 1960), pages 1-12. Stanford University Press, 1962. [559, 567]
71. Simon Burton. Automated testing from Z specifications. Technical Report YCS-2000-329, University of York, 2000. [331, 333]
72. Simon Burton. Automated Generation of High Integrity Test Suites from Graphical Specifications. PhD thesis, University of York, March 2002. [331, 333]
73. Tommaso Bolognesi, Jeroen van de Lagemaat, and Chris Vissers, editors. LOTOSphere: Software Development with LOTOS. Kluwer Academic, 1995. [414]
74. Luciano Baresi and Michal Young. Test oracles. Technical Report CIS-TR-01-02, University of Oregon, Deptartment of Computer and Information Science, Eugene, Oregon, U.S.A., August 2001. [530]
75. Linda Christoff and Ivan Christoff. Efficient algorithms for verification of equivalences for probabilistic processes. In Kim Guldstrand Larsen and Arne Skou, editors, Proceedings of the 3rd International Conference on Computer Aided Verification (CAV 1991), volume 575 of Lecture Notes in Computer Science, pages 310-321. Springer-Verlag, 1991. [274]
76. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV Version 2: An opensource tool for symbolic model checking. In E. Brinksma and K. Guldstrand Larsen, editors, Proceedings of the 14th International Conference on Computer-Aided Verification (CAV 2002), volume 2404 of Lecture Notes in Computer Science, pages 359-364, Copenhagen, Denmark, July 2002. Springer-Verlag. [575]
77. Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh Jha, and Helmut Veith. Modular verification of software components in C. In Proceedings of the 25th International Conference on Software Engineering (ICSE 2003), pages 385-395. IEEE Computer Society Press, 2003. [325]
78. CEPSCO. GSM 11.11, Digital cellular telecommunications systems (phase2+); Specifications of the subscriber identity module - mobile equipment (SIM-ME) interface (GSM 11.11), 1995. [444]
79. CEPSCO. Common electronic purse specification: Technical specification, 2000. http://www.cepsco.org. [444]
80. Ján Černý. Poznámka k. homogénnym experimentom s konecnými automatmi. Matematicko-fysikalny Casopis SAV, 14:208-215, 1964. [19, 31]
81. M. Clatin, R. Groz, M. Phalippou, and R. Thummel. Two approaches linking test generation with verification techniques. In A. Cavalli and S. Budkowski, editors, Proceedings of the 8th International Workshop on Protocol Test Systems (IWPTS 1996). Chapman & Hall, 1996. [200, 410, 411, 412]
82. Albert M. K. Cheng. Real-Time Systems; Scheduling, Analysis, and Verification. John Wiley & Sons, 2002. [360]
83. Tsun S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3):178-187, May 1978.
84. Special collection based on the 2nd International Computer Software and Applications Conference (COMPSAC 1978). [94, 96, 108, 110, 111, 159, 220, 370, 593, 599]
85. Ivan Christoff. Testing equivalences and fully abstract models for probabilistic processes. In Proceedings of the 1st International Conference on Concurrency Theory (CONCUR 1990), volume 458 of Lecture Notes in Computer Science, pages 126-140. Springer-Verlag, 1990. [233, 244, 246, 249, 264, 265, 267, 268]
86. Zhou Chaochen, Wang Ji, and Anders P. Ravn. A formal description of hybrid systems. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the DIMACS/SYCON 1995 Workshop on Hybrid Systems III: Verification and Control, volume 1066 of Lecture Notes in Computer Science, pages 511-530. Springer-Verlag, 1996. [375]
87. Duncan Clarke, Thierry Jéron, Vlad Rusu, and Elena Zinovieva. Automated test and oracle generation for Smart-Card applications. In Smart Card Programming and Security. Proceedings of the International Conference on Research in Smart Cards (E-smard 2001), volume 2140 of Lecture Notes in Computer Science, pages 58-70. Springer-Verlag, 2001. [424, 427, 439, 444, 446, 447, 448, 449, 450, 456, 458, 459]
88. D. Clarke, T. Jéron, V. Rusu, and E. Zinovieva. STG: A symbolic test generation tool. In Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2002), volume 2280 of Lecture Notes in Computer Science, pages 470-475. Springer-Verlag, 2002. [424, 426, 427]
89. H. Cho, S.-W. Jeong, F. Somenzi, and C. Pixley. Multiple observation time single reference test generation using synchronizing sequences. In Proceedings of the European Conference on Design Automation (EDAC 1993) with the European Event in ASIC Design, pages 494-498. IEEE Computer Society Press, February 1993. [7, 32]
90. Karel Culik, Juhani Karhumäki, and Jarkko Kari. A note on synchronized automata and road coloring problem. In Werner Kuich, Grzegorz Rozenberg, and Arto Salomaa, editors, Proceedings of the 5th International Conference on Developments in Language Theory (DLT 2001), volume 2295 of Lecture Notes in Computer Science, pages 175-185. Springer-Verlag, 2002. [6, 32]
91. Duncan Clarke and Insup Lee. Testing real-time constraints in a process algebraic setting. In Proceedings of the 17th International Conference on Software Engineering (ICSE 1995), pages 51-60. ACM Press, 1995. [364]
92. Duncan Clarke and Insup Lee. Automatic generation of tests for timing constraints from requirements. In Proceedings of the 3rd International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 1997), pages 199-206. IEEE Computer Society Press, 1997. [364]
93. Duncan Clarke and Insup Lee. Automatic test generation for the analysis of a real-time system: Case study. In Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS 1997), pages 112124. IEEE Computer Society Press, 1997. [364, 366]
94. Lori A. Clarke. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering, SE-2(3):215-222, September 1976. [339, 343]
95. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, Cambridge, MA, 2 edition, 2001. [16]
96. Rachel Cardell-Oliver. Conformance tests for real-time systems with timed automata specifications. Formal Aspects of Computing, 12(5):350-371, 2000. [221, 224, 228, 229, 230, 367]
97. Rachel Cardell-Oliver and Tim Glover. A practical and complete algorithm for testing real-time systems. In A. P. Ravn and H. Rischel, editors, Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1998), volume 1486 of Lecture Notes in Computer Science, pages 251-261. Springer-Verlag, 1998. [221, 228]
98. S. Cohen. JTrek. Compaq, http://www.compaq.com/java/download/jtrek. [542]
99. S. Barbey C. Peraire and D. Buchs. Test selection for object-oriented software based on formal specifications. In D. Gries and W. P. de Roever, editors, Proceedings of the International Conference on Programming Concepts and Methods (PROCOMET 1998), volume 125 of IFIP Conference Proceedings, pages 385-403. Chapman and Hall, 1998. [348]
100. P. Caspi, D. Pilaud, N. Halbwachs, and J. A. Plaice. LUSTRE: A declarative language for programming synchronous systems. In Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages (POPL 1987), pages 178-188, Munich, Germany, January 21-23, 1987. ACM SIGACT-SIGPLAN, ACM Press. [395]
101. Ján Černý, Alica Pirická, and Blanka Rosenauerová. On directable automata. Kybernetika, 7(4):289-298, 1971. [6, 31]
102. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based verification tool for finite state systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(1):36-72, January 1993. [575]
103. Ranee Cleaveland and Bernhard Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In Kim G. Larsen and Arne Skou, editors, Proceedings of the 3rd Conference on Computer Aided Verification (CAV 1991), volume 575, pages 48-58, Berlin, Germany, 1992. Springer-Verlag. [566]
104. J. Callahan, F. Schneider, and S. Easterbrook. Specification-based testing using model checking. In Proceedings of the 2nd SPIN Workshop 1996, pages 193-207, 1996. [352]
105. R. Cleaveland, S. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP 1992), volume 623 of Lecture Notes in Computer Science, pages 708-719. Springer-Verlag, 1992. [233, 244, 246, 251, 262, 265, 267]
106. K. Drira, P. Azéma, and F. Vernadat. Refusal graphs for conformance tester generation and simplification: A computational framework. In A. Danthine, G. Leduc, and P. Wolper, editors, Proceedings of the 8th International Symposium on Protocol Specification, Testing and Verification (PSTV 1993), volume C-16 of IFIP Transactions, pages 257-272. North-Holland, 1993. [168, 170, 171]
107. Gordon B. Davis. Anytime/anyplace computing and the future of knowledge work. Communications of the ACM, 45(12):67-73, December 2002. [525]
108. Julia Dushina, Mike Benjamin, and Daniel Geist. Semi-formal test generation with Genevieve. In Proceedings of the Design Automation Conference (DAC 2001), pages 617-622. ACM Press, 2001. [439, 443, 445, 447, 448, 449, 450, 454, 455, 456, 457, 459]
109. Lydie du Bousquet, Farid Ouabdesselam, Jean-Luc Richier, and N. Zuanon. Lutess: A specification-driven testing environment for synchronous software. In Proceedings of the 21st International Conference on Software Engineering (ICSE 1999), pages 267-276. ACM Press, 1999. [394, 395, 396, 398]
110. L. du Bousquet, S. Ramangalahy, S. Simon, C. Viho, A. Belinfante, and R. G. de Vries. Formal test automation: The conference protocol with TGV/Torx. In H. Ural, R. L. Probert, and G. von Bochmann, editors, Proceedings of the IFIP 13th International Conference on Testing of Communicating Systems (TestCom 2000), volume 176 of IFIP Conference Proceedings, pages 221-228. Kluwer Academic, 2000. [420, 421, 424, 435, 438, 444]
111. L. du Bousquet and N. Zuanon. An overview of Lutess, a specification-based tool for testing synchronous software. In Proceedings of the 14th IEEE International Conference on Automated Software Engineering (ASE 1999), pages 208-215. IEEE Computer Society Press, October 1999. [435]
112. Richard Denney. Test-case generation from Prolog-based specifications. IEEE Software, 8(2):49-57, 1991. [334, 336]
113. Jeremy Dick and Alain Faivre. Automating the generation and sequencing of test cases from model-based specifications. In Jim C. P. Woodcock and Peter G. Larsen, editors, Proceedings of the 1st International Symposium of Formal Methods Europe: Industrial-Strength Formal Methods (FME 1993), volume 670 of Lecture Notes in Computer Science, pages 268-284. Springer-Verlag, 1993. [328]
114. S. Dudani, J. Geada, G. Jakacki, and D. Vainer. Dynamic assertions using TXP. In K. Havelund and G. Roşu, editors, Proceedings of the 1st Workshop on Run-time Verification (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. [555]
115. Z. R. Dai, J. Grabowski, and H. Neukirchen. Timed TTCN-3 - A Real-Time Extension for TTCN-3. In I. Schieferdecker, H. König, and A. Wolisz, editors, Testing of Communicating Systems, volume 14, Berlin, March 2002. Kluwer Academic. [505]
116. Z. R. Dai, J. Grabowski, H. Neukirchen, and H. Pals. From design to test with UML. In R. Groz and R. Hierons, editors, Proceedings of the 16th IFIP International Conference on Testing of Communication Systems (TestCom 2004), Lecture Notes in Computer Science, pages 33-49. Springer-Verlag, March 2004. [497]
117. F. Drewes and J. Högberg. Learning a regular tree language from a teacher. In Z. Ésik and Z. Fülöp, editors, Proceedings of the 7th International Conference on Developments in Language Theory (DLT 2003), volume 2710 of Lecture Notes in Computer Science, pages 279-291. Springer-Verlag, 2003. [599]
118. F. Drewes and J. Högberg. Learning a regular tree language from a teacher even more efficiently. Technical Report 03.11, Umeâ University, 2003. [599]
119. M. Ducasse and E. Jahier. Efficient automated trace analysis: Examples with morphine. In K. Havelund and G. Rosu, editors, Proceedings of the 1st Workshop on Runtime Verification (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. [555]
120. Michel Diaz, Guy Juanole, and Jean-Pierre Courtiat. Observer - a concept for formal on-line validation of distributed systems. IEEE Transactions on Software Engineering, 20(12) :900-913, 1994. [531]
121. J. Duran and S. C. Ntafos. An Evaluation of Random Testing. IEEE Transactions on Software Engineering, SE-10(4):438-444, July 1984. [302, 303, 306, 307, 308]
122. Rocco de Nicola. Extensional equivalences for transition systems. Acta Informatica, 24:211-237, 1987. [127, 147]
123. Rocco de Nicola and Matthew Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984. [123, 133, 134, 233, 258, 265]
124. Jim Davies and Steve Schneider. A brief history of timed CSP. Theoretical Computer Science, 138(2):243-271, 1995. [360]
125. D. Drusinsky and M. T. Shing. Monitoring temporal logic specifications combined with time series constraints. Journal of Universal Computer Science, 9(11):1261-1276, November 2003. [530]
126. M. Ducasse. Opium: An extendable trace analyser for Prolog. The Journal of Logic Programming, 39:177-223, 1990. [555]
127. M. Ducasse. Coca: An automated debugger for C. In Proceedings of the 21st International Conference on Software Engineering (ICSE 1999), pages 504-513. ACM Press, 1999. [555]
128. René G. de Vries, Axel Belinfante, and Jan Feenstra. Automated testing in practice: The highway tolling system. In Ina Schieferdecker, Harmut König, and Adam Wolisz, editors, Proceedings of the IFIP 14th International Conference on Testing Communicating Systems (TestCom 2002), volume 210 of IFIP Conference Proceedings, pages 219-234. Kluwer Academic, 2002. [420, 424]
129. R. G. de Vries and J. Tretmans. On-the-fly conformance testing using SPIN. In G. Holzmann, E. Najm, and A. Serhrouchni, editors, Proceedings of the 4th Workshop on Automata Theoretic Verification with the SPIN Model Checker (SPIN 1998), number 98 S 002 in ENST Technical Report, pages 115-128, Paris, France, November 1998. Ecole Nationale Supérieure des Télécommunications. [200, 423, 424]
130. Michael D. Ernst, Jake Cockrell, William G. Griswold, and David Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering, 27(2):99-123, February 2001. [548, 549, 550, 554, 555]
131. EClipse. http://www.eclipse.org/. [502]
132. Eclipse constraint logic programming system. http://www.icparc.ic.ac.uk/ eclipse. [405]
133. E.H. Eertink. Simulation Techniques for the Validation of LOTOS Specifications. PhD thesis, University of Twente, Enschede, Netherlands, March 1994. [423, 424]
134. A. Engels, L. Feijs, and S. Mauw. Test generation for intelligent networks using model checking. In Ed Brinksma, editor, Proceeedings of the 3rd International Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS 1997), volume 1217 of Lecture Notes in Computer Science, pages 384-398. Springer-Verlag, 1997. [352]
135. Michael D. Ernst, William G. Griswold, Yoshio Kataoka, and David Notkin. Dynamically discovering pointer-based program invariants. Technical Report UW-CSE-99-11-02, University of Washington, Seattle, WA, November 1999. [550]
136. K. Etessami and G. J. Holzmann. Optimizing Büchi automata. In C. Palamidessi, editor, Proceedings of 11th International Conference on Concurrency Theory (CONCUR 2000), volume 1877 of Lecture Notes in Computer Science, pages 153-167. Springer-Verlag, 2000. [567]
137. J. Edmonds and E. L. Johnson. Matching, Euler tours and the chinese postman. Mathematical Programming, 5:88-124, 1973. [92]
138. E. Allen Emerson and Chin-Laung Lei. Modalities for model checking (extended abstract): Branching time strikes back. In Conference Record of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 1985), pages 84-96. ACM Press, 1985. [565]
139. David Eppstein. Reset sequences for monotonie automata. SIAM Journal on Computing, 19(3):500-510, June 1990. [6, 7, 16, 25, 31, 32]
140. E. H. Eertink and D. Wolz. Symbolic Execution of LOTOS Specifications. In M. Diaz and R. Groz, editors, Proceedings of the 5th International Conference on Formal Description Techniques (FORTE 1992), pages 295-310. North-Holland, 1992. [423, 424]
141. W. Feller. An Introduction to Probability Theory and Its Applications. John Wiley and Sons, 1968. [236]
142. J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A protocol validation and verification toolbox. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the 8th International Conference on Computer Aided Verification (CAV 1996), volume 1102 of Lecture Notes in Computer Science, pages 437-440. Springer-Verlag, 1996. [417, 419, 420, 423, 424]
143. J.-C. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodriguez, and J. Sifakis. A toolbox for the verification of LOTOS programs. In Proceedings of the 14th International Conference on Software Engineering (ICSE 1992), pages 246-259. ACM Press, 1992. [575]
144. Eitan Farchi, Alan Hartman, and Shlomit Pinter. Using a model-based test generator to test for standard conformance. IBM Systems Journal, 41(1):89-110, 2002. [439, 444, 446, 447, 448, 449, 450, 454, 456, 457, 458, 459]
145. A. Schmidt F. Huber, B. Schätz and K. Spies. Autofocus - A tool for distributed systems specification. In Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1996), volume 1135 of Lecture Notes in Computer Science, pages 467-470. Springer-Verlag, 1996. [343]
146. J.-C. Fernandez, C. Jard, T. Jéron, and G. Viho. Using on-the-fly verification techniques for the generation of test suites. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the 8th International Conference on Computer Aided Verification (CAV 1996), volume 1102 of Lecture Notes in Computer Science, pages 348-359, New Brunswick, NJ, USA, 1996. Springer-Verlag. [294, 417]
147. D. Freitag and N. Kushmerick. Boosted wrapper induction. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000) and 12th Conference on Innovative Applications of Artificial Intelligence (IAAI 2000), Austin, Texas, August 2000. American Association for Artificial Intelligence, The AAAI Press. Copublished and distributed by The MIT Press. [550]
148. Lauret Fournier, Anatoly Koyfman, and Moshe Levinger. Developing an architecture validation suite - application to the PowerPC architecture. In Proceedings of the 36th ACM Design Automation Conference (DAC 1999), pages 189-194. ACM Press, 1999. [439, 443, 446, 447, 448, 449, 451, 456, 457, 460]
149. Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie. Efficient learning of typical finite automata from random walks. In Proceedings of the 25th ACM Symposium on the Theory of Computing (STOC 1993), pages 315-324, New York, NY, 1993. ACM Press. [599]
150. Apache Software Foundation. Byte code engineering library (BCEL). http://jakarta.apache.org/bcel/, 2003. Subproject of Jakarta. [530]
151. France Telecom R&D website, http://www.rd.francetelecom.com/. [410]
152. Joel Friedman. On the road coloring problem. Proceedings of the American Mathematical Society, 110(4):1133-1135, December 1990. [6]
153. S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selection based on finite state models. IEEE Transactions on Software Engineering, 17(6):591-603, June 1991. [96, 98, 101]
154. P. G. Frankl and E. J. Weyuker. An applicable family of data flow testing criteria. IEEE Transactions on Software Engineering, SE-14:1483-1498, October 1988. [297, 300]
155. P. G. Frankl and E. J. Weyuker. A formal analysis of the fault-detecting ability of testing methods. IEEE Transactions on Software Engineering, 19(3):202-213, 1993. [310]
156. Hubert Garavel. OPEN/CAESAR: An open software architecture for verification, simulation, and testing. In B. Steffen, editor, Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 1998), volume 1384 of Lecture Notes in Computer Science, pages 68-84. Springer-Verlag, 1998. [419, 420, 423, 424]
157. M. Geilen. On the construction of monitors for temporal logic properties. In K. Havelund and G. Roşu, editors, Proceedings of the 1st International Workshop on Run-time Verification (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. [555]
158. John B. Goodenough and Susan L. Gerhart. Toward a theory of test data selection. IEEE Transactions on Software Engineering, 1(2):156-173, June 1975. [88]
159. Matthias Grochtmann and Klaus Grimm. Classification trees for partition testing. Software Testing, Verification and Reliability, 3(2):63-82, 1993. [330]
160. Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, and Margus Veanes. Generating finite state machines from abstract state machines. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA 2002), pages 112-122. ACM Press, 2002. [414]
161. A. Gargantini and C. Heitmeyer. Using model checking to generate tests from requirements specifications. In O. Nierstrasz and M. Lemoine, editors, Proceedings of the 7th European Software Engineering Conference, held Jointly with the 7th ACM SIGSOFT Symposium on the Foundations of Software Enigneegin (ESEC/FSE 1999), volume 1687 of Lecture Notes in Computer Science, pages 146-163. Springer-Verlag, 1999. [352]
162. A. Goldberg and K. Havelund. Instrumentation of java bytecode for runtime analysis. In S. Eisenbach, G. T. Leavens, Peter Müller, A. Poetzsch-Heffter, and E. Poll, editors, Proceedings of the 5th ECOOP Workshop on Formal Techniques for Java-like Programs (FTfJP 2003), pages 151-159, July 2003. Technical Report tr_408, ETH Zürich. [530]
163. Q. Guo, R. M. Hierons, M. Harman, and K. Derderian. Computing unique input/output sequences using genetic algorithms. In A. Petrenko and A. Ulrich, editors, Proceedings of the 3rd International Workshop on Formal Approaches to Testing of Software (FATES 2003), volume 2931 of Lecture Notes in Computer Science, pages 164-177. Springer-Verlag, 2004. [84, 86]
164. N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras. In Lorenzo Donatiello and Randolph D. Nelson, editors, Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance 1993 and Sigmetrics 1993, volume 729 of Lecture Notes in Computer Science, pages 121-146. Springer-Verlag, 1993. [242]
165. Arthur Gill. State-identification experiments in finite automata. Information and Control, 4(2-3): 132-154, September 1961. [12, 24, 30, 36]
166. Seymour Ginsburg. On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. Journal of the ACM (JACM), 5(3):266-280, July 1958. [8, 13, 30]
167. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York, 1979. [25, 28]
168. O. Grinchtein, B. Jonsson, and M. Leucker. Learning of event-recording automata. Technical report, Uppsala University, 2004. [597, 599]
169. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. The Sunsoft Press Java Series. Addison-Wesley, New York, 1997. [444]
170. Hubert Garavel and Frédéric Lang. NTIF: A general symbolic model for communicating sequential processes with data. In Doron Peled and Moshe Y. Vardi, editors, Proceedings on the 22nd IFIP/WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2002), volume 2529 of Lecture Notes in Computer Science, pages 276-291, Houston, Texas, USA, November 2002. Springer-Verlag. Full version available as INRIA Research Report RR-4666. [426, 427]
171. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of the 13th Conference on Computer Aided Verification (CAV 2001), volume 2102 of Lecture Notes in Computer Science, pages 53-65. Springer-Verlag, 2001. [567]
172. Nicolae Goga. Comparing TorX, Autolink, TGV and UIO test algorithms. In Rick Reed and Jeanne Reed, editors, Meeting UML - Proceedings of the 10th International SDL Forum, 2001, volume 2078 of Lecture Notes in Computer Science, pages 379-402. Springer-Verlag, 2001. [433, 434]
173. Wolf Göhring. Minimal initializing word: a contribution to Černý's conjecture. Journal of Automata, Languages and Combinatorics, 2(4):209-226, 1998. [6, 31]
174. David E. Goldberg. Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, 1989. [383]
175. L. Gong. JXTA: A network programming environment. IEEE Internet Computing, 5(3):88-95, May/June 2001. [528]
176. A. Groce, D. Peled, and M. Yannakakis. Adaptive model checking. In J.-P. Katoen and P. Stevens, editors, Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2002), volume 2280 of Lecture Notes in Computer Science, pages 357-370. Springer-Verlag, 2002. [599, 601, 602]
177. A. Q. Gates, S. Roach, O. Mondragon, and N. Delgado. DynaMICs: Comprehensive support for run-time monitoring. In K. Havelund and G. Rosu, editors, Proceedings of the 1st International Workshop on Runtime Verification (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. [555]
178. A. Gargantini, E. Riccobene, and S. Rinzivillo. Using Spin to generate tests from ASM specifications. In E. Borger, A. Gargantini, and E. Riccobene, editors, Proceedings of the 10th International Workshop on Abstract State Machines (ASM 2003), volume 2589 of Lecture Notes in Computer Science, pages 263-277. Springer-Verlag, 2003. [352]
179. F. Gruenberger. Computers and communication: Toward a computer utility. Prentice-Hall, 1968. [554]
180. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Proceedings of the 9th International Conference on Computer Aided Verification (CAV 1997), volume 1254 of Lecture Notes in Computer Science, pages 72-83, Haifa, Israel, 1997. Springer-Verlag. [287]
181. Jens Grabowski, Rudolf Scheuer, Zhen Ru Dai, and Dieter Hogrefe. Applying SAMSTAG to the B-ISDN protocol SSCOP. In M. Kim, S. Kang, and K. Hong, editors, Proceedings of the 10th International Workshop on Testing of Communication Systems (IWTCS 1997). Chapman & Hall, 1997. [431, 433]
182. D. F. Gordon, W. M. Spears, O. Sokolsky, and Insup Lee. Distributed spatial control, global monitoring and steering of mobile physical agents. In Proceedings of the IEEE International Conference on Information, Intelligence, and Systems (ICIIS 1999), pages 681-688. IEEE Computer Society Press, November 1999. [553]
183. Yuri Gurevich. Evolving algebras 1993: Lipari Guide. In Egon Borger, editor, Specification and Validation Methods, pages 9-37. Oxford University Press, 1994. [1, 412, 414]
184. W. Gutjahr. Partition testing versus random testing: The influence of uncertainty. IEEE Transactions on Software Engineering, 25(5):661-674, 1999. [302, 308]
185. Mathias Grochtmann and Joachim Wegener. Evolutionary testing of temporal correctness. In Proceedings of the 2nd Software Quality Week Europe (QWE 1998), Brüssel, Belgium, 1998. [383]
186. David Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231-274, June 1987. [1]
187. Jerry J. Harrow, Jr. Runtime checking of multithreaded applications with visual threads. In K. Havelund, J. Penix, and W. Visser, editors, SPIN Model Checking and Software Verification: Proceedings of the 7th International SPIN Workshop, 2000, volume 1885 of Lecture Notes in Computer Science, pages 331-342. Springer-Verlag, 2000. [533]
188. Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg Sokolsky, and Hasan Ural. Data flow testing as model checking. In Proceedings of the 25th International Conference on Software Engineering (ICSE 2003), pages 232-242. IEEE Computer Society Press, 2003. [352]
189. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language LUSTRE. Proceedings of the IEEE, 79(9):1305-1320, September 1991. [394, 395]
190. F. C. Hennie. Fault detecting experiments for sequential circuits. In Proceedings of the 5th Annual Symposium on Switching Circuit Theory and Logical Design, pages 95-110, Princeton, New Jersey, 11-13 November 1964. IEEE Computer Society Press. [24, 101, 104]
191. M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, 1988. [183]
192. Thomas A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science (LICS 1996), pages 278-292. IEEE Computer Society Press, 1996. [375]
193. L. Heerink, J. Feenstra, and J. Tretmans. Formal Test Automation: The Conference Protocol with PHACT. In H. Ural, R. L. Probert, and G. von Bochmann, editors, Proceedings of the 13th IFIP International Conference on Testing of Communicating Systems (TestCom 2000), pages 211-220. Kluwer Academic, 2000. [410, 435, 437, 444]
194. R. H. Hardin, Zvi Har'El, and Robert P. Kurshan. COSPAN. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the 8th International Conference on Computer Aided Verification (CAV 1996), volume 1102 of Lecture Notes in Computer Science, pages 423-427. Springer-Verlag, 1996. [575]
195. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: A model checker for hybrid systems. Sotftware Tools for Technology Transfer, 1(1-2):110-122, 1997. [426, 427]
196. Thomas N. Hibbard. Least upper bounds on minimal terminal state experiments for two classes of sequential machines. Journal of the ACM (JACM), 8(4):601-612, October 1961. [8, 14, 21, 30]
197. Jane Hillston. A compositional approach to performance modelling. Cambridge University Press, 1996. [242]
198. Wai-Ming Ho, Jean-Marc Jézéquel, Alain Le Guennec, and François Pennaneac'h. UMLAUT: An extendible UML transformation framework. In Proceedings of the 14th IEEE International Conference on Automated Software Engineering (ASE 1999), pages 275-278, Florida, 1999. IEEE Computer Society Press. [419, 420]
199. C. Heitmeyer, R. Jeffords, and B. Labaw. Automated Consistency Checking of Requirements Specifications. ACM Transactions on Software Engineering and Methodology, 5(3):231-261, July 1996. [1]
200. John Hakansson, Bengt Jonsson, and Ola Lundqvist. Generating on-line test oracles from temporal logic specifications. International Journal on Software Tools for Technology Transfer, 4(4):456-471, 2003. [555]
201. Z. Har'El and R. P. Kurshan. COSPAN User Guide. AT&T Bell Laboratories, October 1987. [575]
202. Thomas A. Henzinger, Peter W. Kopke, and Howard Wong-Toi. The expressive power of clocks. In Automata, Languages and Programming, volume 944 of Lecture Notes in Computer Science, pages 417-428. Springer-Verlag, 1995. [203]
203. Sudheendra Hangal and Monica S. Lam. Tracking down software bugs using automatic anomaly detection. In Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), pages 291-301. ACM Press, 2002. [551, 552, 554]
204. R. Hightower and N. Lesiecki. Java Tools for eXtreme Programming. Wiley Computer Publishing. John Wiley & Sons, 2002. [501]
205. H. S. Hong, I. Lee, O. Sokolsky, and H. Ural. A temporal logic based theory of test coverage and generation. In J.-P. Katoen and P. Stevens, editors, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2002), volume 2280 of Lecture Notes in Computer Science, pages 327-341. Springer-Verlag, 2002. [352]
206. M. Henessy and R. Milner. Observing nondeterminism and concurrency. In J. de Bakker and M. van Leeuwen, editors, Proceedings of the 7th International Colloquium on Automata, Languages, and Programming (ICALP 1980), volume 85 of Lecture Notes in Computer Science, pages 299-309. Springer-Verlag, 1980. [129]
207. Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, 1985. [271, 565]
208. Michael Harder, Jeff Mellen, and Michael D. Ernst. Improving test suites via operational abstraction. In Proceedings of the 25th International Conference on Software Engineering (ICSE 2003), pages 60-71, Portland, Oregon, 2003. IEEE Computer Society Press. [548]
209. Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. What good are digital clocks? In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming (ICALP 1992), volume 632 of Lecture Notes in Computer Science, pages 545-558. Springer-Verlag, 1992. [201]
210. M. Hennessy and R. De Nicola. Testing equivalences for processes. In Proceedings of the 10th Interantional Colloquium on Automata, Languages and Programming (ICALP 1983), 1983. [114, 208, 210]
211. A. Hartman and K. Nagin. TCBeans, software test toolkit. In Proceedings of the 12th International Software Quality Week (QW 1999), 1999. [445, 450]
212. Steffen Heike, Thomas Ne-stupny, and Thomas Santen. Automating test case generation from Z specifications with Isabelle. In Jonathan P. Bowen, Michael G. Hinchey, and David Till, editors, Proceedings of the 10th International Conference of Z Users: The Z Formal Specification Notation (ZUM 1997), volume 1212 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1997. [327, 328, 329, 330, 331]
213. H. Hungar, O. Niese, and B. Steffen. Domain-specific optimization in automata learning. In W. A. Hunt Jr. and F. Somenzi, editors, Proceedings of the 15th International Conference on Computer Aided Verification (CAV 2003), Lecture Notes in Computer Science, pages 315-327. Springer-Verlag, 2003. [595, 597]
214. Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic model checking for real-time systems. In Proceedings of the 7th Symposium of Logics in Computer Science (LICS 1992), pages 394-406, Santa Cruz, California, 1992. IEEE Computer Scienty Press. [203]
215. C. A. R. Hoare. Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall, 1985. [360]
216. Gerard J. Holzmann. Design and Validation of Protocols. Prentice-Hall Software Series, 990157918X. Prentice-Hall, Englewood Cliffs, N.J., 1991. [3, 91, 92, 423]
217. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997. [575]
218. G. Holzmann. From code to models. In Proceedings of the 2nd International Conference on Applications of Concurrency to System Design (ACSD 2001), pages 3-10. IEEE Computer Society Press, 2001. [287]
219. J. E. Hopcroft. An nlogn algorithm for minimizing states in a finite automaton. In Z. Kohavi and A. Paz, editors, Proceedings of the International Symposium on Theory of Machines and Computations, 1971, pages 189-196, New York, 1971. Academic Press. [65, 66, 612, 613]
220. W. Howden. Symbolic testing and the dissect symbolic evaluation system. IEEE Trans. on Software Engineering, SE-3(4):266-278, July 1977. [343]
221. G. Hahn, J. Philipps, A. Pretschner, and T. Stauner. Prototype-based tests for hybrid reactive systems. In Proceedings of the 14th IEEE International Workshop on Rapid System Prototyping (RSP 2003), pages 78-86. IEEE Computer Society Press, 2003. [378, 379, 380]
222. G. Hahn, J. Phillips, A. Pretschner, and T. Stauner. Tests for mixed discrete-continuous reactive systems. Technical Report TUM-I0301, Institut für Informatik, TU München, 2003. [378]
223. K. Havelund and G. Roşu. Monitoring Java programs with Java PathExplorer. In K. Havelund and G. Roşu, editors, Proceedings of the 1st Workshop on Runtime Verificaton (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. [555]
224. Klaus Havelund and Grigore Roşu. Java PathExplorer - a runtime verification tool. In Proceedings of the 6th International Symposium on Artificial Intelligence, Robotics and Automation in Space (i-SAIRAS 2001): A New Space Odyssey. 2001. Montreal, Canada. [526, 533]
225. K. Havelund and G. Roşu. Synthesizing monitors for safety properties. In J.-P. Katoen and P. Stevens, editors, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2002), volume 2280 of Lecture Notes in Computer Science, pages 324-356. Springer-Verlag, 2002. [538]
226. K. Havelund and G. Roşu. An overview of the runtime verification tool Java PathExplorer. Formal Methods in System Design, 24(2):189-215, 2004. [536, 552]
227. F. Huber, B. Schätz, and G. Einert. Consistent graphical specification of distributed systems. In Proceedings of the 4th International Symposium of Formal Methods Europe (FME 1997), volume 1313 of Lecture Notes in Computer Science, pages 122-141. Springer-Verlag, 1997. [406]
228. E. P. Hsieh. Checking experiments for sequential machines. IEEE Transactions on Computers, C-20:1152-1166, October 1971. [69, 72]
229. D. Hamlet and R. Taylor. Partition test does not inspire confidence. IEEE Transactions on Software Engineering, 16(12):1402-1411, December 1990. [302, 305]
230. Dung T. Huynh and Lu Tian. On some equivalence relations for probabilistic processes. Fundamenta Informaticae, 17:211-234, 1992. [274]
231. J. Hopcroft and J. Ullman. Introduction to automata theory, languages and computation. Addison-Wesley, 1979. [197]
232. IBM. Gotcha users guide - release 4.0.0. [445]
233. M. Ito and Jürgen Duske. On cofinal and definite automata. Acta Cybernetica, 6(2): 181-189, 1984. [6]
234. ETSI (European Telecommunication Standards Institute). The testing and test control notation version 3. In Methods for Testing and Specification (MTC). ETSI, 2003. [467, 468, 480, 486, 497, 501]
235. Balázs Imreh and Magnus Steinby. Some remarks on directable automata. Acta Cybernetica, 12(1):23-35, 1995. [19, 31]
236. Balázs Imreh and Magnus Steinby. Directable nondeterministic automata. Acta Cybernetica, 14(1):105-115, 1999. [32]
237. ISO/IEC. LOTOS - a formal description technique based on the temporal ordering of observational behaviour. International Standard 8807, International Organization for Standardization - Information Processing Systems - Open Systems Interconnection, Genève, September 1988. [163, 417, 423]
238. ISO/IEC. Information technology - open systems interconnection - conformance testing methodology and framework, 1994. International ISO/IEC multi-part standard No. 9646. [500]
239. ISO/IEC. Information technology - Z formal specification notation - syntax, type system, and semantics. International Organization for Standardization ISO/IEC 13568, 2002. [325, 327]
240. ITU. ITU-T recommendation Z.120: Message sequence charts (MSC). ITU Telecommunication Standard Sector, Geneva (Switzerland), 1999. [468]
241. ITU. The evolution of TTCN. http://www.itu.int/ITU-T/studygroups/com07/ ttcn.html, 2002. [465]
242. JBuilder. http://www.borland.com/jbuilder/personal/index.html. [502]
243. F. Jahanian and A. Goyal. A formalism for monitoring real-time constraints at run-time. In Proceedings of the 20th International Symposium on Fault-Tolerant Computing Systems (FTCS 1990), pages 148-155, 1990. [531]
244. Bengt Jonsson and Kim Guldstrand Larsen. Specification and refinement of probabilistic processes. In Proceedings of the 6th IEEE International Symposium on Logic in Computer Science (LICS 1991), pages 266-277. IEEE Computer Society Press, 1991. [234, 269]
245. Claude Jard and Thierry Jéron. TGV: Theory, principles and algorithms. In Proceedings of the 6th World Conference on Integrated Design and Process Technology (IDPT 2002). Society for Design and Process Science, June 2002. [417, 420]
246. Bengt Jonsson. Simulations between specifications of distributed systems. In Proceedings of the 2nd International Conference on Concurrency Theory (CONCUR 1991), volume 527 of Lecture Notes in Computer Science, pages 346-360. Springer-Verlag, 1991. [256, 269]
247. JUnit. http://www.junit.org/. [501]
248. Bengt Jonsson and Wang Yi. Compositional testing preorders for probabilistic processes. In Proceedings of the 10th IEEE International Symposium on Logic in Computer Science (LICS 1995), pages 431-441. IEEE Computer Society Press, 1995. [234, 252, 255, 265]
249. Bengt Jonsson and Wang Yi. Testing preorders for probabilistic processes can be characterized by simulations. Theoretical Computer Science, 282(1):33-51, 2002. [234, 244, 245, 252, 255, 256, 265, 269]
250. Jarkko Kari. Synchronizing finite automata on eulerian digraphs. Theoretical Computer Science, 295(1-3):223-232, 2003. [31, 32]
251. K. Narayan Kumar, Rance Cleaveland, and Scott Smolka. Infinite probabilistic and non-probabilistic testing. In Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1998), volume 1530 of Lecture Notes in Computer Science, pages 209-220. Springer-Verlag, 1998. [234, 244]
252. Robert M. Keller. Formal verification of parallel programs. Commun. ACM, 19(7):371-384, 1976. [113]
253. Denis J. Kfoury. Synchronizing sequences for probabilistic automata. Studies in Applied Mathematics, 49(1):101-103, March 1970. [32]
254. B. Koch, J. Grabowski, D. Hogrefe, and M. Schmitt. AutoLink - a tool for automatic test generation from SDL specifications. In Proceedings of the IEEE International Workshop on Industrial Strength Formal Specification Techniques (WIFT 1998), October 1998. [431, 432, 433]
255. Arjun Kapun, Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Proving safety properties of hybrid systems. In Hans Langmaack, Willem P. de Roever, and Jan Vytopil, editors, Proceedings of the 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1994), volume 863 of Lecture Notes in Computer Science, pages 431-454. Springer-Verlag, 1994. [375]
256. James C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385-394, July 1976. [338, 342]
257. A. Kerbrat, T. Jéron, and R. Groz. Automated test generation from SDL specifications. In R. Dssouli, G. von Bochmann, and Y. Lahav, editors, The Next Millennium - Proceedings of the 9th SDL Forum, 1999), pages 135-152. Elsevier Science Publishers, 1999. [419, 420]
258. M. Kim, S. Kannan, I. Lee, O. Sokolsky, and M. Viswanathan. Java-MaC: A run-time assurance tool for Java programs. In Proceedings of the 1st International Workshop on Run-Time Verification (RV 2001), volume 55(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, July 2001. [526, 542]
259. M. Kim, S. Kannan, I. Lee, M. Viswanathan, and O. Sokolsky. Computational analysis of run-time monitoring. In K. Havelund and G. Roşu, editors, Proceedings of the 2nd Workshop on Run-Time Verification (RV 2002), volume 70(4). Elsevier Science Publishers, 2002. [547, 553]
260. Moonjoo Kim, Sampath Kannan, Insup Lee, and Oleg Sokolsky. Java-MaC: a run-time assurance tool for Java. In Prodeedings of the 1st International Workshop on Run-time Verification (RV 2001), volume 55 of Electronic Notes in Theoretical Computer Science, Paris, France, July 2001. Elsevier Science Publishers. [530]
261. M. Kim, I. Lee, U. Sammapun, J. Shin, and O. Sokolsky. Monitoring, checking, and steering of real-time systems. In K. Havelund and G. Roşu, editors, Proceedings of the 2nd Workshop on Run-time Verification (RV 2002), volume 70(4) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002. [547, 553, 555]
262. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpiesman, and D. Wonnacott. The Omega library interface guide. Technical Report UMIACS-TR-95-41, University of Maryland at College Park, 1995. http://www.cs.umd.edu/projects/omega/. [426, 427]
263. Zvi Kohavi. Switching and Finite Automata Theory. McGraw-Hill, New York, NY, second edition, 1978. [30, 31, 39, 40, 46, 67, 69, 70, 72, 160]
264. Hermann Kopetz. Real-Time Systems - Design Principles for Distributed Embedded Applications. Kluwer Academic, 1997. ISBN: 0-7923-9894-7. [384]
265. Dexter Kozen. Lower bounds for natural proof systems. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), pages 254-266, Providence, Rhode Island, October 1977. IEEE Computer Society Press. [28, 48]
266. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, December 1983. [566]
267. KPN website, http://www.kpn.com/. [408]
268. Sarfraz Khurshid, Corina S. Pasareanu, and Willem Visser. Generalized symbolic execution for model checking and testing. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003. [342, 349, 351]
269. A. A. Klyachko, I. K. Rystsov, and M. A. Spivak. An extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton. Kibernetika, 25(2):165-171, March-April 1987. Translation from Russian. [6, 19, 31]
270. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer-Verlag, 1976. [237]
271. Kolyang, Thomas Santen, and Burkhart Wolff. A structure preserving encoding of Z in Isabelle/HOL. In Joakim von Wright, Jim Grundy, and John Harrison, editors, Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 1996), volume 1125 of Lecture Notes in Computer Science, pages 283-298. Springer-Verlag, 1996. [328]
272. M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press, Cambridge, Massachusetts and London, England, 1994. [590, 595]
273. Hakim Kahlouche, Cesar Viho, and Massimo Zendri. An industrial experiment in automatic generation of executable test suites for a cache coherency protocol. In A. Petrenko and N. Yevtushenko, editors, Proceedings of the 11th IFIP/TC6 International Workshop on Testing of Communicating Systems (TestCom 1998). Chapman & Hall, September 1998. [439, 443, 445, 447, 448, 449, 450, 455, 456, 458, 460]
274. Mei-Ko Kwan. Graphic programming using odd or even points. Chinese Math, 1:273-277, 1962. [92]
275. Richard Lai. A survey of communication protocol testing. Journal of Systems and Software, 62(1):21-46, May 2002. [3]
276. P. Lala. Fault Tolerant and Fault Testable Hardware Design. Prentice-Hall International, 1985. [70]
277. Rom Langerak. A testing theory for lotos using deadlock detection. In Ed Brinksma, Giuseppe Scollo, and Chris A. Vissers, editors, Proceedings of the IFIP/WG6.1 9th International Symposium on Protocol Specification, Testing and Verification (PSTV 1989), pages 87-98. North-Holland, 1990. [141, 142]
278. I. Lee, P. Brémond-Grégoire, and R. Gerber. A process algebraic approach to the specification and analysis of resource-bound real-time systems. Proceedings of the IEEE, 82(1):158-171, January 1994. [360]
279. Tessa Lau, Pedro Domingos, and Daniel S. Weld. Learning programs from traces using version space algebra. In Proceedings of the International Conference on Knowledge Capture (K-CAP 2003), Sanibel Island, FL, USA, 2003. ACM Press. [552]
280. Lite ftp and web sites, ftp://ftp.cs.utwente.nl/pub/src/lotos-tools/ and http://fmt.cs.utwente.nl/tools/lite/. [414, 417]
281. I. Lee, S. Kannan, M. Kim, O. Sokolsky, and M. Viswanathan. Runtime assurance based on formal specifications. In Hamid R. Arabnia, editor, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 1999), Volume 1, pages 279-287. CSREA Press, 1999. [542, 546]
282. Glen McCluskey & Associates LLC. Java™ test coverage and instrumentation toolkits, http://www.glenmccl.com/, 2003. [530]
283. H. R. Lewis and C. H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs, 1981. [92]
284. B. Legeard and F. Peureux. Génération de séquences de tests à partir d'une spécification B en PLC ensembliste. In Actes des Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL 2001), pages 113-130, June 2001. [339, 344, 349]
285. B. Legeard, F. Peureux, and M. Utting. Automated Boundary Testing from Z and B. In Proceedings of the International Conference on Formal Methods Europe (FME 2002), volume 2391 of Lecture Notes in Computer Science, pages 21-40, Copenhagen, Denmark, July 2002. Springer-Verlag. [339, 344]
286. B. Legeard, F. Peureux, and M. Utting. Controlling test case explosion in test generation from B formal models. Software Testing, Verification and Reliability (STVR), 14(2):81-103, 2004. [344]
287. Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer, 1(1-2):134-152, 1997. [221, 367]
288. Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1-28, 1991. [244, 252, 270, 271, 272, 273]
289. Nancy A. Lynch, Roberto Segala, and Frits W. Vaandrager. Hybrid I/O automata revisited. In Maria Domenica Di Benedetto and Alberto L. Sangiovanni-Vincentelli, editors, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control (HSCC 2001), volume 2034 of Lecture Notes in Computer Science, pages 403-417. Springer-Verlag, 2001. [375]
290. K. G. Larsen, B. Steffen, and C. Weise. Continuous modelling of real time and hybrid systems: From concepts to tools. International Journal on Software Tools for Technology Transfer, 1(1-2):64-85, 1997. [375]
291. N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC 1987), pages 137-151. ACM Press, 1987.
292. Also: Technical Report MIT/LCS/TM-387, Massachusetts Institute of Technology, Cambridge, U.S.A., 1987. [173, 175]
293. N. A. Lynch and M. R. Tuttle. An introduction to Input/Output Automata. CWI Quarterly, 2(3):219-246, 1989.
294. Also: Technical Report MIT/LCS/TM-373 (TM-351 revised), Massachusetts Institute of Technology, Cambridge, U.S.A., 1988. [175, 176]
295. G. Luo, G. von Bochmann, and A. Petrenko. Selecting test sequences for partially-specified non deterministic finite state machines. In Proceedings of the 7th International Workshop on Protocol Test Systems (IWPTS 1994), pages 91-106, Japan, February 1994. [191]
296. David Lee and Mihalis Yannakakis. Testing finite-state machines: State identification and verification. IEEE Transactions on Computers, 43(3):306-320, March 1994. [3, 29, 39, 40, 46, 48, 49, 50, 55, 59, 62, 63, 64, 65, 66, 67, 69, 72, 75, 79, 86, 611]
297. David Lee and Mihalis Yannakakis. Principles and methods of testing finite state machines - a survey. Proceedings of the IEEE, 84(8):1090-1126, 1996. [3, 12, 31, 40, 67, 80, 87, 88, 89, 93, 107, 611]
298. B. Marre and A. Arnould. Test sequence generation from lustre descriptions: GATEL. In Proceedings of the 15th IEEE International Conference on Automated Software Engineering (ASE 2000), Grenoble, 2000. IEEE Computer Society Press. [402]
299. Savi Maharaj. Towards a method of test case extraction from correctness proofs. Presented at the 14th International Workshop on Algebraic Development Techniques (WADT 1999), 1999. [336, 337, 338]
300. Savi Maharaj. Test case extraction from correctness proofs. University of Stirling, 2000. Case for Support. [336]
301. Stephen McCamant and Michael D. Ernst. Predicting problems caused by component upgrades. In Proceedings of the 9th European Software Engineering Conference (ESEC 2003). Held jointly with the 11th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE 2003), pages 287-296. ACM Press, 2003. [550, 554]
302. Thomas Melham. Abstraction mechanisms for hardware verification. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification, and Synthesis, volume 35 of The Kluwer International Series in Engineering and Computer Science, pages 129-157. Kluwer Academic, Boston, 1988. [455]
303. G. Meyer. The Art of Software Testing. John Wiley & Sons, Inc., 1979. [297]
304. Bertrand Meyer. Design by contract. IEEE Computer, 25(10):40-52, October 1992. [531]
305. Oliver Meyer. Structural Decomposition of Timed-CSP and its Application in Real-Time Testing. Dissertation, University of Bremen, 2001. Number 16 in Monographs of the Bremen Institute of Safe Systems. [360]
306. V. Matena and M. Hapner. Enterprise javabeans™ specification. Public Draft version 1.1, Sun Microsystems, 1999. [528]
307. R. Milner. A Calculus for Communicating Processes, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980. [119, 129, 145]
308. Robin Milner. Communication and concurrency. Prentice-Hall, 1989. [362, 565, 602]
309. Jeff Magee and Jeff Kramer. Concurrency: State Models & Java Programs. John Wiley & Sons, 1999. [423, 424]
310. Aloysius K. Mok and Guangtian Liu. Efficient run-time monitoring of timing constraints. In IEEE Real-Time Technology and Applications Symposium, June 1997. [531]
311. Edward F. Moore. Gedanken-experiments on sequential machines. In C. E. Shannon and J. McCarthy, editors, Automata Studies, number 34 in Annals of Mathematics Studies, pages 129-153. Princeton University Press, Princeton, NJ, 1956. [12, 13, 22, 30, 36, 39, 89]
312. M. Müller-Olm, D. Schmidt, and B. Steffen. Model checking: A tutorial introduction. In G. File A. Cortesi, editor, Proceedings of the 6th Static Analysis Symposium (SAS'99), volume 1694 of Lecture Notes in Computer Science, pages 330-354, Heidelberg, Germany, September 1999. Springer-Verlag. [560]
313. R. Miller and S. Paul. On the generation of minimal-length conformance tests for communication protocols. IEEE/ACM Transactions on Networking, 1(1):116-129, February 1993. [72, 76]
314. O. Maler and A. Pnueli. On the learnability of infinitary regular sets. Information and Computation, 118(2):316-326, 1 May 1995. [599]
315. Leonardo Mariani and Mauro Pezzè. Behavior capture and test: Automated analysis of component integration. In Proceedings of the 10th IEEE International Conference on the Engineering of Complex Computer Systems (ICECCS 2005), Shanghai, China, June 2005. [551, 554]
316. J. R. Moonen, J. M. T. Romijn, O. Sies, J. G. Springintveld, L. G. M. Feijs, and R. L. C. Koymans. A two-level approach to automated conformance testing of VHDL designs. Technical Report SEN-R9707, CWI - Centrum voor Wiskunde en Informatica, Amsterdam, 1997. [410]
317. Alexandru Mateescu and Arto Salomaa. Many-valued truth functions, černý's conjecture and road coloring. Bulletin of the EATCS, 68:134-150, June 1999. [32]
318. Microsoft Research - Foundations of Software Engineering. http://research.microsoft.com/fse/. [412]
319. H. Mühlenbein. Genetic algorithms. In E. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 137-171. John Wiley & Sons, 1997. [84]
320. J. D. Musa. Operational profiles in software-reliability engineering. IEEE Software, 10(2):14-32, March 1993. [394]
321. K. Naik. Efficient computation of unique input/output sequences in finitestate machines. IEEE/ACM Transactions on Networking, 5(4):585-599, August 1997. [69, 72, 76, 77, 78, 79, 83, 84, 86]
322. B. K. Natarajan. An algorithmic approach to the automated design of parts orienters. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), pages 132-142, Toronto, Ontario, Canada, October 1986. IEEE. [7, 32]
323. Manuel Nuthez, David de Frutos, and Luis Llana. Acceptance trees for probabilistic processes. In Insup Lee and Scott A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory (CONCUR 1995), volume 962 of Lecture Notes in Computer Science, pages 249-263. Springer-Verlag, 1995. [234]
324. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984. [179]
325. B. Nielsen. Speification and Test of Real-Time Systems. PhD thesis, Department of Computer Science, Aalborg University, 2000. [371, 372]
326. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer-Verlag, 2002. [328, 331]
327. Brian Nielsen and Arne Skou. Automated test generation from timed automata. International Journal on Software Tools for Technology Transfer, 5:59-77, 2003. [205, 206, 212, 230]
328. S. Naito and M. Tsunoyama. Fault detection for sequential machines by transition tours. In Proceedings of the 11th IEEE Fault Tolerant Computing Conference (FTCS 1981), pages 238-243. IEEE Computer Society Press, 1981. [93]
329. S. C. Ntafos. A comparison of some structural testing strategies. IEEE Transactions on Software Engineering, SE-11:367-375, April 1988. [301]
330. Simeon Ntafos. On random and partition testing. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 1998), pages 42-48. ACM Press, 1998. [302, 307, 441]
331. D. Buchs O. Biberstein and N. Guelfi. Object-oriented nets with algebraic specifications: The CO-OPN/2 formalism. In Gul Agha, Fiorella de Cindio, and Grzegorz Rozenberg, editors, Concurrent Object-Oriented Programming and Petri Nets, Advances in Petri Nets, volume 2001 of Lecture Notes in Computer Science, pages 73-130. Springer-Verlag, 2001. [343]
332. Object Management Group (OMG). UML Testing Profile - Request For Proposal, April 2002. OMG Document (ad/01-07-08). [497]
333. F. Ouabdesselam and I. Parissis. Constructing operational profiles for synchronous crtitical software. In Proceedings of the 6th International Symposium on Software Reliability Engineering (ISSRE 1995), pages 286-293. IEEE Computer Society Press, 1995. [398]
334. Sam Owre, Sreeranga Rajan, John M. Rushby, Natarajan Shankar, and Mandayam K. Srivas. PVS: Combining specification, proof checking, and model checking. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the 8th International Conference on Computer Aided Verification (CAV 1996), volume 1102 of Lecture Notes in Computer Science, pages 411-414. Springer-Verlag, 1996. [325]
335. Sam Owre, John M. Rushby, and Natarajan Shankar. PVS: A prototype verification system. In Deepak Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction (CADE 1992), volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752. Springer-Verlag, 1992. [337]
336. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification of fault-tolerant architerctures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, 1995. [426, 427]
337. Jan Peleska, Peter Amthor, Sabine Dick, Oliver Meyer, Michael Siegel, and Cornelia Zahlten. Testing reactive real-time systems. Tutorial, held at the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1998), Denmark Technical University, Lyngby, 1998. Updated revision. Available as http://www.informatik.unibremen.de/agbs/jp/ papers/ftrtft98.ps. [356, 357, 360, 375]
338. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, New York, 1994. [28]
339. Michael S. Paterson. Unsolvability in 3 × 3 matrices. Studies in Applied Mathematics, 49(1):105-107, March 1970. [32]
340. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994. [328, 331]
341. A. Petrenko, G. Bochmann, and R. Dussouli. Conformance relations and test derivation. In O. Rafiq, editor, Proceedings of the 6th International Workshop on Protocol Test Systems (IWPTS 1993), volume C-19 of IFIP Transactions, pages 157-178, Pau, France, September 1993. North-Holland. [190]
342. H. Pals, Z. R. Dai, J. Grabowski, and H. Neukirchen. UML-based modeling of roaming with bluetooth devices. In Chun Chen, Walter Dosch, Yuntao Qian, and Huaizhong Lin, editors, First Hangzhou-Lübeck Conference on Software Engineering (HL-SE'03), 2003. [506]
343. Jan Peleska. Formal methods for test automation - hard real-time testing of controllers for the airbus aircraft family. In Proceedings of the 6th Biennial World Conference on Integrated Design & Process Technology (IDPT 2002). Society for Design and Process Science, June 2002. [360]
344. Cecile Peraire. Formal testing of object-oriented software: From the method to the tool. PhD thesis, École Polytechnique Fédéral de Lausanne (EPFL), Switzerland, 1998. [349]
345. David H. Pitt and David Freestone. The derivation of conformance tests from LOTOS specifications. IEEE Transactions on Software Engineering, 16(12):1337-1343, December 1990. [163, 164, 165, 166]
346. M. Phalippou. Tveda: An experiment in computer-aided test case generation from formal specification of protocols. Technical Note NT/LAA/SLC/347, France Telecom - CNET, 1991. [200]
347. M. Phalippou. The limited power of testing. In Gregor von Bochmann, Rachida Dssouli, and Anindya Das, editors, Proceedings of the 5th International Workshop on Protocol Test Systems (IWPTS 1992), volume C-11 of IFIP Transactions, pages 43-54, Montréal, September 1993. North-Holland. [190, 196]
348. M. Phalippou. Executable testers. In Omar Rafiq, editor, Proceedings of the 6th International Workshop on Protocol Test Systems (IWPTS 1993), volume C-19 of IFIP Transactions, pages 35-50, Pau, France, September 1994. North-Holland. [200]
349. M. Phalippou. Relations d'Implantation et Hypothèses de Test sur des Automates à Entrées et Sorties. PhD thesis, L'Université de Bordeaux I, France, 1994. [173, 175, 177, 188, 412]
350. M. Phalippou. Abstract testing and concrete testers. In S. T. Vuong and S. T. Chanson, editors, Proceedings of the 14th IFIP/WG6.1 International Symposium on Protocol Specification, Testing and Verification (PSTV 1994), volume 1 of IFIP Conference Proceedings, pages 221-236, Vancouver, June 1995. Chapman & Hall. [200]
351. Philips website. http://www.philips.com/. [409]
352. Iain Phillips. Refusal testing. Theoretical Computer Science, 50:241-284, 1987. [126, 138, 139, 140, 141]
353. Jean-Eric Pin. Sur les mots synchronisants dans un automate fini. Elektronische Informationsverarbeitung und Kybernetik (EIK), 14:297-303, 1978. [31]
354. Jean-Eric Pin. Sur un cas particulier de la conjecture de černý. In Giorgio Ausiello and Corrado Böhm, editors, Proceedings of the 5th Colloquium on Automata, Languages and Programming, volume 62 of Lecture Notes in Computer Science, pages 345-352, Udine, Italy, July 1978. Springer-Verlag. [31, 32]
355. L. Ferreira Pires. Protocol Implementation: Manual for Practical Exercises 1995-1996. University of Twente, the Netherlands, 1995. Lecture notes. [443]
356. Carl Pixley, Seh-Woong Jeong, and Gary D. Hachtel. Exact calculation of synchronization sequences based on binary decision diagrams. In Proceedings of the 29th Design Automation Conference (DAC 1992), pages 620-623. IEEE Computer Society Press, June 1992. [6, 32]
357. A. Pretschner, H. Lötzbeyer, and J. Philipps. Model based testing in incremental system development. Journal of Systems and Software, 70(3):315-329, 2003. [289]
358. Peter Puschner and Roman Nossal. Testing the results of static worstcase execution-time analysis. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS 1998), pages 134-143. IEEE Computer Society Press, December 1998. [383, 384]
359. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium Foundations of Computer Science (FOCS 1977), pages 46-57. IEEE Computer Society Press, 1977. [526, 529, 562]
360. I. Parissis and F. Ouabdesselam. Specification-based testing of synchronous software. In D. Garlan, editor, Proceedings of the 4th ACM SIGSOFT Symposium on Foundations of Software Engineering (FSE 1996), volume 21(6) of ACM SIGSOFT Software Engineering Notes, pages 127-134. ACM Press, 1996. [398]
361. Wolfgang Prenninger and Alexander Pretschner. Abstractions for model-based testing. In Proceedings of the International Workshop on Test and Analysis of Component Based Systems (TACoS 2004), Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2004. [284, 288, 452]
362. J. Philipps, A. Pretschner, O. Slotosch, E. Aiglstorfer, S. Kriebel, and K. Scholl. Model-based test case generation for smart cards. In In Proceedings of the 8th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2003), Electronic Notes in Theoretical Computer Science. Elsivier, 2003. to appear. [286, 339, 343, 347, 406, 439, 444, 446, 447, 448, 449, 451, 453, 454, 455, 456, 457, 458, 459]
363. Alexander Pretschner, Wolfgang Prenninger, Stefan Wagner, Christian Kühnel, Martin Baumgartner, Bernd Sostawa, Rüdiger Zölch, and Thomas Stauner. One Evaluation of Model-Based Testing and its Automation. In Proc. ICSE'05, 2005. To appear. [291]
364. Irith Pomeranz and Sudhakar M. Reddy. Application of homing sequences to synchronous sequential circuit testing. IEEE Transactions on Computers, 43(5):569-580, May 1994. [22, 32]
365. A. Pretschner. Classical search strategies for test case generation with constraint logic programming. In E. Brinksma and J. Tretmans, editors, Proceedings of the 3rd International Workshop on Formal Approaches to Testing of Software (FATES 2001), number NS/01/4 in BRICS Notes Series, pages 47-60, 2001. Satellite Workshop on CONCUR 2001. [407]
366. A. Pretschner. Compositional generation for MC/DC test suites. In Proceedings of the International Workshop on Test and Analysis of Component Based Systems (TACoS 2003), volume 82(6) of Electronic Notes in Theoretical Computer Science, pages 1-11. Elsevier Science Publishers, 2003. [289, 407]
367. Tatjana Petković and Magnus Steinby. On directable automata. Journal of Automata, Languages and Combinatorics, 6(2):205-220, 2001. [6]
368. Ben Potter, Jane Sinclair, and David Till. An Introduction to Formal Specification and Z. Prentice Hall, second edition, 1996. [325, 327]
369. S. Prowell, C. Trammell, R. Linger, and J. Poore. Cleanroom Software Engineering. Addison Wesley, 1999. [283]
370. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Inc, 1994. [239, 241]
371. D. Peled, M. Vardi, and M. Yannakakis. Black box checking. In Proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE 1999) and Protocol Specification, Testing and Verification (PSTV 1999), volume 156 of IFIP Conference Proceedings, pages 225-240. Kluwer Academic, 1999. [599]
372. Bala Ravikumar. A deterministic parallel algorithm for the homing sequence problem. In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP 1996), pages 512-520, New Orleans, LA, October 1996. IEEE Computer Society Press. [31]
373. Bala Ravikumar. Parallel algorithms for finite automata problems. In José D. P. Rolim, editor, Proceedings of the 10 Workshops of the 12th International Parallel Processing Symposium (IPPS 1998) and 9th Symposium on Parallel and Distributed Processing (SPDS 1998), volume 1388 of Lecture Notes in Computer Science, page 373. Springer-Verlag, 1998. [31]
374. V. Rusu, L. du Bousquet, and T. Jéron. An approach to symbolic test generation. In W. Grieskamp, T. Santen, and B. Stoddart, editors, Proceedings of the 2nd International Conference on Integrated Formal Methods (IFM 2000), volume 1945 of Lecture Notes in Computer Science, pages 338-357. Springer-Verlag, 2000. [174, 418, 424, 425, 426, 427]
375. Anil S. Rao and Kenneth Y. Goldberg. Manipulating algebraic parts in the plane. IEEE Transactions on Robotics and Automation (IEEETROB), 11(4):598-602, August 1995. [7, 32]
376. S. Rayadurgam and M.P. Heimdahl. Coverage based test case generation using model checkers. In Proceedings of the 8th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ECBS 2001), pages 83-91. IEEE Computer Society Press, 2001. [352]
377. S. Rayadurgam and M. P. Heimdahl. Test-sequence generation from formal requirements models. In Proceedings of the 6th IEEE International Symposium on High-Assurance Systems Engineering (HASE 2001), pages 23-31. IEEE Computer Society Press, 2001. [352]
378. G. Roşu and K. Havelund. Synthesizing dynamic programming algorithms from linear temporal logic formulae. Technical report, RIACS, 2001. [534]
379. C. V. Ramamoorthy, S. F. Ho, and W. T. Chen. On the automated generation of program test data. In Proceedings of the 2nd International Conference on Software Engineering (ICSE 1976), page 636. IEEE Computer Society Press, 1976. Abstract only. [343]
380. N. Risser. TVEDA V2 user guide. Technical Document DT/LAA/SLC/EVP/5, France Telecom - CNET, March 1993. [200]
381. James Rumbaugh, Ivar Jacobson, and Grady Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, Reading, Massachusetts, USA, first edition, 1999. [1, 497]
382. Orna Raz, Philip Koopman, and Mary Shaw. Semantic anomaly detection in online data sources. In Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), pages 302-312. ACM Press, 2002. [526, 550, 551, 554]
383. K. Rustan, M. Leino, G. Nelson, and J. B. Saxe. ESC/Java user's manual. Technical Report 2000-002, Compaq Systems Research Center, Palo Alto, 2000. [555]
384. P. Raymond, X. Nicollin, N. Halbwachs, and D. Weber. Automatic testing of reactive systems. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS 1998), pages 200-209. IEEE Computer Society Press, 1998. [399, 400]
385. A. Rouger and M. Phalippou. Test cases generation from formal specifications. In Proceedings of the 14th International Switching Symposium (ISS 1992), page C10.2, Yokohama, October 1992. [198]
386. Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, April 1993. [8, 12, 27, 586, 598]
387. June-Kyung Rho, Fabio Somenzi, and Carl Pixley. Minimum length synchronizing sequences of finite state machine. In Proceedings of the 30th ACM/IEEE Design Automation Conference (DAC 1993), pages 463-468. ACM Press, June 1993. [25, 32]
388. Vlad Rusu. Verification using test generation techniques. In L.-H. Eriksson and P. Lindsay, editors, Getting IT Right: Proceedings of the 11th International Symposium of Formal Methods Europe (FME 2002), volume 2381 of Lecture Notes in Computer Science, pages 252-271. Springer-Verlag, 2002. [426]
389. Ted Romer, Geoff Voelker, Dennis Lee, Alec Wolman, Wayne Wong, Hank Levy, Brian Bershad, and Brad Chen. Instrumentation and optimization of Win32/Intel executables using Etch. In Proceedings of the First USENIX Windows NT Workshop, Seattle, WA, August 1997. [530]
390. S. Rapps and E. J. Weyuker. Selecting software test data using data flow information. IEEE Transactions on Software Engineering, SE-11:367-375, April 1985. [297, 300]
391. C. Rich and R. Waters. The programmer's apprentice: A research overview. IEEE Computer, 21(11):10-25, 1988. [552]
392. Bala Ravikumar and Xuefeng Xiong. Randomized parallel algorithms for the homing sequence problem. In Adam W. Bojanczyk, editor, Proceedings of the 25th International Conference on Parallel Processing (ICPP 1996), volume 2: Algorithms & Applications, pages 82-89. IEEE Computer Society Press, August 1996. [31]
393. Bala Ravikumar and Xuefeng Xiong. Implementing sequential and parallel programs for the homing sequence problem. In Darrell R. Raymond, Derick Wood, and Sheng Yu, editors, Proceedings of the 1st Workshop on Implementing Automata (WIA 1996), volume 1260 of Lecture Notes in Computer Science, pages 120-131. Springer-Verlag, 1997. [31]
394. Igor K. Rystsov. Polynomial complete problems in automata theory. Information Processing Letters, 16(3):147-151, April 1983. [8, 20, 27, 30, 31, 32]
395. Igor K. Rystsov. Rank of a finite automaton. CYBERNETICS: Cybernetics and Systems Analysis, 28(3):323-328, May 1992.
396. Translation of Kibernetika i Sistemnyi Analiz, pages 3-10 in non-translated version. [6, 30, 31, 32]
397. Igor K. Rystsov. Reset words for commutative and solvable automata. Theoretical Computer Science, 172:273-279, February 1997. [6, 31]
398. Jian Shen and Jacob Abraham. An RTL abstraction technique for processor micorarchitecture validation and test generation. Journal of Electronic Testing: Theory & Application, 16(1-2):67-81, February 1999. [287, 439, 443, 445, 447, 448, 449, 450, 455, 456, 457, 458]
399. Sadegh Sadeghipour. Testing Cyclic Software Components of Reactive Systems on the Basis of Formal Specifications, volume 40 of Forschungsergebnisse zur Informatik. Verlag Dr. Kovač, Hamburg, 1998. [330, 331]
400. Arto Salomaa. Synchronization of finite automata. Contributions to an old problem. In I. Hal Sudborough T. M. Mogensen, D. A. Schmidt, editor, The Essence of Computation. Complexity, Analysis, Transformation: Essays Dedicated to Neil D. Jones, volume 2566 of Lecture Notes in Computer Science, pages 37-59. Springer-Verlag, 2002. [7]
401. Walter J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4:177-192, 1970. [28]
402. S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. E. Anderson. Eraser: A dynamic data race detector for multithreaded programs. ACM Transactions on Computer Systems, 14(4):391-411, November 1997. [526, 532, 533]
403. Johann M. Schumann. Automated theorem proving in high-quality software design. In Steffen Hölldobler, editor, Intellectics and Computational Logic, volume 19 of Applied Logic Series, pages 295-312. Kluwer Academic, 2000. [325]
404. Johann M. Schumann. Automated Theorem Proving in Software Engineering. Springer-Verlag, 2001. [325]
405. B. Steffen, A. Claßen, M. Klein, J. Knoop, and T. Margaría. The fixpoint analysis machine. In J. Lee and S. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory (CONCUR 1995), volume 962 of Lecture Notes in Computer Science, pages 72-87, Heidelberg, Germany, 1995. Springer-Verlag. [575]
406. Harbhajan Singh, Mirko Conrad, and Sadegh Sadeghipour. Test case design based on Z and the classification-tree method. In Michael G. Hinchey and Shaoying Liu, editors, Proceedings of the 1st International Conference on Formal Engineering Methods (ICFEM 1997), pages 81-90. IEEE Computer Society Press, 1997. [330, 331]
407. K. Sabnani and A. Dahbura. A new technique for generating protocol tests. In Proceedings of the 9th Data Communication Symposium (SIGCOMM 1985), pages 36-43. IEEE Computer Society Press, 1985. Also appeared in Computer Communication Review, volume 15(4), September 1985. [72]
408. Krishan Sabnani and Anton Dahbura. A protocol test generation procedure. Computer Networks and ISDN Systems, 15(4):285-297, September 1988. [69, 72, 78, 84, 98, 99]
409. I. Schieferdecker, Z. R. Dai, J. Grabowski, and A. Rennoch. The UML 2.0 testing profile and its relation to TTCN-3. In D. Hogrefe and A. Wiles, editors, Proceedings of the 15th IFIP International Conference on Testing of Communicating Systems (TestCom2003), volume 2644 of Lecture Notes in Computer Science. Springer-Verlag, May 2003. [497]
410. R. Segala. A process algebraic view of Input/Output Automata. Technical Memo MIT/LCS/TR-557, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, U.S.A., 1992. [173]
411. Roberto Segala. Testing probabilistic automata. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of the 7th Conference on Concurrency Theory (CONCUR 1996), volume 1119 of Lecture Notes in Computer Science, pages 299-314. Springer-Verlag, 1996. [234, 244, 245, 252, 253, 255, 261, 265, 269]
412. R. Segala. Quiescence, fairness, testing and the notion of implementation. Information and Computation, 138(2):194-210, 1997. [181, 182, 183]
413. M. Schmitt, M. Ebner, and J. Grabowski. Test generation with Autolink and TestComposer. In E. Sherratt, editor, Proceedings of the 2nd Workshop on SDL and MSC (SAM 2000). VERIMAG, IRISA, 2000. [430, 431, 432, 433]
414. D. Sidhu and T. Leung. Experience with test generation for real protocols. In Proceedings of the ACM Symposium on Communications Architectures and Protocols (SIGCOMM 1988), pages 257-261. ACM Press, 1988. [110]
415. D. Sidhu and T.-K. Leung. Formal methods for protocol testing: A detailed study. IEEE Transactions on Software Engineering, 15(4):413-426, April 1989. [3, 100]
416. Roberto Segala and Nancy Lynch. Probabilistic simulations for probabilistic processes. In Bengt Jonsson and Joachim Parrow, editors, Proceedings of the 5th Conference on Concurrency Theory (CONCUR 1994), volume 836 of Lecture Notes in Computer Science, pages 481-496. Springer-Verlag, 1994. [239, 269]
417. Sriram Sankar and Manas Mandal. Concurrent runtime monitoring of formally specified programs. IEEE Computer, 26(3):32-41, March 1993. [531]
418. F. Sato, J. Munemori, T. Ideguchi, and T. Mizuno. Test sequence generation method based on finite automata - single transition checking using W Set. Transactions of EIC (in Japanese), J72-B-I(3):183-192, 1989. [93]
419. M. N. Sokolovsku. Diagnostic experiments with automata. Kibernetika, 6:44-49, 1971. [40]
420. R. Sosič. Dynascope: A tool for program directing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation (PLDI 1992), pages 12-21, 1992. Appeared in SIGPLAN Notices, volume 27(7), July 1992. [531]
421. B. Schätz, A. Pretschner, F. Huber, and J. Philipps. Model-based development of embedded systems. In J.-M. Bruel and Z. Bellahsene, editors, Proceedings of the Workshops of the 8th International Conference on Advances in Object-Oriented Information Systems (OOIS 2002), volume 2426 of Lecture Notes in Computer Science, pages 298-311. Springer-Verlag, 2002. [290]
422. J. Michael Spivey. The Z Notation. Prentice Hall, second edition, 1992. [325, 327]
423. U. Sammapun, R. Sharykin, M. DeLap, M. Kim, and S. Zdancewic. Formalizing Java-MaC. In O. Sokolsky and M. Viswanathan, editors, Proceedings of the 3rd Workshop on Run-Time Verification (RV 2003), volume 89(2) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2003. [526, 547]
424. Stateflow. http://www.mathworks.com/products/stateflow/. [1]
425. Peter H. Starke. Eine Bemerkung über homogene Experimente. Elektronische Informationverarbeitung und Kybernetic, 2:257-259, 1966. [31]
426. Peter. H. Starke. Abstract Automata. North-Holland, Amsterdam, 1972. Translation from German. [8, 15]
427. H. Stachowiak. Allgemeine Modelltheorie. Springer-Verlag, 1973. [283, 288]
428. M. I. A. Stoelinga. An introduction to probabilistic automata. In G. Rozenberg, editor, EATCS bulletin, volume 78, pages 176-198, 2002. [234]
429. M. I. A. Stoelinga and F. W. Vaandrager. A testing scenario for probabilistic automata. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Proceedings of the 30th International Colloquium on Automata, Lnaguages, and Programming (ICALP 2003), volume 2719 of Lecture Notes in Computer Science, pages 464-477. Springer-Verlag, 2003. Also published as Technical Report of the nijmeegs instituut voor informatica en informatiekunde, number NIII-R0307. [234, 269]
430. Jan Springintveld, Frits Vaandrager, and Pedro R. D'Argenio. Testing timed automata. Theoretical Computer Science, 254(1-2):225-257, March 2001. [202, 206, 212, 215, 221, 230]
431. S. Schulz and T. Vassiliou-Gioles. Implementation of TTCN-3 test systems using the TRI. In I. Schieferdecker, H. König, and A. Wolisz, editors, Applications to Internet Technologies and Service - Proceedings of the 14th International Conference on Testing Communication Systems (TestCom 2002), volume 210 of IFIP Conference Proceedings, pages 425-442. Kluwer Academic, 2002. [480]
432. Ina Schieferdecker and Theofanis Vassiliou-Gioles. Realizing distributed TTCN-3 test systems with TCI. In Dieter Hogrefe and Anthony Wiles, editors, Proceedings of the 15th International Conference on Testing of Communicating Systems (TestCom 2003), volume 2644 of Lecture Notes in Computer Science, pages 95-109. Springer-Verlag, 2003. [480]
433. A. P. Sistla, Moshe Y. Vardi, and Pierre Wolper. The complementation problem for Büchi automata with application to temporal logics. Theoretical Computer Science, 49:217-237, 1987. [567]
434. Colin Stirling and David Walker. Local model checking in the modal mucalculus. Theoretical Computer Science, 89(1):161-177, October 1991. [566]
435. J. Tretmans and E. Brinksma. Côte de Resyste - Automated Model Based Testing. In M. Schweizer, editor, Progress 2002 - 3rd Workshop on Embedded Systems, pages 246-255, Utrecht, The Netherlands, October 24 2002. STW Technology Foundation. [420, 423]
436. Telelogic website, http://www.telelogic.com/. [410]
437. Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 4, pages 133-191. Elsevier Science Publishers, 1990. [203]
438. Kevin S. Templer and Clinton L. Jeffrey. A configurable automatic instrumentation tool for Ansi C. In Proceedings of the 13th IEEE Conference on Automated Software Engineering (ASE 1998), pages 249-258. IEEE Computer Society Press, October 1998. [531]
439. Ian Toyn and John A. McDermid. CADiℤ: an architecture for Z tools and its implementation. Software - Practice and Experience, 25(3):305-330, 1995. [331]
440. Torx website, http://www.purl.org/net/torx/. [420]
441. Ian Toyn. Formal reasoning in the Z notation using cadiℤ. In Nicholas A. Merriam, editor, Proceedings of the 2nd International Workshop on User Interface Design for Theorem Proving Systems (UITP 1996), 1996. [331]
442. Ian Toyn. A tactic language for reasoning about Z specifications. In David Duke and Andy Evans, editors, Proceedings of the 3rd Northern Formal Methods Workshop (NFMW 1998), Electronic Workshops in Computing. British Computer Society, 1998. [331]
443. Q. M. Tan and A. Petrenko. Test generation for specifications modeled by input/output automata. In A. Petrenko and N. Yevtushenko, editors, Proceedings of the 11th International Workshop on Testing of Communication Systems (IWTCS 1998), volume 131 of IFIP Conference Proceedings, pages 83-100. Kluwer Academic, 1998. [174]
444. Q. M. Tan, Alexandre Petrenko, and Gregor von Bochmann. Modeling basic LOTOS by FSMs for conformance testing. In Piotr Dembinski and Marek Sredniawa, editors, Proceedings of the 15th IFIP/WG6.1 International Symposium on
445. Q. M. Tan, A. Petrenko, and Gregor v. Bochmann. Checking experiments with labeled transition systems for trace equivalence. In Proceedings of the 10th International Workshop on Testing Communicating Systems (IWTCS 1997), 1997. [160, 161, 162, 163]
446. Avraham N. Trakhtman. The existence of synchronizing word and černý conjecture for some finite automata. In Proceedings of the 2nd Haifa Workshop on Graph Theory, Combinatorics and Algorithms (GTCA 2002), June 2002. [31]
447. Jan Tretmans. A formal approach to conformance testing. In Proceedings of the 6th IFIP TC6/WG6.1 International Workshop on Protocol Test Systems (IWPTS 1993), volume C-19 of IFIP Transactions, pages 257-276. North-Holland, 1994. [119, 145, 146]
448. J. Tretmans. Conformance testing with labelled transisition systems: Implementation relations and test generation. Computer Networks and ISDN Systems, 29:49-79, 1996. [417, 424]
449. J. Tretmans. Test generation with inputs, outputs, and quiescence. In T. Margaria and B. Steffen, editors, Proceedings of the 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 1996), volume 1055 of Lecture Notes in Computer Science, pages 127-146. Springer-Verlag, 1996. [173, 179, 184, 185, 187, 194]
450. J. Tretmans. Test Generation with Inputs, Outputs and Repetitive Quiescence. Software - Concepts and Tools, 17(3):103-120, 1996. [175, 178, 417, 420, 421, 424]
451. U2TP Consortium, http://www.fokus.fraunhofer.de/u2tp/. [497]
452. U2TP Consortium. UML Testing Profile, March 2004. Final Adopted Specification at OMG (ptc/2004-04-02). [497, 498]
453. UML 2.0. http://www.omg.org/uml. [497]
454. UMLAUT website. http://www.irisa.fr/UMLAUT/. [419, 420]
455. UML 2.0 Infrastructure Specification, November 2003. OMG Adopted Specification (ptc/03-09-15). [497]
456. UML 2.0 Superstructure, September 2003. OMG Adopted Specification (ptc/03-08-02). [497]
457. Hasan Ural, Xiaolin Wu, and Fan Zhang. On minimizing the lengths of checking sequences. IEEE Transactions on Computers, 46(1):93-99, 1997. [104]
458. F. Vaandrager. On the relationship between process algebra and Input/Output Automata. In Proceeedings on the 6th IEEE Symposium on Logic in Computer Science (LICS 1991), pages 387-398. IEEE Computer Society Press, 1991. [181]
459. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984. [307]
460. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. M. Birtwistle, editors, Logics for Concurrency - Structure versus Automata. Proceedings of the 8th Banff Higher Order Workshop (Banff 1995), volume 1043 of Lecture Notes in Computer Science, pages 238-266. Springer-Verlag, 1996. [566, 567]
461. M. Y. Vardi. Branching vs. linear time: Final showdown. In W. Yi T. Margaria, editor, Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), volume 2031 of Lecture Notes in Computer Science, pages 1-22. Springer-Verlag, January 2001. [562]
462. M. P. Vasilevski. Failure diagnosis of automata. Cybernetic, 9(4):653-665, 1973. [101, 108, 593, 599]
463. S. A. Vilkomir and J. P. Bowen. Formalization of software testing criteria using the Z notation. In Proceedings of the 25th International Computer Software and Applications Conference (COMPSAC 2001), pages 351-356. IEEE Computer Society Press, 8-12 October 2001. [297, 298]
464. S.A. Vilkomir and J. P. Bowen. Reinforced condition/decision coverage (RC/DC): A new criterion for software testing. In D. Bert, J. P. Bowen, M. Henson, and K. Robinson, editors, Proceedings of the 2nd International Conference of B and Z Users: Formal Specification and Development in Z and B (ZB 2002), volume 2272 of Lecture Notes in Computer Science, pages 295-313. Springer-Verlag, 2002. [299]
465. S. T. Vuong, W. Y. L. Chan, and M. R. Ito. The UIOv-method for protocol test sequence generation. In Proceedings of the 2nd International Workshop on Protocol Test Systems (IWPTS 1990), pages 161-176. North-Holland, 1990. [99]
466. Rob J. van Glabbeek. The linear time - branching time spectrum I: The
467. semantics of concrete, sequential processes. In J. A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, pages 3-99. Elsevier Science Publishers, 2001. [119, 120, 127, 128, 230]
468. Rob J. van Glabbeek, Scott A. Smolka, and Bernhard Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121:59-80, 1995. [240]
469. R. G. de Vries and J. Tretmans. Towards Formal Test Purposes. In E. Brinksma and J. Tretmans, editors, Proceedings of the 1st International Workshop on Formal Approaches to Testing of Software (FATES 2001), number BRICS NS-01-4 in BRICS Notes Series, pages 61-76, 2001. [422, 424]
470. Joachirn Wegener, André Baresel, and Harrnen Sthamer. Suitability of evolutionary algorithms for evolutionary testing. In Proceedings of the 26th IEEE International Computer Software and Applications Conference: Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), pages 287-289, Oxford, England, August 2002. IEEE Computer Society Press. [384]
471. J. Wegener. Evolutionärer Test des Zeitverhaltens von Realzeit-Systemen. Dissertation, Humboldt Universität zu Berlin, 2001. [383, 384]
472. C. H. West. Protocol validation in complex systems. In Proceedings of the ACM Symposium on Communications Architectures & Protocols (SIGCOMM 1989), pages 303-312, Austin, TX, September 1989. ACM Press. [421, 437]
473. Clazien D. Wezeman. The CO-OP method for compositional derivation of canonical testers. In E. Brinksma, G. Scollo, and C. A. Vissers, editors, Proceedings of the 9th International Symposium on Protocol Specification, Testing and Verification (PSTV 1990), pages 145-158. North-Holland, 1990. [166, 167, 168, 415, 417]
474. Clazien D. Wezeman. Deriving test from LOTOS specifications. In Tommaso Bolognesi, Jeroen van de Lagemaat, and Chris Vissers, editors, LOTOSphere: Software Development with LOTOS, pages 295-315. Kluwer Academic, 1995. [415, 417]
475. A. Wiles. ETSI testing activities and the use of TTCN-3. In Proceedings of the 10th International SDL Forum, 2001, volume 2078 of Lecture Notes in Computer Science, pages 123-128. Springer-Verlag, 2001. [466]
476. Mario Wolczko. Using a tracing java™ virtual machine to gather data on the behavior of java programs. Technical report, Sun Microsystems, March 1999. [531]
477. S.-H. Wu, S. A. Smolka, and E. W. Stark. Composition and behaviors of probabilistic I/O automata. In B. Jonsson and J. Parrow, editors, Proceedings of the 5th International Conference on Concurrency Theory (CONCUR 1994), volume 836 of Lecture Notes in Computer Science, pages 513-528, Uppsala, Sweden, August 1994. Springer-Verlag. [234]
478. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computations paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983), pages 185-194. IEEE Computer Society Press, 1983. Extended abstract. [567]
479. eXtreme Programming website, http://www.extremeprogramming.org/. [502]
480. M. Yannakakis and D. Lee. Testing finite state machines. In Baruch Awerbuch, editor, Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (STOC 1991), pages 476-485, New Orleans, LS, May 1991.
481. ACM Press. Extended abstract. An extended version appeared in the Journal of Computer and System Sciences, 50(2):209-227, April 1995. [98]
482. Jinsong Zhu and Samuel T. Chanson. Fault coverage evaluation of protocol test sequences. Technical Report TR-93-19, Department of Computer Science, University of British Columbia, June 1993. [110]
483. H. Zhu, P. Hall, and J. May. Software unit test coverage and adequacy. ACM Computing Surveys, 29(4):366-427, December 1997. [297, 300, 301]