Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
A Weakest Precondition Semantics for Refinement of Object-Oriented Programs
IEEE Transactions on Software Engineering
The LOOP Compiler for Java and JML
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
ERC – An object-oriented refinement calculus for Eiffel
Formal Aspects of Computing
A machine-checked model for a Java-like language, virtual machine, and compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
rCOS: a refinement calculus of object systems
Theoretical Computer Science - Components and objects
Refinement and verification in component-based model-driven design
Science of Computer Programming
State Based Robustness Testing for Components
Electronic Notes in Theoretical Computer Science (ENTCS)
A Graph-Based Operational Semantics of OO Programs
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
rCOS: theory and tool for component-based model driven development
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Specification and validation of behavioural protocols in the rCOS modeler
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A tool for developing correct programs by refinement
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
rCOS: a formal model-driven engineering method for component-based software
Frontiers of Computer Science in China
A framework for automated and certified refinement steps
Innovations in Systems and Software Engineering
Hi-index | 0.00 |
This paper extends the mechanization of the refinement calculus done by von Wright in HOL, representing the state of a program as a graph instead of a tuple, in order to deal with object-orientation. The state graph structure is implemented in Isabelle, together with definitions and lemmas, to help the manipulation of states. We then show how proof obligations are automatically generated from the rCOS tool and can be loaded in Isabelle to be proved. We illustrate our approach by generating the proof obligations for a simple example, including object access and method invocation.