![]() ![]() ![]() Once the program has been processed completely, there remains a first-order logic proof obligation. To this ends, the program is symbolically executed with the resulting changes to program variables stored in so-called updates. From the given specifications, several proof obligations arise which are to be discharged, i.e. Both are translated to KeY's internal representation, dynamic logic. The usual user input to KeY consists of a Java source file with annotations in JML. KeY is jointly developed by Karlsruhe Institute of Technology, Germany Technische Universität Darmstadt, Germany and Chalmers University of Technology in Gothenburg, Sweden and is licensed under the GPL. ![]() There have been several extensions to KeY in order to apply it to the verification of C programs or hybrid systems. Failed proof attempts can be used for a more efficient debugging or verification-based testing. by hand) and fully automated correctness proofs. KeY is significantly powerful in that it supports both interactive (i.e. These are transformed into theorems of dynamic logic and then compared against program semantics that are likewise defined in terms of dynamic logic. It accepts specifications written in the Java Modeling Language to Java source files. The KeY tool is used in formal verification of Java programs. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |