We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) derivation of correct pointer algorithms. The key that allows this extension is the algebra of partial maps which allows convenient description and manipulation of pointer structures at the functional level
In this paper we give a calculational account of a garbage collection algorithm. There have been a ...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) der...
We show that the well-known unfold/fold transformation strategy also is fruitful for the (formal) de...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
AbstractWe show that the well-known unfold/fold transformation strategy is also fruitful for the (fo...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
Transformational construction of correct pointer algorithms. - In: Perspectives of system informatic...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Based on the algebra of relations and maps we present some techniques for safe manipulation of point...
In calculational derivations of pointer algorithms the concept of a reasonable abstraction function ...
In this paper we give a calculational account of a garbage collection algorithm. There have been a ...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) der...
We show that the well-known unfold/fold transformation strategy also is fruitful for the (formal) de...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
AbstractWe show that the well-known unfold/fold transformation strategy is also fruitful for the (fo...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
Transformational construction of correct pointer algorithms. - In: Perspectives of system informatic...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Based on the algebra of relations and maps we present some techniques for safe manipulation of point...
In calculational derivations of pointer algorithms the concept of a reasonable abstraction function ...
In this paper we give a calculational account of a garbage collection algorithm. There have been a ...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
DOI
Add to ORKG