A. J. M. van Gasteren

13 papers B 2Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2002 J jnl
On computing a longest path in a tree.
Inf. Process. Lett.
R. W. Bulterman, F. W. van der Sommen, Gerard Zwaan, Tom Verhoeff, A. J. M. van Gasteren, W. H. J. Feijen
1999 — book
On a Method of Multiprogramming
W. H. J. Feijen, A. J. M. van Gasteren
1998 B conf
An Elementary Derivation of the Alternating Bit Protocol.
MPC
W. H. J. Feijen, A. J. M. van Gasteren, Birgit Schieder
1998 — conf
An extension of the program derivation format.
PROCOMET
A. J. M. van Gasteren, A. Bijlsma
1997 J jnl
Peterson's Mutual Exclusion Algorithm Revisited.
Sci. Comput. Program.
F. W. van der Sommen, W. H. J. Feijen, A. J. M. van Gasteren
1994 J jnl
Calculating Path Algorithms.
Sci. Comput. Program.
Roland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren
1992 B conf
Calculating a Path Algorithm.
MPC
Roland Carl Backhouse, A. J. M. van Gasteren
1990 J jnl
Comments on "On the Proof of a Distributed Algorithm": Always-Tru is not Invariant.
Inf. Process. Lett.
A. J. M. van Gasteren, Gerard Tel
1990 — book
On the Shape of Mathematical Arguments
A. J. M. van Gasteren
1987 J jnl
In-situ Inversion of a Cyclic Permutation.
Inf. Process. Lett.
W. H. J. Feijen, A. J. M. van Gasteren, David Gries
1986 J jnl
A Simple Fixpoint Argument Without the Restriction to Continuity.
Acta Informatica
Edsger W. Dijkstra, A. J. M. van Gasteren
1983 J jnl
Derivation of a Termination Detection Algorithm for Distributed Computations.
Inf. Process. Lett.
Edsger W. Dijkstra, W. H. J. Feijen, A. J. M. van Gasteren
1982 J jnl
An Introduction to Three Algorithms for Sorting in Situ.
Inf. Process. Lett.
Edsger W. Dijkstra, A. J. M. van Gasteren