Une Boite `a Outils Pour la Preuve Formelle de Syst`emes Séquentiels

144 BIBLIOGRAPHIE
[14] G. Berry, “A Hardware Implementation of ESTEREL”, in Proc. of 1991 International
Workshop on Formal Methods in VLSI Design, Miami FL, USA, janvier 1991.
[15] G. Berry, “ESTEREL on Hardware”, in Proc. of The Royal Society Discussion Meeting
on Mechanized Reasoning abd Hardware Design, London, UK, octobre 1991.
[16] G. Berry et all., “The ESTEREL Language”, in IEEE Special Issue on Synchronous
Languages, septembre 1992.
[17] C. Berthet, O. Coudert, J. C. Madre, “New Ideas on Symbolic Manipulations of
Finite State Machines”, in Proc. of ICCD’90, Cambridge MA, USA, septembre 1990.
[18] J. P. Billon, “Perfect Normal Forms for Discrete Functions”, BULL Research Report
N o 87019, juin 1987.
[19] J. P. Billon, “Symbolic Execution of Discrete Programs”, BULL Research Report
N o 87039, Septembre 1987.
[20] D. Borrione, J. L. Paillet, L. Pierre, H. Collavizza, “Modélisation Fonctionnelle et
Preuve de Circuits Digitaux”, TSI, Vol. 8, N o 6, pp. 523–544, 1989.
[21] S. Bose, A. Fisher, “Automatic Verification of Synchronous Circuits Using Symbolic
Logic Simulation and Temporal Logic”, in Formal VLSI Correctness Verification,
L.J.M. Claesen Editor, North-Holland, pp. 151–158, novembre 1989.
[22] A. Bouajjani, J. C. Fernandez, N. Halbwachs, “Verification of Safety Properties”,
avril 1990.
[23] A. Bouajjani, J. C. Fernandez, N. Halbwachs, “Minimal Model Generation”, in
Computer-Aided Verification’90, E. M. Clarke and R. P Kurshan Editors, DIMACS
Series, pp. 85–91, juin 1990.
[24] A. Boudet, J. P. Jouannaud, “Unification in Boolean Rings and Abelian Groups”,
special issue of JSC, mai 1988.
[25] R. K. Brayton, G. D. Hachtel, C. T. McMullen, A. L. Sangiovanni-Vincentelli, Logic
Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, 1984.
[26] F. M. Brown, Boolean Reasoning, Kluwer Academic Publishers, 1990.
[27] R.E.Bryant,“Graph-BasedAlgorithmsforBooleanFunctionsManipulation”,IEEE
Transactions on Computers, Vol C35, N 0 8, pp. 677–692, août 1986.
[28] R. E. Bryant, “On the Complexity of VLSI Implementations and Graph Representations
of Boolean Functions with Application to Integer Multiplication”, Carnegie
Mellon University Research Report, septembre 1988.
[29] S. Burch, E. M. Clarke, K. L. McMillan, “Symbolic Model Checking: 10 20 States
and Beyond”, in Proc. of LICS, 1990.
[30] S. Burch, E. M. Clarke, K. L. McMillan, “Sequential Circuit Verification Using
Symbolic Model Checking”, in Proc. of 27th DAC, Orlando FL, USA, juillet 1990.