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

Bibliographie
[1] M. Abadi, L. Lamport, “Composing Specifications”, DEC report, 1990. Also in
“Stewise Refinement of Distributed Systems: Models, Formalism, Correctness”, Vol.
430 of Lectures Notes in Computer Science, Springer-Verlag, Berlin, 1990.
[2] L.Albert,“PrésentationetEvaluationdelaComplexitéenMoyennedesAlgorithmes
d’Unification”, Rapport de recherche INRIA N o 1212, avril 1990.
[3] L. Albert, “Average Case Complexity Analysis of RETE Pattern-Matching Algorithm
and Average Size of Join in Databases”, 9th Conference on Foundations of
Software Technology and Theorical Computer Science, Lecture Notes in Computer
Science N o 405, Springer-Verlag, 1989.
[4] S. B. Akers, “Binary Decision Diagrams”, IEEE Transactions on Computers, Vol C-
27, N o 6, 1978.
[5] F. Anceau, “Design Methodology for Large Custom Processors”, in Proc. of the 1986
ESSIR Conference, Delft, USA, 1986.
[6] F. Anceau, C. Berthet, J. C. Madre, O. Coudert, J. P. Billon, “La Preuve Formelle
en Milieu Industriel”, in TSI, Vol. 8, N o 6, 1989.
[7] J. R. Armstrong, Chip-Level Modeling With VHDL, Prentice Hall, 1989.
[8] P. Ashar, A. Ghosh, S. Devadas, A. R. Newton, “Combinational and Sequential
Logic Verification Using General Binary Decision Diagrams”, in Proc. of MCNC
workshop, North Carolina, USA, mai 1991.
[9] H. G. Barrow, “Verify: A Program for Proving Correctness of Digital Hardware
Designs”, Artificial Intelligence 24, 1984.
[10] C. Bayol, J. L. Paillet, “Using Tache for Proving Circuits”, in Formal VLSI Correctness
Verification, L.J.M. Claesen Editor, North-Holland, pp. 83–87, novembre
1989.
[11] Beckman F.S., Mathematical Foundations of Programming, Addison-Wesley, 1980.
[12] C. L. Berman, “Circuit Width, Register Allocation, and Reduced Function Graphs”,
IBM Research Report RC 14129, 1989.
[13] C. L. Berman, “Ordered Binary Decision Diagrams and Circuit Structure”, in Proc.
of ICCD’89, USA, septembre 1989.
143