W
Wolfgang Ahrendt
Researcher at Chalmers University of Technology
Publications - 65
Citations - 1452
Wolfgang Ahrendt is an academic researcher from Chalmers University of Technology. The author has contributed to research in topics: Runtime verification & Formal verification. The author has an hindex of 17, co-authored 54 publications receiving 1265 citations. Previous affiliations of Wolfgang Ahrendt include Karlsruhe Institute of Technology & University of Gothenburg.
Papers
More filters
Journal ArticleDOI
The KeY tool
Wolfgang Ahrendt,Thomas Baar,Bernhard Beckert,Richard Bubel,Martin Giese,Reiner Hähnle,Wolfram Menzel,Wojciech Mostowski,Andreas Roth,Steffen Schlager,Peter H. Schmitt +10 more
TL;DR: KeY is a tool that provides facilities for formal specification and verification of programs within a commercial platform for UML based software development and provides a state-of-the-art theorem prover for interactive and automated verification.
BookDOI
Deductive Software Verification - The KeY Book
Wolfgang Ahrendt,Bernhard Beckert,Richard Bubel,Reiner Hähnle,Peter H. Schmitt,Mattias Ulbrich +5 more
TL;DR: This book is the definitive guide to KeY that lets you explore the full potential of deductive software verification in practice and contains the complete theory behind KeY for active researchers who want to understand it in depth or use it in their own work.
Journal ArticleDOI
Reasoning about Abstract State Machines: The WAM Case Study
TL;DR: A general translation of sequential Abstract State Machines to Dynamic Logic, which formalizes correctness of such re nement steps as a deduction problem and reports on the experiences in uncovering implicit assumptions incrementally during formal veri cation.
Book ChapterDOI
The KeY Approach: Integrating Object Oriented Design and Formal Verification
Wolfgang Ahrendt,Thomas Baar,Bernhard Beckert,Martin Giese,Elmar Habermalz,Reiner Hähnle,Wolfram Menzel,Peter H. Schmitt +7 more
TL;DR: This paper reports on the ongoing KeY project aimed at bridging the gap between object-oriented software engineering methods and tools and deductive verification with the use of a commercial CASE tool enhanced with functionality for formal specification and deductives verification.
Computing finite models by reduction to function-free clause logic
TL;DR: This paper describes the proposed reduction in detail and discusses how it is integrated into the Darwin prover, the implementation of the Model Evolution calculus, and the results are general, however, as this approach can be used in principle with any system that decides the satisfiability of function-free first-order clause sets.