Add to ORKGThis report presents a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculus for assignments and object-creation, as well as Hoare rules for reasoning about (mutually recursive) method invocations with dynamic binding. Our approach enables reasoning at an abstraction level that coincides with the general abstraction level of object-oriented languages. Chapter
AbstractJava+ITP is an experimental tool for the verification of properties of a sequential imperati...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
This thesis presents a proof outline logic for a simple object-oriented programming language. The la...
AbstractThis paper describes a proof outline logic that covers most typical object-oriented language...
A Hoare-style programming logic for the sequential kernel of Java is presented. It handles recursive...
A Hoare-style programming logic for the sequential kernel of Java is presented. It handles recursive...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
We present algebraic laws for a language similar to a subset of sequential Java that includes inheri...
AbstractWe present algebraic laws for a language similar to a subset of sequential Java that include...
AbstractProgram logics for bytecode languages such as Java bytecode or the .NET CIL can be used to a...
International audienceA logical framework is presented for defining semantics of programs that satis...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
In this paper we give a representation of a weakest precondition calculus for abstract object creat...
. This paper presents a linear logic programming language, called O \Gammaffi , that gives a complet...
This paper introduces a framework for rapid prototyping of object oriented programming languages and...
AbstractJava+ITP is an experimental tool for the verification of properties of a sequential imperati...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
This thesis presents a proof outline logic for a simple object-oriented programming language. The la...
AbstractThis paper describes a proof outline logic that covers most typical object-oriented language...
A Hoare-style programming logic for the sequential kernel of Java is presented. It handles recursive...
A Hoare-style programming logic for the sequential kernel of Java is presented. It handles recursive...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
We present algebraic laws for a language similar to a subset of sequential Java that includes inheri...
AbstractWe present algebraic laws for a language similar to a subset of sequential Java that include...
AbstractProgram logics for bytecode languages such as Java bytecode or the .NET CIL can be used to a...
International audienceA logical framework is presented for defining semantics of programs that satis...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
In this paper we give a representation of a weakest precondition calculus for abstract object creat...
. This paper presents a linear logic programming language, called O \Gammaffi , that gives a complet...
This paper introduces a framework for rapid prototyping of object oriented programming languages and...
AbstractJava+ITP is an experimental tool for the verification of properties of a sequential imperati...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
This thesis presents a proof outline logic for a simple object-oriented programming language. The la...