论文信息 - Formal verification of a microprocessor using equational techniques

Formal verification of a microprocessor using equational techniques

This paper develops a method for formally proving the correctness of a microprocessor using an equational method. The behavioral and structural specifications of the processor are expressed in a functional language. The asynchronous interaction between the memory and CPU is expressed in the specification by using a nondeterministic function random. This makes our specification more direct and natural than previous efforts based on a functional formalism. The previous efforts have had to encode in the specification the anticipated asynchronous interaction between the memory and the CPU.

R. C. Sekar | M. K. Srivas

[1] Niklaus Wirth,et al. The personal computer Lilith , 1981 .

[2] Harry G. Barrow,et al. VERIFY: A Program for Proving Correctness of Digital Hardware Designs , 1984, Artif. Intell..

[3] Mandayam K. Srivas,et al. ALGEBRAIC APPROACH TO THE SPECIFICATION AND REALIZATION OF VLSI DESIGNS. , 1985 .

[4] Peter Henderson,et al. Functional programming - application and implementation , 1980, Prentice Hall International Series in Computer Science.

[5] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[6] Dominique Borrione,et al. From HDL descriptions to guaranteed correct circuit designs : proceedings of the IFIP WG 10.2 Working Conference on from HDL Descriptions to Guaranteed Correct Circuit Designs, Grenoble, France, 9-11 September, 1986 , 1987 .