Book
On Automated Program Construction and Verification.
| Title: | On Automated Program Construction and Verification. |
|---|---|
| Authors: | Berghammer, Rudolf, Struth, Georg |
| Source: | Mathematics of Program Construction (9783642133206); 2010, p22-41, 20p |
| Abstract: | A new approach for automating the construction and verification of imperative programs is presented. Based on the standard methods of Floyd, Dijkstra, Gries and Hoare, it supports proof and refutation games with automated theorem provers, model search tools and computer algebra systems combined with ˵hidden″ domain-specific algebraic theories that have been designed and optimised for automation. The feasibility of this approach is demonstrated through fully automated correctness proofs of some classical algorithms: Warshall΄s transitive closure algorithm, reachability algorithms for digraphs, and Szpilrajn΄s algorithm for linear extensions of partial orders. Sophisticated mathematical methods that have been developed over decades could thus be integrated into push-button engineering technology. [ABSTRACT FROM AUTHOR] |
| Copyright of Mathematics of Program Construction (9783642133206) is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| DOI: | 10.1007/978-3-642-13321-3_4 |
| Database: | Complementary Index |
Availability