论文信息 - Inverting the Abstraction Mapping: A Methodology for Hardware Verification

Inverting the Abstraction Mapping: A Methodology for Hardware Verification

Abstraction mappings have become a standard approach to verifying the correctness of processors. When used in a straightforward manner this approach suffers from generating extremely large intermediate terms that have to be simplified.

David Cyrluk | D. Cyrluk

[1] Jan van Leeuwen,et al. Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[2] Jonathan P. Bowen,et al. Applications of Formal Methods , 1995 .

[3] Natarajan Shankar,et al. Effective Theorem Proving for Hardware Verification , 1994, TPCD.

[4] Thomas Kropf,et al. Theorem Provers in Circuit Design , 1995, Lecture Notes in Computer Science.

[5] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6] S. Mazzanti,et al. A Correctness Proof for Pipelining in RISC Architecture , 1996 .

[7] Natarajan Shankar,et al. Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..

[8] Martín Abadi,et al. The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[9] David Cyrluk,et al. Microprocessor Verification in PVS - A Methodology and Simple Example , 1993 .

[10] Wolfgang Thomas,et al. Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[11] Paliath Narendran,et al. Ground Temporal Logic: A Logic for Hardware Verification , 1994, CAV.

[12] David L. Dill,et al. Automatic verification of Pipelined Microprocessor Control , 1994, CAV.