Add to ORKGWe use a relational calculus of pointer structures to calculate a number of standard algorithms on singly linked lists, both acyclic and cyclic. This shows that our techniques are not just useful for tree-like structures, but apply to general pointer structures as well
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
This paper introduces an extension of linear temporal logic that allows to express properties about...
Abstract. This paper studies the compositional definition and behav-iour of properties that arise in...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational model of pointer structures to calculate a number of standard algorithms on sing...
The key to many approaches to reason about pointerbased data structures is the availability of a dec...
Pointers are an important programming concept. They are used explicitely or implicitly in many progr...
The key to many approaches to reason about pointer-based data structures is the availability of a de...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) der...
Recursive data structures are abstractions of simple records and pointers. They impose a shape inv...
Based on the algebra of relations and maps we present some techniques for safe manipulation of point...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
We show that the well-known unfold/fold transformation strategy also is fruitful for the (formal) de...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
This paper introduces an extension of linear temporal logic that allows to express properties about...
Abstract. This paper studies the compositional definition and behav-iour of properties that arise in...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational model of pointer structures to calculate a number of standard algorithms on sing...
The key to many approaches to reason about pointerbased data structures is the availability of a dec...
Pointers are an important programming concept. They are used explicitely or implicitly in many progr...
The key to many approaches to reason about pointer-based data structures is the availability of a de...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) der...
Recursive data structures are abstractions of simple records and pointers. They impose a shape inv...
Based on the algebra of relations and maps we present some techniques for safe manipulation of point...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
We show that the well-known unfold/fold transformation strategy also is fruitful for the (formal) de...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
This paper introduces an extension of linear temporal logic that allows to express properties about...
Abstract. This paper studies the compositional definition and behav-iour of properties that arise in...