Implementing application-specific object-oriented theories in HOL

Authors:
Kenro Yatake;Toshiaki Aoki;Takuya Katayama
Affiliations:
Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 7
Cited 2

The object constraint language: precise modeling with UML

The object constraint language: precise modeling with UML
Modular verification of collaboration-based software designs

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
A Programming Logic for Sequential Java

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Implementing Layered Designs with Mixin Layers

ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
An Axiomatic Formalization of UML Models

Workshop of the pUML-Group held together with the «UML»2001 on Practical UML-Based Rigorous Development Methods - Countering or Integrating the eXtremists
Logical foundations for typed object-oriented languages

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Reasoning about java programs with aliasing and frame conditions

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

An Extensible Encoding of Object-oriented Data Models in hol

Journal of Automated Reasoning
An executable object-oriented semantics and its application to firewall verification

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a theory of Object-Oriented concepts embedded shallowly in HOL for the verification of OO analysis models. The theory is application-specific in the sense that it is automatically constructed depending on the type information of the application. This allows objects to have attributes of arbitrary types, making it possible to verify models using not only basic types but also highly abstracted types specific to the target domain. The theory is constructed by definitional extension based on the operational semantics of a heap memory model, which guarantees the soundness of the theory. This paper mainly focuses on the implementation details of the theory.