| 49 | -- | 51 | Vicki L. Almstrum, David Gries. From the Editors of this special issue |
| 53 | -- | 61 | Edsger W. Dijkstra. Under the spell of Leibniz s dream |
| 63 | -- | 70 | James H. Anderson, Mark Moir, Srikanth Ramamurthy. A simple proof technique for priority-scheduled systems |
| 71 | -- | 76 | Roland Carl Backhouse, Maarten M. Fokkinga. The associativity of equivalence and the Towers of Hanoi problem |
| 77 | -- | 84 | Lex Bijlsma. Model-based specification |
| 85 | -- | 87 | D. W. Braben. Bucking the trends |
| 89 | -- | 96 | W. H. J. Feijen. The joy of formula manipulation |
| 97 | -- | 108 | Cormac Flanagan, Rajeev Joshi, K. Rustan M. Leino. Annotation inference for modular checkers |
| 109 | -- | 114 | Mohamed G. Gouda. Elements of security: Closure, convergence, and protection |
| 115 | -- | 121 | Ted Herman, Toshimitsu Masuzawa. Available stabilizing heaps |
| 123 | -- | 129 | C. A. R. Hoare. Legacy |
| 131 | -- | 135 | H. Peter Hofstee, Jun Sawada. Derivation of a rotator circuit with homogeneous interconnect |
| 137 | -- | 142 | Rob R. Hoogerwoord. Formality works |
| 143 | -- | 150 | Jerry James, Ambuj K. Singh. Recovering distributed objects |
| 151 | -- | 157 | Anne Kaldewaij, Laurens de Vries. Optimal real-time garbage collection for acyclic pointer structures |
| 159 | -- | 167 | William Leal, Anish Arora. State-level and value-level simulations in data refinement |
| 169 | -- | 171 | K. Rustan M. Leino. Real estate of names |
| 173 | -- | 179 | Panagiotis Manolios, J. Strother Moore. On the desirability of mechanizing calculational proofs |
| 181 | -- | 187 | Alain J. Martin. Towards an energy complexity of computation |
| 189 | -- | 195 | M. Douglas McIlroy. The music of streams |
| 197 | -- | 200 | Jayadev Misra. A walk over the shortest path: Dijkstra s Algorithm viewed as fixed-point computation |
| 201 | -- | 208 | David A. Naumann. Calculating sharp adaptation rules |
| 209 | -- | 212 | Josyula R. Rao. On the role of formal methods in security |
| 213 | -- | 217 | Beverly A. Sanders. The shortest path in parallel |