You are here:
(27 Nov 2007,
<b>[DRAFT]</b> <h2>Automated Program Verification</h2> <h4>Description (Short)</h4> Program verification is a correctness assurance method based on mathematical models of programs. It is superior to testing because of its precision and its ability to represent an entire range of test cases (even infinitely many of them!) with only a few mathematical formulas. In this course the student will be introduced to three techniques in program verification: model checker, theorem prover, and abstraction. <h4>Description (Long)</h4> Critical errors are errors made by a computer system that have costly consequences. As our society become increasingly dependent on computers, the risk of having critical errors also increases. It becomes increasingly urgent to ensure that our software, especially those deployed to handle critical tasks, meet a high standard of correctness. Without doubt, this is going to cost us something. The traditional way of assuring software correctness is testing. Testing is inexpensive. Unfortunately, testing becomes increasingly unadequate. <p>Program verification is another approach in correctness assurance. Verification is based on mathematical models of programs. It is superior to testing because of its precision and its ability to represent an entire range of test cases (even infinitely many of them!) with only a few mathematical formulas. However, its reliance on mathematics makes the approach expensive and rather unaccessible for ordinary programmers. Still, it is a very potential approach, and depending on the application domain and the ammount resources that a company has, verification may be an attractive solition. It is also a very active research field. People keep coming with new innovations, and there are already many tools to automate many tasks and make verification a lot cheaper that it used to be ten years ago. <p>In this course the student will be introduced to three techniques in program verification: model checker, theorem prover, and abstraction. <i>Model checker</i> is a push button (fully automatic) technology, though its language is limited. <i>Theorem prover</i> on the other hand, is extremely expressive, but it is only semi automatic. <i>Abstraction</i> is a pre-processing technique which is necessary to handle realistic programs by deriving simpler models which are more tractable for either model checkers or theorem provers. <h4>Tools</h4> We are going to use the following tools: <ol> <li>Model checker: Spin <li>Theorem prover: HOL <li>Abstraction: xMECH-HOL </ol> <h4>Course Format</h4> Lectures, tutorial, training, and programming assignments. <h4>Grading</h4> Based on the assignments. <h4>Requirement</h4> <ol> <li>Basic course in mathematics [B&B]. The student is assumed to be familiar with the notions of set, function, and relation. <p><li>Basic course in predicate logic [B&B]. <p><li>Basic course in programming logic for sequential programs [P&C] (e.g. Hoare-triple based logic, assertional logic) <p><li>Functional programming [FP]. The student is assumed to be familiar with Haskell- or ML-like type systems. <p><li>Basic course in language and grammar [GnO]. The student is assumed to be familiar with context free grammar, BNF notation, and the notion of abstract syntax. </ol> <h4>Required Logistic</h4> <ul> <li>28 contact slots, each slot is 2 x 45 minutes, preferable with flexible partition into lecture and lab slots. It is prefereable if the lab slot is allocated after and in the same day as the lecture slot. <p><li>lab with UNIX or windows system with Spin and HOL taupo installed. xMECH will be provided as downloadable ML source. </ul> <h4>Plan</h4> L = lecture (college) <br> T = training/tutorial (werk-college) <br> A = programming assignment (practicum) <p>Total requested contact slots: 14L + 14T/A. Change? <p>Total in plan: 9.5L 5T 12A <ol> <li>Basic [1L,3T fit in 1 whole week] <ol> <li> [.5L] Review on Hoare logic <li> [.5L,1T] Writing formal specifications <li> [2T] Refresh training: Constructing formal proof </ol> <p><li>Model checking [4L + 4A] <p><li>Theorem prover [3L,2T,4A] <ol> <li>[.5L] Quick introduction to programming in ML <li>[.5L] HOL: language & basic proof rules <li>[1L] HOL: tactical language & subgoal package <li>[1T] Tutorial 1: specififying and verifying with HOL <li>[1T] Tutorial 2: embedding (parity checker) <li>[4A] Assignment: specifying and verifying programs with HOL <li> [0L] HOL Tips <li> [1L] HOL Meson and Rewrite tools </ol> <p><li>Abstraction [1.5L, 4A] <ol> <li>[1L] Implementing a simple programming language and logic in xMECH <li>[4A] Assignment: make the inference engine smarter <li>[.5L] [optional] PLGA part of xMECH. </ol> </ol> <hr> -- Main.WishnuPrasetya - 06 Mar 2002 <br />
ore topic actions
Topic revision: r7 - 27 Nov 2007,
Master ST Home
Center ST Home
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding UUCS?