Jan L. A. van de Snepscheut - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

1995

The Sliding-Window Protocol RevisitedJan L. A. van de Snepscheut. fac, 7(1):3-17, 1995.

1994

Semantics of ExceptionsK. Rustan M. Leino, Jan L. A. van de Snepscheut. procomet 1994: 447-466

Mechanized Support for Stepwise RefinementJan L. A. van de Snepscheut. plsa 1994: 35-48

1993

What computing is all aboutJan L. A. van de Snepscheut. Texts and monographs in computer science, Springer, 1993.

1992

Weakest Preconditions for ProgressJohan J. Lukkien, Jan L. A. van de Snepscheut. fac, 4(2):195-236, 1992.

A LISP Programming ExerciseJan L. A. van de Snepscheut. ipl, 42(2):103-108, 1992.

1991

A Distributed Implementation of a Task PoolH. Peter Hofstee, Johan J. Lukkien, Jan L. A. van de Snepscheut. hlppp 1992: 338-348

Inversion of a Recursive Tree TraversalJan L. A. van de Snepscheut. ipl, 39(5):265-267, 1991.

1990

Distributed SortingH. Peter Hofstee, Alain J. Martin, Jan L. A. van de Snepscheut. SCP, 15(2-3):119-133, 1990.

An Interconnection Network for Distributed Recursive ComputationsAlain J. Martin, Jan L. A. van de Snepscheut. TC, 39(11):1393-1395, 1990.

Foreword (Special Issue on Mathematics of Program Construction)Jan L. A. van de Snepscheut. SCP, 14(2-3):113-115, 1990.

1989

An Algorithm for Transitive Reduction of an Acyclic GraphDavid Gries, Alain J. Martin, Jan L. A. van de Snepscheut, Jan Tijmen Udding. SCP, 12(2):151-155, 1989.

On the design of some systolic algorithmsJan L. A. van de Snepscheut, Johan B. Swenker. JACM, 36(4):826-840, 1989. [doi]

1987

The Twisted CubePeter A. J. Hilbers, Marion R. J. Koopman, Jan L. A. van de Snepscheut. parle 1987: 152-159

Fair Mutual Exclusion on a Graph of ProcessesJan L. A. van de Snepscheut. dc, 2(2):113-115, 1987.

Algorithms for On-the-Fly Garbage Collection RevisitedJan L. A. van de Snepscheut. ipl, 24(4):211-216, 1987.

1986

A Derivation of a Distributed Implementation of Warshall s AlgorithmJan L. A. van de Snepscheut. SCP, 7(1):55-60, 1986.

An Alternative Implementation of Communication PrimitivesJan L. A. van de Snepscheut, Jan Tijmen Udding. ipl, 23(5):231-238, 1986.

1985

Evaluating Expressions with a QueueJan L. A. van de Snepscheut. ipl, 20(2):65-66, 1985.

Trace Theory and VLSJ DesignJan L. A. van de Snepscheut. Volume 200 of Lecture Notes in Computer Science, Springer, 1985. [doi]

1981

Synchronous Communication Between Asynchronous ComponentsJan L. A. van de Snepscheut. ipl, 13(3):127-130, 1981.

1980

SATHE: Some Aspects of an ALGOL ImplementationF. E. J. Kruseman Aretz, Jan L. A. van de Snepscheut, H. Grasdijk, J. M. H. Smeets. SPE, 10(7):563-573, 1980.

1979

Introducing the notion of processes to hardwareJan L. A. van de Snepscheut, Gert Slavenburg. sigarch, 7(7):13-23, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL