Inheritance in Higher Order Logic: Modeling and Reasoning

Marieke Huisman, Bart Jacobs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

12 Citations (Scopus)

Abstract

This paper describes a way of modeling inheritance (in object-oriented programming languages) in higher order logic. This particular approach is used in the LOOP project for reasoning about JAVA classes, with the proof tools PVS and ISABELLE. It relies on nested interface types to capture the superclasses, fields, methods, and constructors of classes, together with suitable casting functions incorporating the difference between hiding of fields and overriding of methods. This leads to the proper handling of late binding, as illustrated in several verification examples.
Original languageEnglish
Title of host publicationTheorem Proving in Higher Order Logics, 13th International Conference, TPHOLs 2000, Portland, Oregon, USA, August 14-18, 2000, Proceedings
EditorsMark Aagaard, John Harrison
PublisherSpringer
Pages301-319
Number of pages19
ISBN (Electronic)978-3-540-44659-0
ISBN (Print)978-3-540-67863-2
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event13th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2000 - Portland, United States
Duration: 14 Aug 200018 Aug 2000
Conference number: 13

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume1869

Conference

Conference13th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2000
Abbreviated titleTPHOLs 2000
Country/TerritoryUnited States
CityPortland
Period14/08/0018/08/00

Fingerprint

Dive into the research topics of 'Inheritance in Higher Order Logic: Modeling and Reasoning'. Together they form a unique fingerprint.

Cite this