Lecture Notes in Computer Science 3472

630 Literature
[GL02] Hubert Garavel and Frédéric Lang. NTIF: A general symbolic model
for communicating sequential processes with data. In Doron Peled and
[GO01]
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]
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]
[Gog01] 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]
[Göh98] Wolf Göhring. Minimal initializing word: a contribution to Čern´y’s conjecture.
Journal of Automata, Languages and Combinatorics, 2(4):209–226,
1998. [6, 31]
[Gol89] David E. Goldberg. Genetic Algorithms in Search, Optimization & Machine
Learning. Addison-Wesley, 1989. [383]
[Gon01] L. Gong. JXTA: A network programming environment. IEEE Internet
[GPY02]
Computing, 5(3):88–95, May/June 2001. [528]
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]
[GRMD01] 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]
[GRR03] A. Gargantini, E. Riccobene, and S. Rinzivillo. Using Spin to generate tests
from ASM specifications. In E. Börger, 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]
[Gru68] F. Gruenberger. Computers and communication: Toward a computer utility.
Prentice-Hall, 1968. [554]
[GS97] 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]
[GSDH97] 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]