A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
An integration of model checking with automated proof checking
[chapter]
1995
Lecture Notes in Computer Science
A b s t r a c t . Although automated proof checking tools for generalpurpose logics have been successfully employed in the verification of digital systems, there are inherent limits to the efficient automation of expressive logics. If the expressiveness is constrained, there are useful logic fragments for which efficient decision procedures can be found. The model checking paradigm yields an important class of decision procedures for establishing temporal properties of finite-state systems.
doi:10.1007/3-540-60045-0_42
fatcat:inwlv6nsyzdgzjbzrk3qhrrjri