Lecture Notes in Computer Science 3472

Literature 629
[Gei01] M. Geilen. On the construction of monitors for temporal logic properties.
In K. Havelund and G. Ro¸su, 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]
[GG75] 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]
[GG93] Matthias Grochtmann and Klaus Grimm. Classification trees for partition
testing. Software Testing, Verification and Reliability, 3(2):63–82, 1993.
[330]
[GGSV02] 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]
[GH99] 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]
[GH03] 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]
[GHHD04] 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]
[GHR93] 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]
[Gil61] Arthur Gill. State-identification experiments in finite automata. Information
and Control, 4(2–3):132–154, September 1961. [12, 24, 30, 36]
[Gin58] 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]
[GJ79] 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]
[GJL04] O. Grinchtein, B. Jonsson, and M. Leucker. Learning of event-recording
automata. Technical report, Uppsala University, 2004. [597, 599]
[GJS97] J. Gosling, B. Joy, and G. Steele. The Java Language Specification. The
Sunsoft Press Java Series. Addison-Wesley, New York, 1997. [444]