Jan L. A. van de Snepscheut

24 papers B 1Journal 17Unranked 4
YearRankTypeTitle / Venue / Authors
1995 J jnl
The Sliding-Window Protocol Revisited.
Formal Aspects Comput.
Jan L. A. van de Snepscheut
1994 — conf
Mechanized Support for Stepwise Refinement.
Programming Languages and System Architectures
Jan L. A. van de Snepscheut
1994 — conf
Semantics of Exceptions.
PROCOMET
K. Rustan M. Leino, Jan L. A. van de Snepscheut
1993 — book
What Computing Is All About.
Jan L. A. van de Snepscheut
1992 J jnl
A LISP Programming Exercise.
Inf. Process. Lett.
Jan L. A. van de Snepscheut
1992 J jnl
Weakest Preconditions for Progress.
Formal Aspects Comput.
Johan J. Lukkien, Jan L. A. van de Snepscheut
1991 — conf
A Distributed Implementation of a Task Pool.
Research Directions in High-Level Parallel Programming Languages
H. Peter Hofstee, Johan J. Lukkien, Jan L. A. van de Snepscheut
1991 J jnl
Inversion of a Recursive Tree Traversal.
Inf. Process. Lett.
Jan L. A. van de Snepscheut
1990 J jnl
An Interconnection Network for Distributed Recursive Computations.
IEEE Trans. Computers
Alain J. Martin, Jan L. A. van de Snepscheut
1990 J jnl
Distributed Sorting.
Sci. Comput. Program.
H. Peter Hofstee, Alain J. Martin, Jan L. A. van de Snepscheut
1990 J jnl
Foreword (Special Issue on Mathematics of Program Construction).
Sci. Comput. Program.
Jan L. A. van de Snepscheut
1989 J jnl
An Algorithm for Transitive Reduction of an Acyclic Graph.
Sci. Comput. Program.
David Gries, Alain J. Martin, Jan L. A. van de Snepscheut, Jan Tijmen Udding
1989 B ed.
Mathematics of Program Construction, 375th Anniversary of the Groningen University, International Conference, Groningen, The Netherlands, June 26-30, 1989, Proceedings
MPC
Jan L. A. van de Snepscheut
1989 J jnl
On the design of some systolic algorithms.
J. ACM
Jan L. A. van de Snepscheut, Johan B. Swenker
1987 J jnl
"Algorithms for On-the-Fly Garbage Collection" Revisited.
Inf. Process. Lett.
Jan L. A. van de Snepscheut
1987 J jnl
Fair Mutual Exclusion on a Graph of Processes.
Distributed Comput.
Jan L. A. van de Snepscheut
1987 — conf
The Twisted Cube.
PARLE (1)
Peter A. J. Hilbers, Marion R. J. Koopman, Jan L. A. van de Snepscheut
1986 J jnl
A Derivation of a Distributed Implementation of Warshall's Algorithm.
Sci. Comput. Program.
Jan L. A. van de Snepscheut
1986 J jnl
An Alternative Implementation of Communication Primitives.
Inf. Process. Lett.
Jan L. A. van de Snepscheut, Jan Tijmen Udding
1985 J jnl
Evaluating Expressions with a Queue.
Inf. Process. Lett.
Jan L. A. van de Snepscheut
1985 — book
Trace Theory and VLSJ Design
Jan L. A. van de Snepscheut
1981 J jnl
Synchronous Communication Between Asynchronous Components.
Inf. Process. Lett.
Jan L. A. van de Snepscheut
1980 J jnl
SATHE: Some Aspects of an ALGOL Implementation.
Softw. Pract. Exp.
F. E. J. Kruseman Aretz, Jan L. A. van de Snepscheut, H. Grasdijk, J. M. H. Smeets
1979 J jnl
Introducing the notion of processes to hardware.
SIGARCH Comput. Archit. News
Jan L. A. van de Snepscheut, Gert Slavenburg