A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
[chapter]
1999
Lecture Notes in Computer Science
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We h a ve constructed a system that seamlessly integrates symbolic trajectory evaluation based model checking with theorem proving in a higher-order classical logic. The approach is made possible by using the same programming language ( ) as both the meta and object language of theorem proving. This is done by \lifting" , e s s e n tially
doi:10.1007/3-540-48256-3_22
fatcat:hykbeosjcvgcrlrnwx76oulviq