Deductive Software Verification – The KeY Book

Ahrendt, Wolfgang; Beckert, Bernhard; Bubel, Richard; Hähnle, Reiner; Schmitt, Peter H.; Ulbrich, Mattias

doi:10.1007/978-3-319-49812-6

Cited by 195 publications

(78 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is the more deplorable since in practice (as well in education as in research) most time is actually spent in trying to prove conjectures that do not hold. This is also the fundamental limitation on the educational use of tools for deductive program verification, be they "interactive", "automatic", or "auto-active"; prominent examples of such tools are the interactive KeY verifier [1], the verification platform Why3 [4] with various interactive and automatic backends, the OpenJML tool with various SMT solvers as automatic backends [8], and the auto-active systems Spec# [2] and Dafny [12], both based on the Boogie backend.…”

Section: Introductionmentioning

confidence: 99%

Theorem and Algorithm Checking for Courses on Logic and Formal Methods

Schreiner

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The RISC Algorithm Language (RISCAL) is a language for the formal modeling of theories and algorithms. A RISCAL specification describes an infinite class of models each of which has finite size; this allows to fully automatically check in such a model the validity of all theorems and the correctness of all algorithms. RISCAL thus enables us to quickly verify/falsify the specific truth of propositions in sample instances of a model class before attempting to prove their general truth in the whole class: the first can be achieved in a fully automatic way while the second typically requires our assistance. RISCAL has been mainly developed for educational purposes. To this end this paper reports on some new enhancements of the tool: the automatic generation of checkable verification conditions from algorithms, the visualization of the execution of procedures and the evaluation of formulas illustrating the computation of their results, and the generation of Web-based student exercises and assignments from RISCAL specifications. Furthermore, we report on our first experience with RISCAL in the teaching of courses on logic and formal methods and on further plans to use this tool to enhance formal education.

show abstract

Section: Introductionmentioning

confidence: 99%

Theorem and Algorithm Checking for Courses on Logic and Formal Methods

Schreiner

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Moreover, to ease the process of specification and increase applicability of formal verification even into the realm of mainstream software development, the verifying tool chain has to provide a high degree of automation, which is in-line with the Spec# experience [2]. Besides the fact that KeY was initially designed to be used interactively [1], it provides numerous means to automate the verification process. For instance, KeY applies sophisticated built-in strategies to find proofs automatically.…”

Section: Formal Verification Of Java Programsmentioning

confidence: 99%

“…In particular, we draw our experiences from a real-world case study, where we specify and verify parts of Open-JDK's Collections-API with the Java Modeling language (JML) [32]. For the verification phase, we use the state-of-the-art verifier KeY version 2.6.1 [1], an interactive theorem prover with a high degree of automation and a large community. Our long-term vision is to facilitate the development of specification and implementation in concert for everyday software developers.…”

Section: Introductionmentioning

confidence: 99%

Experience Report on Formally Verifying Parts of OpenJDK's API with KeY

Knüppel¹,

Thüm²,

Pardylla³

et al. 2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Deductive verification of software has not yet found its way into industry, as complexity and scalability issues require highly specialized experts. The long-term perspective is, however, to develop verification tools aiding industrial software developers to find bugs or bottlenecks in software systems faster and more easily. The KeY project constitutes a framework for specifying and verifying software systems, aiming at making formal verification tools applicable for mainstream software development. To help the developers of KeY, its users, and the deductive verification community, we summarize our experiences with KeY 2.6.1 in specifying and verifying real-world Java code from a users perspective. To this end, we concentrate on parts of the Collections-API of OpenJDK 6, where an informal specification exists. While we describe how we bridged informal and formal specification, we also exhibit accompanied challenges that we encountered. Our experiences are that (a) in principle, deductive verification for API-like code bases is feasible, but requires high expertise, (b) developing formal specifications for existing code bases is still notoriously hard, and (c) the under-specification of certain language constructs in Java is challenging for tool builders. Our initial effort in specifying parts of OpenJDK 6 constitutes a stepping stone towards a case study for future research.

show abstract

“…The framework combines the static deductive verifier KeY 15 (Ahrendt, Beckert, et al, 2016) with the runtime verification tool LARVA (Colombo, Pace, and Schneider, 2009). The formalism of choice for the specification is ppDATE , an extension of DATE (Colombo, Pace, and Schneider, 2008) that allows both control-and data-oriented properties to be stated, decorating automaton states with Hoare triples.…”

Section: Static and Dynamic Analysismentioning

confidence: 99%

RML: runtime monitoring language

Franceschini

2019

Proceedings of the Conference Companion of the 3rd International Conference on Art, Science, and Engineering of Programming

View full text Add to dashboard Cite

A B S T R AC TRuntime verification is a relatively new software verification technique that aims to prove the correctness of a specific run of a program, rather than statically verify the code. The program is instrumented in order to collect all the relevant information, and the resulting trace of events is inspected by a monitor that verifies its compliance with respect to a specification of the expected properties of the system under scrutiny. Many languages exist that can be used to formally express the expected behavior of a system, with different design choices and degrees of expressivity.This thesis presents RML, a specification language designed for runtime verification, with the goal of being completely modular and independent from the instrumentation and the kind of system being monitored. RML is highly expressive, and allows one to express complex, parametric, non-context-free properties concisely. RML is compiled down to TC, a lower level calculus, which is fully formalized with a deterministic, rewriting-based semantics.In order to evaluate the approach, an open source implementation has been developed, and several examples with Node.js programs have been tested. Benchmarks show the ability of the monitors automatically generated from RML specifications to effectively and efficiently verify complex properties. v

show abstract

Deductive Software Verification – The KeY Book

Cited by 195 publications

References 0 publications

Theorem and Algorithm Checking for Courses on Logic and Formal Methods

Theorem and Algorithm Checking for Courses on Logic and Formal Methods

Experience Report on Formally Verifying Parts of OpenJDK's API with KeY

RML: runtime monitoring language

Contact Info

Product

Resources

About