a proof repository for formal verification of software
play

A Proof Repository for Formal Verification of Software Michael - PowerPoint PPT Presentation

A Proof Repository for Formal Verification of Software Michael Franssen WASDeTT- 3 September 20 th 2010 Cocktail Derive programs from their specifications Does not scale and nobody programs like this Create proofs interactively with an


  1. A Proof Repository for Formal Verification of Software Michael Franssen WASDeTT- 3 September 20 th 2010

  2. Cocktail � Derive programs from their specifications Does not scale and nobody programs like this � Create proofs interactively with an proof assistant based on type lambda calculus (with a GUI providing Fitch-style notation) User friendly, but much automation desired � Custom built tableaux based automated theorem prover Much too weak and an awfull lot of work / Department of Mathematics and Computer Science

  3. Target � An oracle to provide proofs required for the formal verification of software � We assume the following architecture: theorems VCG feedback valid program Type Checker Parser Editor annotated program parse tree

  4. Considerations � Do not build your own prover, but use existing ones � Instead of choosing one prover, create a generic interface � Pitfall: using the greatest common divisor! (does not exploit specialized provers!) � Automated provers are usually incomplete. What if a proof fails? � Proving a theorem may take a while. How do we prevent proving the same theorem several times? / Department of Mathematics and Computer Science

  5. Our implemented modules Controller www.tptp.org Theorem Prover @ @ TPTP Connector Connector Network Connector Controller Database theorems Interactive Client application Theories Proof Assistant (extensions) feedback

  6. Techniques used � The architecture can easiliy be configured by the user, due to our modular approach. � If an external prover does not support some extension (e.g. integers), the required definitions and axioms are provided by the repository. � The database uses a computable criterion called "more general" that implies "stronger". This is more flexible than looking for exact matches. � The interactive prover has a GUI that employs proof by pointing and a Fitch style notation to enable users to conveniently construct proofs. This is done by using a typed lambda-calculus as foundation. / Department of Mathematics and Computer Science

  7. Questions? / Department of Mathematics and Computer Science

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend