Une Boite `a Outils Pour la Preuve Formelle de Syst`emes Séquentiels
Une Boite `a Outils Pour la Preuve Formelle de Syst`emes Séquentiels
Une Boite `a Outils Pour la Preuve Formelle de Syst`emes Séquentiels
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
BIBLIOGRAPHIE 147<br />
[62] P. F<strong>la</strong>jolet, P. Sipa<strong>la</strong>, J. M. Steyaert, “Analytic Variations on the Common Subexpression<br />
Problem”, Rapport <strong>de</strong> Recherche INRIA N o 1210, avril 1990.<br />
[63] S. J. Friedman, K. J. Supowit, “Finding the Optimal Variable Or<strong>de</strong>ring for Binary<br />
Decision Diagrams”, IEEE Transactions on Computer, Vol C-39, N o 5, pp. 710–713,<br />
mai 1990.<br />
[64] M. Fujita, H. Fujisawa, N. Kawato, “Evaluation and Improvements of a Boolean<br />
Comparison Method Based on Binary Decision Diagrams”, in Proc. of ICCAD’88,<br />
Santa C<strong>la</strong>ra, USA, pp. 2–5, novembre 1988.<br />
[65] J. H. Gallier, Logic for Computer Science – Foundations of Automated Theorem<br />
Proving, Harper and Row Publishers, New York, 1986.<br />
[66] A. Ghosh, S. Devadas, A. R. Newton, “Test Generation for Highly Sequential Circuits”,<br />
in Proc. of ICCAD’89, Santa-C<strong>la</strong>ra CA, USA, novembre 1989.<br />
[67] M. J. C. Gordon, “LCF-LSM”, Technical Report N o 41, Computer Laboratory, University<br />
of Cambridge, Eng<strong>la</strong>nd, 1983.<br />
[68] M. J. C. Gordon, “Proving a Computer Correct”, Technical Report N o 42, Computer<br />
Laboratory, University of Cambridge, Eng<strong>la</strong>nd, 1984.<br />
[69] I. P. Goul<strong>de</strong>n, D. M. Jackson, Combinatorial Enumeration, Wiley-Interscience Series<br />
in Discrete Mathematics, J. Wiley and Sons, 1983.<br />
[70] A. Greiner, F. Gourdy, R. Marbot, J. Y. Murzin, M. Guillemet, “Noisy : An Electrical<br />
Noise Checker for VLSI Circuits”, in Proc. of ICCAD’88, Santa C<strong>la</strong>ra, USA,<br />
novembre 1988.<br />
[71] N. Halbwachs, P. Caspi, P. Raymond, D. Pi<strong>la</strong>ud, “The Synchronous Data-Flow Programming<br />
Language LUSTRE”, in IEEE Special Issue on Synchronous Languages,<br />
pp. 1305–1320, septembre 1992.<br />
[72] G. Huet, “Résolution d’Equations dans les Langages d’Ordre 1, 2, ..., ω”, Thèse<br />
d’Etat, Université Paris 7, 1976.<br />
[73] G. Huet, D. C. Oppen, “Equations and Rewrite Rules: A Survey”, Aca<strong>de</strong>mic Press<br />
Inc., 1980.<br />
[74] G. J. Holtzman, “Algorithms for Automated Protocol Validation”, in Proc. of the<br />
Workshop on Automatic Verification Methods for Finite State Systems, Grenoble,<br />
juin 1989.<br />
[75] J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and<br />
Computation, Addison-Wesley, Reading, Mass., 1979.<br />
[76] J. Hsiang, Topics in Automated Theorem Proving and Program Generation, PhD<br />
Thesis, University of Urbana Champaign, Illinois, 1983.<br />
[77] J. Hsiang, “Refutational Theorem Proving Using Term Rewriting Systems”, Artificial<br />
Intelligence N o 25, pp. 255–300, 1985.