Using the Dafny Verification System in An Introduction To Algorithms Class
Using the Dafny Verification System in An Introduction To Algorithms Class
Author(s): Eric BraudeSubject(s): ICT Information and Communications Technologies
Published by: Нов български университет
Keywords: Algorithms; specifications; verification; preconditions; postconditions; invariants; theorem provers;
Summary/Abstract: Algorithm students often have difficulty understanding and using problem specifications and algorithm outlines. During the first three weeks of an algorithms class, the author used Dafny to address this. Dafny is a programming language and verification system developed at Microsoft Research. A Dafny program requires explicit preconditions, post conditions, loop invariants, and loop termination counters. In return, it uses a theorem prover to mechanically prove or question the correctness of method outlines and implementations. The preliminary results of this trial suggest that when students work with Dafny, they better understand and appreciate the importance of preconditions, post conditions, invariance and loop termination.
Journal: Computer Science and Education in Computer Science
- Issue Year: 10/2014
- Issue No: 1
- Page Range: 23-29
- Page Count: 7
- Language: English