We present a compositional program logic for call-by-value imperative higherorder functions with general forms of aliasing, which can arise from the use of reference names as function parameters, return values, content of references and part of data structures. The program logi
We present an imperative object calculus where types are annotated with two modifiers for aliasing c...
Abstract. This paper establishes a strong completeness property of composi-tional program logics for...
Abstract. This paper establishes a strong completeness property of composi-tional program logics for...
We present a compositional program logic for call-by-value imperative higher-order functions with ge...
We present a compositional programme logic for call-by-value imperative higher-order functions with ...
Abstract. We propose a simple compositional program logic for an imperative extension of call-by-val...
Abstract. This paper studies inductive definitions involving binders, in which aliasing between free...
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The...
In recent years, there has been substantial interest in the development of programming languages fo...
We present a definition of the function pointer aliasing problem for single level function pointers,...
Contains fulltext : 84489.pdf (author's version ) (Open Access)4th International C...
. Object-oriented systems are typically structured as complex networks of interacting mutable object...
Various methods for formal program verification have been around for a long time. Hoare logic is on...
When programs are intended for parallel execution it becomes critical to determine whether the eval...
AbstractThe notions of procedures, parameters, and abstraction are by convention treated together in...
We present an imperative object calculus where types are annotated with two modifiers for aliasing c...
Abstract. This paper establishes a strong completeness property of composi-tional program logics for...
Abstract. This paper establishes a strong completeness property of composi-tional program logics for...
We present a compositional program logic for call-by-value imperative higher-order functions with ge...
We present a compositional programme logic for call-by-value imperative higher-order functions with ...
Abstract. We propose a simple compositional program logic for an imperative extension of call-by-val...
Abstract. This paper studies inductive definitions involving binders, in which aliasing between free...
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The...
In recent years, there has been substantial interest in the development of programming languages fo...
We present a definition of the function pointer aliasing problem for single level function pointers,...
Contains fulltext : 84489.pdf (author's version ) (Open Access)4th International C...
. Object-oriented systems are typically structured as complex networks of interacting mutable object...
Various methods for formal program verification have been around for a long time. Hoare logic is on...
When programs are intended for parallel execution it becomes critical to determine whether the eval...
AbstractThe notions of procedures, parameters, and abstraction are by convention treated together in...
We present an imperative object calculus where types are annotated with two modifiers for aliasing c...
Abstract. This paper establishes a strong completeness property of composi-tional program logics for...
Abstract. This paper establishes a strong completeness property of composi-tional program logics for...
DOI
Add to ORKG