AbstractWe show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) derivation of correct pointer algorithms. The key to this extension is an algebra of partial maps which allows convenient description and manipulation of pointer structures at the functional level
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
In this paper we give a calculational account of a garbage collection algorithm. There have been a ...
Software controlled systems more and more become established in our daily life. Thus, the probabilit...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
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...
It is well-known that algorithms involving pointers are both difficult to write and to verify. One r...
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...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
We use a relational model of pointer structures to calculate a number of standard algorithms on sing...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
Pointer Kleene algebra has proved to be a useful abstraction for reasoning about reachability proper...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
In this paper we give a calculational account of a garbage collection algorithm. There have been a ...
Software controlled systems more and more become established in our daily life. Thus, the probabilit...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
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...
It is well-known that algorithms involving pointers are both difficult to write and to verify. One r...
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...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
We use a relational model of pointer structures to calculate a number of standard algorithms on sing...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
Pointer Kleene algebra has proved to be a useful abstraction for reasoning about reachability proper...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
In this paper we give a calculational account of a garbage collection algorithm. There have been a ...
Software controlled systems more and more become established in our daily life. Thus, the probabilit...
DOI
Add to ORKG