Verification of object-oriented software: The KeY approach
Verification of object-oriented software: The KeY approach
An improved rule for while loops in deductive program verification
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Types, Maps and Separation Logic
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A Verification System for Distributed Objects with Asynchronous Method Calls
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Verifying implementations of security protocols by refinement
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
A system for compositional verification of asynchronous objects
Science of Computer Programming
Hi-index | 0.00 |
We present KeY-C, a tool for deductive verification of Cprograms. KeY-C allows to prove partial correctness of Cprograms relative to pre- and postconditions. It is based on a version of KeY that supports Java Card. In this paper we give a glimpse of syntax, semantics, and calculus of CDynamic Logic (CDL) that were adapted from their Java Cardcounterparts, based on an example. Currently, the tool is in an early development stage.