Lecture Notes in Computer Science 3472

Literature 637
[KV94] M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning
Theory. The MIT Press, Cambridge, Massachusetts and London, England,
1994. [590, 595]
[KVZ98] 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]
[Kwa62] Mei-Ko Kwan. Graphic programming using odd or even points. Chinese
Math, 1:273–277, 1962. [92]
[Lai02] Richard Lai. A survey of communication protocol testing. Journal of Systems
and Software, 62(1):21–46, May 2002. [3]
[Lal85] P. Lala. Fault Tolerant and Fault Testable Hardware Design. Prentice-Hall
International, 1985. [70]
[Lan90] 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]
[LBGG94] 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]
[LDW03] 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]
[Lit] Lite ftp and web sites. ftp://ftp.cs.utwente.nl/pub/src/lotos-tools/ and
http://fmt.cs.utwente.nl/tools/lite/. [414, 417]
[LKK + 99] 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]
[LLC03] Glen McCluskey & Associates LLC. Java tm test coverage and instrumentation
toolkits. http://www.glenmccl.com/, 2003. [530]
[LP81] H. R. Lewis and C. H. Papadimitriou. Elements of the Theory of Computation.
Prentice-Hall, Englewood Cliffs, 1981. [92]
[LP01] 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]
[LPU02] B. Legeard, F. Peureux, and M. Utting. Automated Boundary Testing from
ZandB.InProceedings 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]
[LPU04] 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]