Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Thesis Proposal: Practical Automated Theorem Proving with the
 

Summary: Thesis Proposal:
Practical Automated Theorem Proving with the
Polarized Inverse Method
Sean McLaughlin
May 1, 2009
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
Thesis Committee:
Jeremy Avigad CMU, Philosophy
Robert Harper CMU, SCS
Dale Miller ŽEcole Polytechnique
Frank Pfenning (Chair) CMU, SCS
AndrŽe Platzer CMU, SCS
Abstract
Mechanically checked, formal reasoning as envisioned by Leibniz has in the past few decades
become a reality. Proof assistants are programs that can rigorously and mechanically check the
details of logical arguments. Such formal reasoning has applications to nearly all areas of com-
puter science, from formal proof in mathematics to specifying and verifying critical properties of
hardware, software systems, and security protocols.

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics