Object-oriented verification based on record subtyping in higher-order logic

32Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns out to be extremely simple. In particular, structural subtyping is subsumed by naive parametric polymorphism, while overridable generic functions may be based on overloading. Taking HOL plus extensible records as a starting point, we then set out to build an environment for object-oriented specification and verification (HOOL). This framework offers several well-known concepts like classes, objects, methods and late-binding. All of this is achieved by very simple means within HOL.

Cite

CITATION STYLE

APA

Naraschewski, W., & Wenzel, M. (1998). Object-oriented verification based on record subtyping in higher-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1479, pp. 349–366). Springer Verlag. https://doi.org/10.1007/bfb0055146

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free