Information Processing Letters

From the Editors of this special issue
pp. 49-51(3)
Authors: Almstrum V.L.; Gries D.

Under the spell of Leibniz's dream^*
pp. 53-61(9)
Author: Dijkstra E.W.

A simple proof technique for priority-scheduled systems
pp. 63-70(8)
Authors: Anderson J.H.; Moir M.; Ramamurthy S.

The associativity of equivalence and the Towers of Hanoi problem
pp. 71-76(6)
Authors: Backhouse R.; Fokkinga M.

Model-based specification
pp. 77-84(8)
Author: Bijlsma L.

Bucking the trends
pp. 85-87(3)
Author: Braben D.W.

The joy of formula manipulation
pp. 89-96(8)
Author: Feijen W.H.J.

Annotation inference for modular checkers
pp. 97-108(12)
Authors: Flanagan C.; Joshi R.; Leino K..

Elements of security: Closure, convergence, and protection
pp. 109-114(6)
Author: Gouda M.G.

Available stabilizing heaps
pp. 115-121(7)
Authors: Herman T.; Masuzawa T.

Legacy^*
pp. 123-129(7)
Author: Hoare T.

Derivation of a rotator circuit with homogeneous interconnect
pp. 131-135(5)
Authors: Hofstee H.P.; Sawada J.

Formality works
pp. 137-142(6)
Author: Hoogerwoord R.R.

Recovering distributed objects^*
pp. 143-150(8)
Authors: James J.; Singh A.K.

Optimal real-time garbage collection for acyclic pointer structures
pp. 151-157(7)
Authors: Kaldewaij A.; de Vries L.

State-level and value-level simulations in data refinement^*
pp. 159-167(9)
Authors: Leal W.; Arora A.

Real estate of names
pp. 169-171(3)
Author: Leino K.R.M.

On the desirability of mechanizing calculational proofs
pp. 173-179(7)
Authors: Manolios P.; Moore J.S.

Towards an energy complexity of computation^*
pp. 181-187(7)
Author: Martin A.J.

The music of streams
pp. 189-195(7)
Author: McIlroy M.D.

A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation
pp. 197-200(4)
Author: Misra J.

Calculating sharp adaptation rules
pp. 201-208(8)
Author: Naumann D.A.

On the role of formal methods in security
pp. 209-212(4)
Author: Rao J.R.

The shortest path in parallel
pp. 213-217(5)
Author: Sanders B.A.