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

Recommendations

Info

BIBLIOGRAPHIE 147 [62] P. Flajolet, P. Sipala, J. M. Steyaert, “Analytic Variations on the Common Subexpression Problem”, Rapport de Recherche INRIA N o 1210, avril 1990. [63] S. J. Friedman, K. J. Supowit, “Finding the Optimal Variable Ordering for Binary Decision Diagrams”, IEEE Transactions on Computer, Vol C-39, N o 5, pp. 710–713, mai 1990. [64] M. Fujita, H. Fujisawa, N. Kawato, “Evaluation and Improvements of a Boolean Comparison Method Based on Binary Decision Diagrams”, in Proc. of ICCAD’88, Santa Clara, USA, pp. 2–5, novembre 1988. [65] J. H. Gallier, Logic for Computer Science – Foundations of Automated Theorem Proving, Harper and Row Publishers, New York, 1986. [66] A. Ghosh, S. Devadas, A. R. Newton, “Test Generation for Highly Sequential Circuits”, in Proc. of ICCAD’89, Santa-Clara CA, USA, novembre 1989. [67] M. J. C. Gordon, “LCF-LSM”, Technical Report N o 41, Computer Laboratory, University of Cambridge, England, 1983. [68] M. J. C. Gordon, “Proving a Computer Correct”, Technical Report N o 42, Computer Laboratory, University of Cambridge, England, 1984. [69] I. P. Goulden, D. M. Jackson, Combinatorial Enumeration, Wiley-Interscience Series in Discrete Mathematics, J. Wiley and Sons, 1983. [70] A. Greiner, F. Gourdy, R. Marbot, J. Y. Murzin, M. Guillemet, “Noisy : An Electrical Noise Checker for VLSI Circuits”, in Proc. of ICCAD’88, Santa Clara, USA, novembre 1988. [71] N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud, “The Synchronous Data-Flow Programming Language LUSTRE”, in IEEE Special Issue on Synchronous Languages, pp. 1305–1320, septembre 1992. [72] G. Huet, “Résolution d’Equations dans les Langages d’Ordre 1, 2, ..., ω”, Thèse d’Etat, Université Paris 7, 1976. [73] G. Huet, D. C. Oppen, “Equations and Rewrite Rules: A Survey”, Academic Press Inc., 1980. [74] G. J. Holtzman, “Algorithms for Automated Protocol Validation”, in Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, juin 1989. [75] J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Mass., 1979. [76] J. Hsiang, Topics in Automated Theorem Proving and Program Generation, PhD Thesis, University of Urbana Champaign, Illinois, 1983. [77] J. Hsiang, “Refutational Theorem Proving Using Term Rewriting Systems”, Artificial Intelligence N o 25, pp. 255–300, 1985.
148 BIBLIOGRAPHIE [78] J.Hsiang,“RewriteMethodsforTheoremProvinginFirstOrderTheorywithEquality”, Journal of Symbolic Computation N o 3, pp. 133–151, 1987. [79] W. A. Hunt, “FM8501: A Verified Microprocessor”, in Proc. of the IFIP WG 10.2 Workshop: From HDL Descriptions to Guaranteed Correct Circuit Designs, North Holland Publishing, 1986. [80] S.H.Hwang, A.R.Newton, “AnefficientDesignCorrectnessCheckerofFiniteState Machines”, in Proc. of ICCAD’87, Santa Clara, USA, novembre 1987. [81] S. W. Jeong, B. Plessier, G. D. Hachtel, F. Somenzi, “Variable Ordering for FSM Traversal”, in Proc. of the MCNC Workshop, North Carolina, USA, mai 1991. [82] S. C. Kleene, Mathematical Logic, John Wiley and Sons, NY, 1967 [83] S. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, New York, 1978. [84] R. P. Kurshan, “Analysis of discrete Event Coordination”, in Lecture Notes in Computer Science, Springer-Verlag, pp. 414–453, 1990. [85] B. Lin, H. J. Touati, A. R. Newton, “Don’t Care Minimization of Multi-Level Sequential Logic Networks”, in Proc. of ICCAD’90, Santa-Clara CA, USA, novembre 1990. [86] B. Lin, “Efficient Symbolic Manipulation of Equivalence Relations and Classes”, in Proc. of the International Workshop on Logic Synthesis, MCNC North Carolina, USA, mai 1991. [87] R.Lipsett, C.Schaefer, C.Ussery, VHDL: Hardware Description and Design, Kluwer Academic Publishers, 1989. [88] K. L. McMillan, J. Schwalbe, “Formal Verification of the Encore Gigamax Cache Consistency Protocol”, in International Symposium on Shared Memory Multiprocessors, 1991. [89] J. C. Madre, J. P. Billon, “Proving Circuit Correctness using Formal Comparison Between Expected and Extracted Behaviour”, in Proc. of the 25th DAC, Anaheim CA, USA, juillet 1988. [90] J.C.Madre, J.P.Billon, O.Coudert, M.Currat, “ApplyinganAutomatedTheorem ProvingTechniquetoHardwareVerification”,inProgress in Computer Aided Design, Volume 5, Ablex Publishing, USA, 1990. [91] J. C. Madre, O. Coudert, M. Currat, A. Debreil, C. Berthet, “The Formal Verification Chain at BULL”, in Proc. of the EUROASIC Conference, Paris, France, juin 1990. [92] J. C. Madre, O. Coudert, “Automating the Diagnosis and the Rectification of Design Errors with PRIAM”, in Proc. of ICCAD’89, Santa Clara, USA, novembre 1989.
Page 1 and 2:
THESE présentée pour obtenir le t
Page 3 and 4:
A mes parents A Toi, si délicieuse
Page 5 and 6:
2 2.4.4 Forme sans quantificateur d
Page 8 and 9:
Liste de Figures Représentation de
Page 10 and 11:
Liste de Tableaux Représentation d
Page 12 and 13:
INTRODUCTION 9 Introduction Motivat
Page 14 and 15:
INTRODUCTION 11 la vérification de
Page 16 and 17:
INTRODUCTION 13 Le Chapitre 2 étud
Page 18:
Partie I Logique propositionnelle q
Page 21 and 22:
18 CHAPITRE 1. LOGIQUE PROPOSITIONN
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
28 CHAPITRE 2. REPRÉSENTATION DES
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 72 and 73:
Chapitre 3 Problèmes sur les machi
Page 74 and 75:
3.2. COMPARAISON DE MACHINES SÉQUE
Page 76 and 77:
3.2. COMPARAISON DE MACHINES SÉQUE
Page 78 and 79:
3.3. VÉRIFICATION DE PROPRIÉTÉS
Page 80 and 81:
3.3. VÉRIFICATION DE PROPRIÉTÉS
Page 82 and 83:
3.4. MINIMISATION DE MACHINES SÉQU
Page 84 and 85:
3.4. MINIMISATION DE MACHINES SÉQU
Page 86 and 87:
3.5. CONCLUSION 83 suivants.
Page 88 and 89:
Chapitre 4 Calcul de l’image d’
Page 90 and 91:
4.2. CALCUL DIRECT DE IMG( ⃗ F,χ
Page 92 and 93:
4.3. DÉCOMPOSITION DU CALCUL DE L
Page 94 and 95:
4.3. DÉCOMPOSITION DU CALCUL DE L
Page 96 and 97:
4.4. RESTRICTEUR D’IMAGE 93 du Th
Page 98 and 99:
4.5. L’OPÉRATEUR “CONSTRAIN”
Page 100 and 101: 4.5. L’OPÉRATEUR “CONSTRAIN”
Page 102 and 103: 4.5. L’OPÉRATEUR “CONSTRAIN”
Page 104 and 105: 4.6. CHOIX D’UNE COUVERTURE 101 l
Page 106 and 107: 4.7. RÉSULTATS EXPÉRIMENTAUX ET D
Page 108 and 109: 4.7. RÉSULTATS EXPÉRIMENTAUX ET D
Page 110 and 111: 4.8. CONCLUSION 107 4.8 Conclusion
Page 112 and 113: Chapitre 5 Calcul de l’image réc
Page 114 and 115: 5.2. CALCUL DE PRE( F,CNS,χ) ⃗
Page 116 and 117: 5.3. EVALUATION DE PRE( ⃗ F,CNS,
Page 118 and 119: 5.3. EVALUATION DE PRE( ⃗ F,CNS,
Page 120 and 121: 5.5. CONCLUSION 117 graphes de la f
Page 122 and 123: CONCLUSION 119 Conclusion Lavérifi
Page 124: Annexes 121
Page 127 and 128: 124 ANNEXE A. TERME, RÉÉCRITURE,
Page 129 and 130: 126 ANNEXE B. AUTRES GRAPHES TYPÉS
Page 135 and 136: 132 ANNEXE C. DÉNOTATION D’ENSEM
Page 137 and 138: 134 ANNEXE D. ENSEMBLE DE FONCTIONS
Page 139 and 140: 136 ANNEXE D. ENSEMBLE DE FONCTIONS
Page 141 and 142: 138 ANNEXE E. RÉDUCTION ET MINIMIS
Page 147 and 148: 144 BIBLIOGRAPHIE [14] G. Berry,
Page 149: 146 BIBLIOGRAPHIE [47] O. Coudert,
Page 153 and 154: 150 BIBLIOGRAPHIE [108] D. E. Ross,
Page 155 and 156: 152 BIBLIOGRAPHIE
Page 157 and 158: 154 INDEX ⇓ (restrict), 111, 138
Page 159: 156 INDEX redondante, 80 vectochar,
show all

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

Create successful ePaper yourself

Delete template?

Save as template?