Abstract
Different theorem-proving systems have different things to recommend them: automatic proiiers such as the Boyer-Moore prover or a number of resolution systems minimize human intervention in proving simple first-order assertions, but systems such as HOL or. Nuprl that are based on a more powerful logic better support reasoning about higher abstractions. In typical verification systems, a verifier is limited to the choice of a single theorem-prover. The proof manager PM is intended to allow a verifier to choose among several theorem-proving systems during the course of a single proof. We report on its current status as a HOL interface, and our initial design of a translation scheme that, when possible, transforms HOL input into firstorder assertions suited to the Boyer-Moore prover or automatic first-order provers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
