Using formal tools to study complex circuits behaviour
暂无分享,去创建一个
[1] Pascal Raymond,et al. The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.
[2] Paul Amblard. A FINITE STATE DESCRIPTION OF THE EARLIEST LOGICAL COMPUTER: THE JEVONS' MACHINE , 1998 .
[3] Nicolas Halbwachs,et al. Programming and Verifying Real-Time Systems by Means of the Synchronous Data-Flow Language LUSTRE , 1992, IEEE Trans. Software Eng..
[4] Nicolas Halbwachs,et al. Synchronous Programming of Reactive Systems , 1992, CAV.
[5] Richard P. Paul. Sparc Architecture, Assembly Language Programming, and C , 1993 .
[6] Corporate. SPARC architecture manual - version 8 , 1992 .
[7] Kenneth L. McMillan,et al. Verification of Infinite State Systems by Compositional Model Checking , 1999, CHARME.
[8] Shi-Yu Huang,et al. AQUILA: An Equivalence Checking System for Large Sequential Designs , 2000, IEEE Trans. Computers.
[9] Daniel Kroening,et al. Proving the Correctness of Pipelined Micro-Architectures , 2000, MBMV.
[10] Nicolas Halbwachs,et al. Minimal State Graph Generation , 1992, Science of Computer Programming.
[11] Xiaowei Shen,et al. Using term rewriting systems to design and verify processors , 1999, IEEE Micro.
[12] Paul Amblard,et al. INTRODUCING DIGITAL CIRCUITS DESIGN AND FORMAL VERIFICATION CONCURRENTLY , 2000 .
[13] Mandayam K. Srivas,et al. Hardware Verification Using PVS , 1997, Formal Hardware Verification.