Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving [chapter]

Mark D. Aagaard, Robert B. Jones, Carl-Johan H. Seger
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
more » ... y embedding in itself. The approach is a pragmatic solution that provides an e cient and extensible veri cation environment. Our approach is generally applicable to any dialect of the ML programming language and any m o d e l -c hecking algorithm that has practical inference rules for combining results.
doi:10.1007/3-540-48256-3_22 fatcat:hykbeosjcvgcrlrnwx76oulviq