Lecture Notes in Computer Science 3472

Literature 639
[Mel88] Thomas Melham. Abstraction mechanisms for hardware verification. In
G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification,
and Synthesis, volume35ofThe Kluwer International Series in Engineering
and Computer Science, pages 129–157. Kluwer Academic, Boston,
1988. [455]
[Mey79] G. Meyer. The Art of Software Testing. John Wiley & Sons, Inc., 1979.
[297]
[Mey92] Bertrand Meyer. Design by contract. IEEE Computer, 25(10):40–52, October
1992. [531]
[Mey01] 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]
[MH99] V. Matena and M. Hapner. Enterprise javabeans TM specification. Public
Draft version 1.1, Sun Microsystems, 1999. [528]
[Mil80] R. Milner. A Calculus for Communicating Processes, volume92ofLecture
Notes in Computer Science. Springer-Verlag, 1980. [119, 129, 145]
[Mil89] Robin Milner. Communication and concurrency. Prentice-Hall, 1989. [362,
565, 602]
[MK99] Jeff Magee and Jeff Kramer. Concurrency: State Models & Java Programs.
John Wiley & Sons, 1999. [423, 424]
[ML97] Aloysius K. Mok and Guangtian Liu. Efficient run-time monitoring of timing
constraints. In IEEE Real-Time Technology and Applications Symposium,
June 1997. [531]
[Moo56] 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]
[MOSS99] 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]
[MP93] 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]
[MP95] O. Maler and A. Pnueli. On the learnability of infinitary regular sets.
Information and Computation, 118(2):316–326, 1 May 1995. [599]
[MP05] 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]
[MRS + 97] 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]
[MS99] Alexandru Mateescu and Arto Salomaa. Many-valued truth functions,
čern´y’s conjecture and road coloring. Bulletin of the EATCS, 68:134–150,
June 1999. [32]
[MSF] Microsoft Research – Foundations of Software Engineering.
http://research.microsoft.com/fse/. [412]