A Compositional Rule for Hardware Design Refinement
暂无分享,去创建一个
[1] R. P. Kurshan,et al. Reducibility in analysis of coordination , 1988 .
[2] Thomas A. Henzinger,et al. Reactive Modules , 1999, Formal Methods Syst. Des..
[3] Amir Pnueli,et al. In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.
[4] Robert P. Kurshan,et al. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .
[5] David L. Dill,et al. Automatic verification of Pipelined Microprocessor Control , 1994, CAV.
[6] Orna Grumberg,et al. Model checking and modular verification , 1994, TOPL.
[7] Randal E. Bryant,et al. Formally Verifying a Microprocessor Using a Simulation Methodology , 1994, 31st Design Automation Conference.
[8] Kenneth L. McMillan,et al. Symbolic model checking , 1992 .
[9] Pierre Wolper. Temporal Logic Can Be More Expressive , 1983, Inf. Control..
[10] David Cyrluk,et al. Inverting the Abstraction Mapping: A Methodology for Hardware Verification , 1996, FMCAD.
[11] Allan L. Fisher,et al. Verifying pipelined hardware using symbolic logic simulation , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[12] Leslie Lamport,et al. Specifying Concurrent Program Modules , 1983, TOPL.
[13] David L. Dill,et al. Efficient validity checking for processor verification , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).