CHARME
2003
Springer
14 years 20 days ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
CHARME
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. As of version 2.7, the ACL2 theorem prover has been extended to automatically verify sets of polynomial inequalities that include nonlinear relationships. In this paper w...
CHARME
2003
Springer
14 years 20 days ago
2003
Springer
CHARME
2003
Springer
14 years 20 days ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...