Object-oriented verification based on record subtyping in Higher-Order Logic

Naraschewski, Wolfgang; Wenzel, Markus

doi:10.1007/bfb0055146

Cited by 29 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Mizar approach does not remember the positions of the elements in the tuples, but ensures that the labels of the elements are unique (the labels are called selectors in Mizar). Mizar structures are quite similar to the work of Naraschewski and Wenzel [51] which uses parametric polymorphism to define records with labels, however the Mizar type system allows multiple inheritance and requires no coercions between structure types and their subtypes.…”

Section: Mizar Structure Semanticsmentioning

confidence: 66%

A Goal-Directed Decision Procedure for Hybrid PDL

Kaminski

Smolka

2013

J Autom Reasoning

View full text Add to dashboard Cite

We formally define the foundations of the Mizar system as an object logic in the Isabelle logical framework. For this, we propose adequate mechanisms to represent the various components of Mizar. We express Mizar types in a uniform way, provide a common type intersection operation, allow reasoning about type inhabitation, and develop a type inference mechanism. We provide Mizar-like definition mechanisms which require the same proof obligations and provide same derived properties. Structures and set comprehension operators can be defined as definitional extensions. Re-formalized proofs from various parts of the Mizar Library show the practical usability of the specified foundations.

show abstract

Section: Mizar Structure Semanticsmentioning

confidence: 66%

A Goal-Directed Decision Procedure for Hybrid PDL

Kaminski

Smolka

2013

J Autom Reasoning

View full text Add to dashboard Cite

show abstract

“…Subtyping on objects must be expressed implicitly via refinement. With respect to extensibility of data-structures, the idea of using parametric polymorphism is partly folklore in HOL research communities; for example, extensible records and their application for some form of subtyping has been described in HOOL [19]. Since only α-extensions are used, this results in a restricted form of class types with no coercion mechanism to α Object.…”

Section: Resultsmentioning

confidence: 99%

Extensible Universes for Object-Oriented Data Models

Brucker¹,

Wolff

2008

ECOOP 2008 – Object-Oriented Programming

View full text Add to dashboard Cite

We present a datatype package that enables the shallow embedding technique to object-oriented specification and programming languages. This datatype package incrementally compiles an object-oriented data model to a theory containing object-universes, constructors, accessors functions, coercions between dynamic and static types, characteristic sets, their relations reflecting inheritance, and the necessary class invariants. The package is conservative, i. e., all properties are derived entirely from axiomatic definitions. As an application, we use the package for an object-oriented core-language called IMP ++ , for which correctness of a Hoare-Logic with respect to an operational semantics is proven.

show abstract

“…in (1) is a Selector function [13] that returns the value of the corresponding field of the data, which is "¥ § ¦ © ' $ % " ! $ # " in this case.…”

Section: Semantical Description Of Datamentioning

confidence: 99%

“…Unification is used to select applicable data and services which are represented using Isabelle's extensible record datatype [13]. (super-class) with extra fields.…”

Section: Semantical Description Of Datamentioning

confidence: 99%