nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Annotation inference for modular checkers
|
Flanagan, Cormac |
|
2001 |
|
2-4 |
p. 97-108 12 p. |
artikel |
2 |
A simple proof technique for priority-scheduled systems
|
Anderson, James H. |
|
2001 |
|
2-4 |
p. 63-70 8 p. |
artikel |
3 |
Available stabilizing heaps
|
Herman, Ted |
|
2001 |
|
2-4 |
p. 115-121 7 p. |
artikel |
4 |
A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation
|
Misra, Jayadev |
|
2001 |
|
2-4 |
p. 197-200 4 p. |
artikel |
5 |
Bucking the trends
|
Braben, D.W. |
|
2001 |
|
2-4 |
p. 85-87 3 p. |
artikel |
6 |
Calculating sharp adaptation rules
|
Naumann, David A. |
|
2001 |
|
2-4 |
p. 201-208 8 p. |
artikel |
7 |
Derivation of a rotator circuit with homogeneous interconnect
|
Hofstee, H.Peter |
|
2001 |
|
2-4 |
p. 131-135 5 p. |
artikel |
8 |
Elements of security: Closure, convergence, and protection
|
Gouda, Mohamed G. |
|
2001 |
|
2-4 |
p. 109-114 6 p. |
artikel |
9 |
Formality works
|
Hoogerwoord, Rob R. |
|
2001 |
|
2-4 |
p. 137-142 6 p. |
artikel |
10 |
From the Editors of this special issue
|
Almstrum, Vicki L. |
|
2001 |
|
2-4 |
p. 49-51 3 p. |
artikel |
11 |
Legacy ☆ ☆ Presented as an invited keynote talk at IFIP WCC in September, 2000. Reprinted here with permission from Kluwer Publishing.
|
Hoare, Tony |
|
2001 |
|
2-4 |
p. 123-129 7 p. |
artikel |
12 |
Model-based specification
|
Bijlsma, Lex |
|
2001 |
|
2-4 |
p. 77-84 8 p. |
artikel |
13 |
On the desirability of mechanizing calculational proofs
|
Manolios, Panagiotis |
|
2001 |
|
2-4 |
p. 173-179 7 p. |
artikel |
14 |
On the role of formal methods in security
|
Rao, Josyula R. |
|
2001 |
|
2-4 |
p. 209-212 4 p. |
artikel |
15 |
Optimal real-time garbage collection for acyclic pointer structures
|
Kaldewaij, Anne |
|
2001 |
|
2-4 |
p. 151-157 7 p. |
artikel |
16 |
Real estate of names
|
Leino, K.Rustan M. |
|
2001 |
|
2-4 |
p. 169-171 3 p. |
artikel |
17 |
Recovering distributed objects ☆ ☆ This research was partially supported by US NSF grants CCR-9505807, CCR-9972571, and CCR-9877142.
|
James, Jerry |
|
2001 |
|
2-4 |
p. 143-150 8 p. |
artikel |
18 |
State-level and value-level simulations in data refinement ☆ ☆ This work was partially sponsored by NSA Grant MDA904-96-1-0111, NSF Grant NSF-CCR-9972368, an Ameritech Faculty Fellowship, and a grant from Microsoft Research.
|
Leal, William |
|
2001 |
|
2-4 |
p. 159-167 9 p. |
artikel |
19 |
The associativity of equivalence and the Towers of Hanoi problem
|
Backhouse, Roland |
|
2001 |
|
2-4 |
p. 71-76 6 p. |
artikel |
20 |
The joy of formula manipulation
|
Feijen, W.H.J. |
|
2001 |
|
2-4 |
p. 89-96 8 p. |
artikel |
21 |
The music of streams
|
McIlroy, M.Douglas |
|
2001 |
|
2-4 |
p. 189-195 7 p. |
artikel |
22 |
The shortest path in parallel
|
Sanders, Beverly A. |
|
2001 |
|
2-4 |
p. 213-217 5 p. |
artikel |
23 |
Towards an energy complexity of computation ☆ ☆ The research described in this paper was sponsored by the Defense Advanced Research Projects Agency and monitored by the Air Force under contract F29601-00-K-0184.
|
Martin, Alain J. |
|
2001 |
|
2-4 |
p. 181-187 7 p. |
artikel |
24 |
Under the spell of Leibniz's dream ☆ ☆ On May 13, 2000, during the symposium In Pursuit of Simplicity held in honor of his retirement, Edsger W. Dijkstra delivered this, EWD 1298, as his Farewell Lecture.
|
Dijkstra, Edsger W. |
|
2001 |
|
2-4 |
p. 53-61 9 p. |
artikel |