BibTeX
@MISC{Schumann_automatedtheorem,
author = {Johann Schumann},
title = {Automated Theorem Proving in Software Engineering},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Introduction. The quickly rising amount and complexity of developed and used software require more and more a rigorous application of formal methods during the entire software life cycle. Points of particular interest include: specification and its refinements, program synthesis, software reuse, support for testing and debugging, software reengineering, and software/hardware co-design (e.g., [16]). Wherever formal methods are applied, proof tasks of most different size and complexity arise in large quantities. Traditionally, interactive theorem provers (e.g., PVS, KIV, HOL, Isabelle) are being used to tackle those proof tasks. These systems have a highly expressive input language (mostly higher order logic), but in general many interactions by an expert user have to be performed for each proof task. Interactive theorem provers (ITPs) are just too interactive. On the other hand, Model Checkers (for propositional (temporal) logic; e.g., SMV [1]) are more and more used in the area
Keyphrases
proof task software engineering theorem proving interactive theorem provers software reuse formal method complexity arise model checker software reengineering expressive input language wherever formal method entire software life cycle order logic particular interest include program synthesis large quantity software hardware co-design different size general many interaction expert user rigorous application
