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 149<br />
[93] J. C. Madre, O. Cou<strong>de</strong>rt, “Formal Verification of Digital Circuits Using a Propositional<br />
Theorem Prover”, in Proc. of the IFIP Working Conference on the CAD<br />
Systems Using AI Techniques, Tokyo, juin 1989.<br />
[94] J. C. Madre, “PRIAM, Un Outil <strong>de</strong> <strong>Preuve</strong> <strong>Formelle</strong> <strong>de</strong> Circuits Digitaux”, Thèse<br />
<strong>de</strong> troisième cycle, Ecole Nationale Supérieure <strong>de</strong>s Télécommunications, juin 1990.<br />
[95] J. C. Madre, O. Cou<strong>de</strong>rt, “A Logically Complete Reasoning Maintenance System<br />
Based on a Logical Constraint Solver”, in Proc. of the International Join Conference<br />
on Artificial Intelligence (IJCAI), Sydney, Australia, août 1991.<br />
[96] S.Malik, A.R.Wang, R.K.Brayton, A.Sangiovanni-Vincentelli, “LogicVerification<br />
using Binary Decision Diagrams in a Logic Synthesis Environment”, in Proc. of<br />
ICCAD’88, Santa C<strong>la</strong>ra, USA, pp. 6–9, novembre 1988.<br />
[97] T. F. Melham, “Abstraction Mechanisms for Hardware Verification”, in VLSI Specification,<br />
Verification and Synthesis, G. Birtwistle and P. A. Subrahmanyam Editors,<br />
Kluwer Aca<strong>de</strong>mic Publishers, 1988.<br />
[98] E. Men<strong>de</strong>lson, Introduction to Mathematical Logic, Wadsworth and Brooks, 1987.<br />
[99] G. J. Milne, “The Correctness of a Simple Silicon Compiler”, Internal Report CSR-<br />
127-83, Computer Science Department, University of Edinbourgh, Scot<strong>la</strong>nd, UK,<br />
1983.<br />
[100] S. Minato, N. Ishiura, S. Yajima, “Fast Tautology Checking Using Shared Binary<br />
Decision Diagrams - Experimental Results”, in Formal VLSI Correctness Verification,<br />
L.J.M. C<strong>la</strong>esen Editor, North-Hol<strong>la</strong>nd, pp. 107–111, novembre 1989.<br />
[101] S.Minato, N.Ishiura, S.Yajima, “SharedBinaryDecisionDiagramswithAttributed<br />
Edges for Efficient Boolean Function Manip<strong>la</strong>tion”, in Proc. of the 27th DAC, Las<br />
Vegas NA, USA, pp. 52–57, juin 1990.<br />
[102] B. M. E. Moret, “Decision Trees and Diagrams”, Computing Surveys, Vol 14, N o 14,<br />
1982.<br />
[103] V. Pitchumani, E. P. Stabler, “A Formal Method for Computer Design Verification”,<br />
in Proc. of the 19th DAC, juillet 1982.<br />
[104] C. Pixley, “A Computational Theory and Implementation of Sequential Hardware<br />
Equivalence”, in Computer-Ai<strong>de</strong>d Verification’90, E. M. C<strong>la</strong>rke and R. P Kurshan<br />
Editors, DIMACS Series, pp. 293–320, juin 1990.<br />
[105] J. P. Queille, J. Sifakis, “Fairness and Re<strong>la</strong>ted Properties in Transition Systems”,<br />
Acta Informatica, pp. 195–220, 1983.<br />
[106] C. Ratel, LGI Grenoble, communication privée, 1991.<br />
[107] R.Reiter,“ATheoryofDiagnosisfromFirstPrinciples”,Artificial Intelligence N o 32,<br />
Elsevier Science Publishers, 1987.