We use a relational model 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
. Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for implementing re...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer as-sig...
We propose a deductive reasoning approach to the automatic verification of temporal properties of po...
We use a relational model of pointer structures to calculate a number of standard algorithms on sing...
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 introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
In calculational derivations of pointer algorithms the concept of a reasonable abstraction function ...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
It is argued that list structures containing cycles are useful and unobjectionable Lisp entities. If...
AbstractUsing a predicate transformer semantics of programs, we introduce statements for heap operat...
AbstractWe show that the well-known unfold/fold transformation strategy is also fruitful for the (fo...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assign...
In this article, we investigate the automated verification of temporal properties of heap-aware prog...
AbstractWe define a new decidable logic for expressing and checking invariants of programs that mani...
. Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for implementing re...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer as-sig...
We propose a deductive reasoning approach to the automatic verification of temporal properties of po...
We use a relational model of pointer structures to calculate a number of standard algorithms on sing...
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 introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
In calculational derivations of pointer algorithms the concept of a reasonable abstraction function ...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
It is argued that list structures containing cycles are useful and unobjectionable Lisp entities. If...
AbstractUsing a predicate transformer semantics of programs, we introduce statements for heap operat...
AbstractWe show that the well-known unfold/fold transformation strategy is also fruitful for the (fo...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assign...
In this article, we investigate the automated verification of temporal properties of heap-aware prog...
AbstractWe define a new decidable logic for expressing and checking invariants of programs that mani...
. Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for implementing re...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer as-sig...
We propose a deductive reasoning approach to the automatic verification of temporal properties of po...
DOI
Add to ORKG