Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eager language with facilities for programmer-controlled destruc-tion and copying of data structures. It provides also regions, i.e. disjoint parts of the heap where the programmer may allocate data structures. The analysis gives upper approximations to the sets of variables respectively sharing a recur-sive substructure, or any substructure, of a given variable. Its results will be used to guarantee that destruction facilities and region management are done in a safe way. In order to have a modular and efficient analysis, we provide signatures for functions, which summarize their sharing behaviour. The paper ends up describ-ing the implementatio...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and ...
Safe sharing is a desirable feature of an object oriented database because it protects valuable data...
We present a destruction-aware type system for the functional lan-guage Safe, which is a first-order...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
Abstract. Pawns is a programming language under development that supports algebraic data types, poly...
Safe is a first-order eager language with heap regions and unusual facilities such as programmer-con...
AbstractSafe is a first-order eager language with heap regions and unusual facilities such as progra...
Abstract. Safe is a first-order eager language with facilities for pro-grammer controlled destructio...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Abstract. Functional programs are more amenable to rigorous math-ematical analysis than imperative p...
We present a safe embedding of mutable data structures in functional languages. With safety we mean ...
Abstract. Safe is a first-order eager functional language with facilities for programmer-controlled ...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
Precise modeling of the program heap is fundamental for under-standing the behavior of a program, an...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and ...
Safe sharing is a desirable feature of an object oriented database because it protects valuable data...
We present a destruction-aware type system for the functional lan-guage Safe, which is a first-order...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
Abstract. Pawns is a programming language under development that supports algebraic data types, poly...
Safe is a first-order eager language with heap regions and unusual facilities such as programmer-con...
AbstractSafe is a first-order eager language with heap regions and unusual facilities such as progra...
Abstract. Safe is a first-order eager language with facilities for pro-grammer controlled destructio...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Abstract. Functional programs are more amenable to rigorous math-ematical analysis than imperative p...
We present a safe embedding of mutable data structures in functional languages. With safety we mean ...
Abstract. Safe is a first-order eager functional language with facilities for programmer-controlled ...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
Precise modeling of the program heap is fundamental for under-standing the behavior of a program, an...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and ...
Safe sharing is a desirable feature of an object oriented database because it protects valuable data...