Scalable hybrid verification of complex microprocessors
暂无分享,去创建一个
Todd M. Austin | Karem A. Sakallah | Fadi A. Aloul | Christopher T. Weaver | Maher N. Mneimneh | Saugata Chatterjee | K. Sakallah | T. Austin | F. Aloul | M. Mneimneh | Saugata Chatterjee
[1] Todd M. Austin,et al. Efficient checker processor design , 2000, Proceedings 33rd Annual IEEE/ACM International Symposium on Microarchitecture. MICRO-33 2000.
[2] K. Sakallah,et al. A New Search Algorithm for Satisfiability , 1996 .
[3] Mark Bickford,et al. Formal verification of a pipelined microprocessor , 1990, IEEE Software.
[4] David Cyrluk,et al. Microprocessor Verification in PVS - A Methodology and Simple Example , 1993 .
[5] Karem A. Sakallah,et al. Efficient Verification of the PCI Local Bus using Boolean Satisfiability , 2000 .
[6] Randal E. Bryant,et al. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic , 1999, TOCL.
[7] Todd M. Austin. DIVA: A Dynamic Approach to Microprocessor Verification , 2000, J. Instr. Level Parallelism.
[8] David L. Dill,et al. Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.
[9] Jeffrey J. Joyce,et al. Formal Verification and Implementation of a Microprocessor , 1988 .
[10] David L. Dill,et al. Automatic verification of Pipelined Microprocessor Control , 1994, CAV.
[11] Warren A. Hunt. FM8501: A Verified Microprocessor , 1994, Lecture Notes in Computer Science.
[12] Wilhelm Ackermann,et al. Solvable Cases Of The Decision Problem , 1954 .
[13] Alan J. Hu,et al. Monitor-Based Formal Specification of PCI , 2000, FMCAD.
[14] Hai Zhou,et al. BDD Based Procedures for a Theory of Equality with Uninterpreted Functions , 2003, Formal Methods Syst. Des..
[15] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.