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