1 / 8

Automated Theorem Proving

Automated Theorem Proving. Frederico Araujo CS6362 – Fall 2010. Outline. What is automated theorem proving? ATP in software engineering ATP software Case study. What is automated theorem proving?.

travis-hodges
Download Presentation

Automated Theorem Proving

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Automated Theorem Proving Frederico Araujo CS6362 – Fall 2010

  2. Outline • What is automated theorem proving? • ATP in software engineering • ATP software • Case study

  3. What is automated theorem proving? Automated Theorem Proving (ATP) deals with the development of computer programs that show that some statement (the conjecture) is a logical consequence of a set of statements (the axioms and hypotheses)

  4. What is automated theorem proving?

  5. What is automated theorem proving? • High-quality software design • Formal method • Use of formal logic system to produce precise formal statements • Eliminates ambiguity (usually found in natural languages) • Automatic or guided by user

  6. ATP in software engineering • Requirements analysis and verification • Software creation and verification • Hardware verification Examples: communication protocols verification, algorithms, microprocessor verification, microcontrollers verification, requirements analysis and software specification, mission-critical, business-critical or safety-critical systems…

  7. ATP software • First order systems Otter, E, SPASS, Vampire,Waldmeister ... • Higher order systems HOL, PVS, ACL2, Coq, Nqthm … • Software Verification systems Spec#, KeY, …

  8. Case study • PVS tutorial by John Rushby

More Related