Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store ("higher-order store"). We present a new soundness proof for this logic using a denotational semantics where object specifications are recursive predicates on the domain of objects. Our semantics reveals which of the limitations of Abadi and Leino's logic are deliberate design decisions and which follow from the use of higher-order store. We discuss the implications for the development of other, more expressive, program logics
We define a semantic framework to reason about properties of abstractions of SLD-derivations. The fr...
Logic for reasoning about programs must proceed from the programming language semantics. It is our t...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...
Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language ...
The object-calculus is an imperative and object-based programming language where every object comes ...
AbstractThe main contribution of this paper is a formal characterization of recursive object specifi...
The main contribution of this paper is a formal characterization of recursive object specifications ...
AbstractWe present a new abstract machine for Abadi and Cardelli's untyped non-imperative calculus o...
In object-oriented programming one distinguishes two kinds of languages. Class-based languages are c...
We present a Hoare logic for a simple imperative while-language with stored commands, ie. stored par...
We consider the problem of verification condition generation for Abadi and Leino’s program logic (AL...
This dissertation studies the logical aspects of domains as used in the denotational semantics of p...
We present a logic language with encapsulation based on an object-oriented data model. We give a for...
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Wrappers are a mechanism in denotational semantic that model class inheritance of object oriented pr...
We define a semantic framework to reason about properties of abstractions of SLD-derivations. The fr...
Logic for reasoning about programs must proceed from the programming language semantics. It is our t...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...
Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language ...
The object-calculus is an imperative and object-based programming language where every object comes ...
AbstractThe main contribution of this paper is a formal characterization of recursive object specifi...
The main contribution of this paper is a formal characterization of recursive object specifications ...
AbstractWe present a new abstract machine for Abadi and Cardelli's untyped non-imperative calculus o...
In object-oriented programming one distinguishes two kinds of languages. Class-based languages are c...
We present a Hoare logic for a simple imperative while-language with stored commands, ie. stored par...
We consider the problem of verification condition generation for Abadi and Leino’s program logic (AL...
This dissertation studies the logical aspects of domains as used in the denotational semantics of p...
We present a logic language with encapsulation based on an object-oriented data model. We give a for...
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Wrappers are a mechanism in denotational semantic that model class inheritance of object oriented pr...
We define a semantic framework to reason about properties of abstractions of SLD-derivations. The fr...
Logic for reasoning about programs must proceed from the programming language semantics. It is our t...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...