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
.
Theorem Proving for Verification
[chapter]
2001
Lecture Notes in Computer Science
The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges. ?
doi:10.1007/3-540-45510-8_2
fatcat:zkr5qrowengi7pdfitljv6ubv4