It was the sixth in the series of annual international.
Jeffrey J. Joyce, Carl-Johan H. Seger.
Theorem-proving and symbolic trajectory evaluation are both described as methods for the formal verification of hardware. They are both used to achieve a common goal--correctly designed hardware--and both are intended to be an alternative to conventional methods based on non-exhaustive simulation. However, they have different strengths and weaknesses.
Author: Jeffrey J. Joyce Carl-Johan H. TPHOLs'98 Discrete Mathematics and It. .
Format: Print Replica
A: Computer Science and Technology). Format: Print Replica.
Bibliographic content of HUG 1993. Lecture Notes in Computer Science 780, Springer 1994, ISBN 3-540-57826-9.
In J. J. Joyce and . Canada, August 1993. Springer-Verlag, 1994.
Flemming Andersen, Kim Dam Petersen (auth.
Jeffrey J. Seger (ed. Flemming Andersen, Kim Dam Petersen (auth.
Milner, R. and Wadsworth, C. Edinburgh LCF: a mechanised logic of computation, Lecture Notes in Comput. Sci. 78 (Springer, 1979). 9Harrison, John, ‘Binary decision diagrams as a HOL derived rule’, The Computer Journal 38 (1995) 162–170. 10Hazelhurst, Scott, and Seger, Carl-Johan . ‘Symbolic trajectory evaluation’, Formal hardware verification (ed. Kropf, Thomas, Springer, 1997) 3–78.