Proc. of a conference on Functional programming languages and computer architecture
Application of term rewriting techniques to hardware design verification
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A high performance routing engine
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Models and logic of MOS circuits
Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Computer experiments with the REVE term rewriting system generator
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Future Directions for VLSI and Software Engineering
VLSI Engineering: Beyond Software Engineering
muFP, a language for VLSI design
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
HOPE: An experimental applicative language
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Fm8501: a verified microprocessor (theorem-proving, computers, design)
Fm8501: a verified microprocessor (theorem-proving, computers, design)
Dynamic Functional Testing for VLSI Circuits
IEEE Design & Test
Hi-index | 0.00 |
Formal methods are applied with increased frequency in the specification and verification of digital systems as an alternative to traditional methods of establishing correctness, such as simulation and testing. This article briefly outlines the goals and the philosophy of the HArdware VErification project at the Department of Computer Science within the University of Manchester. Our objective here is to report on the results of a first controlled experiment comparing formalisms and systems that are currently used for formally specifying and verifying both hardware and software systems. Our strategy consists of working with incrementally “harder” test cases, which are used to investigate the characteristics and thus the pros and cons of each formalism. The example used is a purely combinational device.