Add to ORKGABSTRACT Bornat has recently described an approach to reasoning about pointers, building on work of Morris. Here we describe a semantics that validates the approach, and use it to help devise axioms for operations that allocate and dispose of memory
Abstract: Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following ki...
Learning Guide for the CST Part II course. This document aims to provide background reading to suppo...
AbstractUsing a predicate transformer semantics of programs, we introduce statements for heap operat...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
International audiencePioneering work has been done by Jonkers \cite{jonkers} to define a semantics ...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
Hoare logic ([7]) is an important tool for formally proving correctness properties of programs. It t...
AbstractBuilding on the work of Burstall, this paper develops sound modelling and reasoning methods ...
Abstract. This paper studies the compositional definition and behav-iour of properties that arise in...
This note presents a calculational method for dealing with pointers in weakest precondition semanti...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
This paper specifies a nontermination-insensitive, interprocedural, information flow analysis for ob...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The...
Abstract: Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following ki...
Learning Guide for the CST Part II course. This document aims to provide background reading to suppo...
AbstractUsing a predicate transformer semantics of programs, we introduce statements for heap operat...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
International audiencePioneering work has been done by Jonkers \cite{jonkers} to define a semantics ...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
Hoare logic ([7]) is an important tool for formally proving correctness properties of programs. It t...
AbstractBuilding on the work of Burstall, this paper develops sound modelling and reasoning methods ...
Abstract. This paper studies the compositional definition and behav-iour of properties that arise in...
This note presents a calculational method for dealing with pointers in weakest precondition semanti...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
This paper specifies a nontermination-insensitive, interprocedural, information flow analysis for ob...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The...
Abstract: Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following ki...
Learning Guide for the CST Part II course. This document aims to provide background reading to suppo...
AbstractUsing a predicate transformer semantics of programs, we introduce statements for heap operat...