summaryrefslogtreecommitdiff
path: root/real.bib
blob: 442efdd95ef265ff036a9fada6da6b669a5f9d47 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
@Collection{abramsky_1992:_backg_mathem_struct,
  crossref =	 {abramsky_1992:_handb_logic_comput_scien},
  date =	 {1992-12-10},
  editor =	 {Abramsky, S. and Gabbay, Dov M. and Maibaum,
		  T. S. E.},
  isbn =	 {0-19-853735-2},
  pagetotal =	 {xii+827~\ppno},
  title =	 {Background: Mathematical Structures},
  volume =	 1,
}

@Collection{abramsky_1993:_backg_comp_struct,
  crossref =	 {abramsky_1992:_handb_logic_comput_scien},
  date =	 {1993-03-18},
  editor =	 {Abramsky, S. and Gabbay, Dov M. and Maibaum,
		  T. S. E.},
  title =	 {Background: Computational Structures},
  volume =	 2,
}

@Collection{abramsky_1995:_seman_model,
  crossref =	 {abramsky_1992:_handb_logic_comput_scien},
  date =	 {1995-06-15},
  editor =	 {Abramsky, S. and Gabbay, Dov M. and Maibaum,
		  T. S. E.},
  title =	 {Semantic Modelling},
  volume =	 4,
}

@Collection{abramsky_1995:_seman_struc,
  crossref =	 {abramsky_1992:_handb_logic_comput_scien},
  date =	 {1995-06-15},
  editor =	 {Abramsky, S. and Gabbay, Dov M. and Maibaum,
		  T. S. E.},
  isbn =	 {0-19-853762-X},
  pagetotal =	 {xv+490~\ppno},
  title =	 {Semantic Structures},
  volume =	 3,
}

@Collection{abramsky_2001:_logic_algeb_method,
  crossref =	 {abramsky_1992:_handb_logic_comput_scien},
  date =	 {2001-04-05},
  editor =	 {Abramsky, S. and Gabbay, Dov M. and Maibaum,
		  T. S. E.},
  title =	 {Logic and Algebraic Methods},
  volume =	 5,
}

@MvCollection{abramsky_1992:_handb_logic_comput_scien,
  date =	 {1992-12-10/2001-04-05},
  editor =	 {Abramsky, S. and Gabbay, Dov M. and Maibaum,
		  T. S. E.},
  language =	 {english},
  location =	 {New York},
  publisher =	 {Oxford University Press Inc.},
  related =
		  {abramsky_1992:_backg_mathem_struct,abramsky_1993:_backg_comp_struct,abramsky_1995:_seman_struc,abramsky_1995:_seman_model,abramsky_2001:_logic_algeb_method},
  relatedtype =	 {multivolume},
  title =	 {Handbook of Logic in Computer Science},
  volumes =	 5,
}

@InCollection{abramsky_jung_1995:_domain_theor,
  author =	 {Abramsky, Samson and Jung, Achim},
  crossref =	 {abramsky_1995:_seman_struc},
  pages =	 {1-168},
  title =	 {Domain Theory},
}

@InCollection{tennent_1995:_denot_seman,
  author =	 {Tennent, R. D.},
  crossref =	 {abramsky_1995:_seman_struc},
  pages =	 {169-322},
  title =	 {Denotational Semantics},
}

@Book{adler_doren_1974:_how_to_read_book,
  author =	 {Adler, Mortimer J. and van Doren, Charles},
  title =	 {How To Read a Book},
  publisher =	 {Simon \& Schuster, Inc.},
  date =	 1974,
  isbn =	 {0-671-21209-5},
  location =	 {New York, New York},
  pagetotal =	 {xiii+426~\ppno},
  subtitle =	 {The Classic Guide to Intelligent Reading},
}

@InCollection{lambek_1982:_influen_herac_moder_mathem,
  _checked =	 {2020-05-27},
  _source =	 {ev},
  abstract =	 {Among the pre-Socratic philosophers we know that
		  Thales, Pythagoras, Zeno and Democritus were
		  involved in mathematics in one way or another. In
		  fact, Pythagoras coined the very word
		  ``mathematics.'' Heraclitus does not appear to have
		  occupied himself with mathematical questions; so how
		  can he be said to have influenced modern
		  mathematics? The answer to this question will take
		  us on a small detour.},
  author =	 {Lambek, J.},
  crossref =	 {agassi_cohen_1982:_scien_philos_today},
  date =	 1982,
  doi =		 {10.1007/978-94-009-8462-2_6},
  pages =	 {111-121},
  title =	 {The Influence of {H}eraclitus on Modern Mathematics},
}

@Collection{agassi_cohen_1982:_scien_philos_today,
  _checked =	 {2020-05-27},
  _source =	 {ev},
  date =	 1982,
  doi =		 {10.1007/978-94-009-8462-2},
  editor =	 {Agassi, Joseph and Cohen, Robert S.},
  isbn =	 {978-94-009-8462-2},
  location =	 {Dordrecht, Holland},
  number =	 67,
  pagetotal =	 {x+513~\ppno},
  publisher =	 {D. Reidel Publishing Company},
  series =	 {Boston Studies in the Philosophy of Science},
  subtitle =	 {Essays in Honor of {M}ario {B}unge},
  title =	 {Scientific Philosophy Today},
}

@InProceedings{smyth_1980:_comput_categ,
  author =	 {Smyth, M. B.},
  title =	 {Computability in Categories},
  pages =	 {609-620},
  doi =		 {10.1007/3-540-10003-2_102},
  crossref =	 {bakker_leeuwen_1980:_autom_languag_progr},
}

@Proceedings{bakker_leeuwen_1980:_autom_languag_progr,
  date =	 1980,
  doi =		 {10.1007/3-540-10003-2},
  editor =	 {de Bakker, Jaco W. and van Leeuwen, Jan},
  eventdate =	 {1980-07-14/1980-07-18},
  eventtitle =	 {Seventh International Colloquium on Automata,
		  Languages and Programming},
  eventtitleaddon ={ICALP'80},
  isbn =	 {978-3-540-39346-7},
  label =	 {ICALP'80},
  location =	 {Berlin},
  number =	 85,
  pagetotal =	 {viii+671~\ppno},
  publisher =	 {Springer-Verlag Berlin Heidelberg},
  series =	 {Lecture Notes in Computer Science},
  title =	 {Automata, Languages and Programming},
  venue =	 {Noordwijkerhout, the Netherlands},
}

@Article{barnes_1945:_myth_sense_data,
  author =	 {Barnes, Winston H. F.},
  title =	 {The Myth of Sense-Data},
  volume =	 45,
  pages =	 {89-117},
  date =	 1945,
  eprint =	 4544398,
  eprinttype =	 {jstor},
  journaltitle = {Proceedings of the Aristotelian Society},
  series =	 {newseries},
  issuetitle =	 {Containing the Papers read before the Society during
		  the Sixty-Sixth Session, 1944--1945},
}

@InBook{bekic_1984:_defin_operat_gener,
  _note =	 {cover of book has Beki{\v{c}}, while paper in book
		  has Beki{\'{c}}},
  author =	 {Beki{\'{c}}, Hans},
  crossref =	 {bekic_1984:_progr_languag_their_defin},
  doi =		 {10.1007/bfb0048939},
  pages =	 {30-55},
  title =	 {Definable Operations in General Algebras, and the
		  Theory of Automata and Flowcharts},
}

@Book{bekic_1984:_progr_languag_their_defin,
  author =	 {Beki{\v{c}}, Hans},
  publisher =	 {Springer-Verlag Berlin Heidelberg},
  Title =	 {Programming Languages and Their Definition},
  date =	 1984,
  doi =		 {10.1007/BFb0048933},
  editor =	 {Jones, C. B.},
  introduction = {Jones, Cliff B.},
  isbn =	 {978-3-540-38933-0},
  number =	 177,
  series =	 {Lecture Notes in Computer Science},
  subtitle =	 {Selected Papers},
}

@Thesis{bowden_2018:_reinin_crown_author_dissol,
  _source =	 {ev},
  _checked =	 {2020-06-20},
  author =	 {Bowden, James W. J.},
  date =	 {2018-09},
  institution =	 {Carleton University},
  location =	 {Ottawa, Ontario},
  pagetotal =	 {vii+168~\ppno},
  title =	 {Reining in the Crown's Authority over Dissolution:
		  \mkbibemph{The Fixed-Term Parliaments Act} of the
		  United Kingdom versus Fixed-Date Election Laws in
		  Canada},
  type =	 {mastersthesis},
}

@Unpublished{cheng_lauda_2004:_higher_dimen_categ,
  _checked =	 {2020-07-14},
  _source =	 {ev},
  author =	 {Cheng, Eugenia and Lauda, Aaron},
  date =	 {2004-08-19},
  pagetotal =	 {viii+172~\ppno},
  pubstate =	 {inpreparation},
  subtitle =	 {An Illustrated Guide Book},
  title =	 {Higher-Dimensional Categories},
}

@Unpublished{cheng_lauda_2004:_higher_dimen_categ,
  _checked =	 {2020-07-14},
  _source =	 {ev},
  author =	 {Cheng, Eugenia and Lauda, Aaron},
  date =	 {2004-08-19},
  pagetotal =	 {viii+172~\ppno},
  pubstate =	 {inpreparation},
  subtitle =	 {An Illustrated Guide Book},
  title =	 {Higher-Dimensional Categories},
}

@InProceedings{lehmann_1981:_impar_justic_fairn,
  author =	 {Lehmann, D. and Pnueli, A. and Stavi, J.},
  title =	 {Impartiality, Justice and Fairness: {T}he Ethics of
		  Concurrent Termination},
  pages =	 {264-277},
  doi =		 {10.1007/3-540-10843-2_22},
  _checked =	 {2020-07-21},
  _source =	 {ev},
  abstract =	 {The method of well founded structures for proving
		  termination of programs is extended to concurrent
		  programs. The more complicated case is when a
		  program terminates only for fair
		  executions. Different versions of fairness are
		  introduced: Impartiality, Fairness and Justice, and
		  Methods for proving their termination are
		  presented.},
  crossref =	 {even_kariv_1981:_autom_languag_progr},
  date =	 1981,
}

@Proceedings{even_kariv_1981:_autom_languag_progr,
  _checked =	 {2020-07-21},
  _source =	 {ev},
  date =	 1981,
  doi =		 {10.1007/3-540-10843-2},
  editor =	 {Even, Shimon and Kariv, Oded},
  eventdate =	 {1981-07-13/1981-07-17},
  eventtitle =	 {Eigth International Colloquium on Automata,
		  Languages and Programming},
  eventtitleaddon ={ICALP'81},
  isbn =	 {978-3-540-38745-9},
  label =	 {ICALP'81},
  number =	 115,
  pagetotal =	 {viii+552~\ppno},
  publisher =	 {Springer-Verlag Berlin Heidelberg},
  series =	 {Lecture Notes in Computer Science},
  title =	 {Automata, Languages and Programming},
  venue =	 {Acre (Akko), Israel},
}

@Book{francez_1986:_fairn,
  author =	 {Francez, Nissim},
  title =	 {Fairness},
  publisher =	 {Springer-Verlag New York Inc.},
  _checked =	 {2020-08-07},
  _source =	 {ev},
  abstract =	 {The main purpose of this book is to bring together
		  much of the research conducted in recent years in a
		  subject I find both fascinating and important,
		  namely fairness. Much of the reported research is
		  still in the form of technical reports, theses and
		  conference papers, and only a small part has already
		  appeared in the formal scientific journal
		  literature. Fairness is one of those concepts that
		  can intuitively be explained very briefly, but bear
		  a lot of consequences, both in theory and the
		  practicality of programming languages. Scientists
		  have traditionally been attracted to studying such
		  concepts. However, a rigorous study of the concept
		  needs a lot of detailed development, evoking much
		  machinery of both mathematics and computer
		  science. I am fully aware of the fact that this
		  field of research still lacks maturity, as does the
		  whole subject of theoretical studies of concurrency
		  and nondeterminism. One symptom of this lack of
		  maturity is the proliferation of models used by the
		  research community to discuss these issues, a
		  variety lacking the invariance property present, for
		  example, in universal formalisms for sequential
		  computing.},
  date =	 1986,
  doi =		 {10.1007/978-1-4612-4886-6},
  isbn =	 {978-1-4612-4886-6},
  pagetotal =	 {xiii+295~\ppno},
  series =	 {Texts and Monographs in Computer Science},
}

@Book{girard_1989:_proof_types,
  _source =	 {pv},
  _checked =	 {2020-07-02},
  author =	 {Girard, Jean-Yves and Lafont, Yves and Taylor, Paul},
  title =	 {Proofs and Types},
  publisher =	 {Press Syndicate of the University of Cambridge},
  date =	 1989,
  isbn =	 {0-521-37181-3},
  location =	 {Cambridge, United Kingdom},
  pagetotal =	 {xi+176~\ppno},
  series =	 {Cambridge Tracts in Theoretical Computer Science},
  number =	 7,
}

@Book{girard_2006:_vers_la_perfec,
  author =	 {Girard, Jean-Yves},
  title =	 {Vers la perfection},
  crossref =	 {girard_2006:_le_point_aveug},
  date =	 {2006-05},
  isbn =	 {2 7056 6633 X},
  language =	 {french},
  location =	 {Paris, France},
  pagetotal =	 {xvi+280~\ppno},
  volume =	 1,
}


@Book{girard_2007:_vers_limper,
  author =	 {Girard, Jean-Yves},
  title =	 {Vers l'imperfection},
  crossref =	 {girard_2006:_le_point_aveug},
  date =	 {2007-03-17},
  isbn =	 9782705666347,
  language =	 {french},
  location =	 {Paris, France},
  pagetotal =	 570,
  volume =	 2,
}


@MvBook{girard_2006:_le_point_aveug,
  author =	 {Girard, Jean-Yves},
  date =	 {2006-05/2007-03},
  language =	 {french},
  publisher =	 {Hermann {\'E}diteurs},
  related =	 {girard_2006:_vers_la_perfec,girard_2007:_vers_limper},
  relatedtype =	 {multivolume},
  series =	 {Visions des sciences},
  subtitle =	 {Cours de logique},
  title =	 {Le Point Aveugle},
  volumes =	 2,
}

@InBook{hasegawa_1999:_recur_cyclic_sharin,
  chapter =	 7,
  crossref =	 {hasegawa_1999:_model_sharin_graph},
  doi =		 {10.1007/978-1-4471-0865-8_7},
  pages =	 {83-101},
  title =	 {Recursion from Cyclic Sharing},
}

@Book{hasegawa_1999:_model_sharin_graph,
  author =	 {Hasegawa, Masahito},
  title =	 {Models of Sharing Graphs},
  publisher =	 {Springer-Verlag London Limited},
  date =	 {1999-06},
  doi =		 {10.1007/978-1-4471-0865-8},
  isbn =	 {978-1-4471-0865-8},
  pagetotal =	 {xii+134~\ppno},
  related =	 {hasegawa_1997:_model_sharin_graph},
  relatedtype =	 {reprintof},
  series =	 {Distinguished Dissertations},
  subtitle =	 {A Categorical Semantics of \texttt{let} and
		  \texttt{letrec}},
}

@Misc{hyland_2013:_class_lambd_calcul_moder_dress,
  author =	 {Hyland, Martin},
  date =	 {2013-10-06},
  eprint =	 {1211.5762v2},
  eprintclass =	 {math.CT},
  eprinttype =	 {arxiv},
  title =	 {Classical Lambda Calculus in Modern Dress},
}

@Report{information_1981:_trans_contr_protoc,
  author =	 {{Information Sciences Institute, University of
		  Southern California}},
  date =	 {1981-09},
  doi =		 {10.17487/RFC0793},
  editor =	 {Postel, Jon},
  institution =	 {Internet Engineering Task Force},
  number =	 793,
  title =	 {Transmission Control Protocol},
  titleaddon =	 {{DARPA} Internet Program Protocol Specification},
  type =	 {RFC},
}

@Report{kahn_macqueen_1976:_corout_networ_paral_proces,
  author =	 {Kahn, Gilles and Macqueen, David},
  date =	 1976,
  institution =	 {INRIA},
  language =	 {english},
  number =	 {inria-00306565},
  pagetotal =	 20,
  title =	 {Coroutines and Networks of Parallel Processes},
  type =	 {resreport},
  url =		 {https://hal.inria.fr/inria-00306565},
  version =	 1,
}

@Book{knuth_1998:_sortin_searc,
  author =	 {Knuth, Donald E.},
  title =	 {Sorting and Searching},
  _checked =	 {2020-07-09},
  _source =	 {pv},
  crossref =	 {knuth_1998:_art_comput_progr},
  date =	 1998,
  isbn =	 {0-201-89685-0},
  pagetotal =	 {xiv+780~\ppno},
  volume =	 3,
}

@MvBook{knuth_1998:_art_comput_progr,
  _checked =	 {2020-07-09},
  _source =	 {pv},
  author =	 {Knuth, Donald E.},
  date =	 1998,
  edition =	 2,
  isbn =	 {978-0-201-48541-7},
  location =	 {Upper Saddle River, New Jersey},
  publisher =	 {Addison-Wesley},
  related =	 {knuth_1998:_sortin_searc},
  relatedtype =	 {multivolume},
  title =	 {The Art of Computer Programming},
  volumes =	 3,
}

@Collection{leeuwen_1990:_formal_model_seman,
  _source =	 {ev},
  _checked =	 {2020-07-08},
  crossref =	 {leeuwen_1990:_handb_theor_comput_scien},
  date =	 1990,
  editor =	 {van Leeuwen, Jan},
  isbn =	 {0-262-22039-3},
  pagetotal =	 {vi+1273~\ppno},
  title =	 {Formal Models and Semantics},
  volume =	 {B},
}

@MvCollection{leeuwen_1990:_handb_theor_comput_scien,
  _checked =	 {2020-07-08},
  _source =	 {ev},
  date =	 1990,
  editor =	 {van Leeuwen, Jan},
  isbn =	 {0-262-22040-7},
  location =	 {Amsterdam, The Netherlands and Cambridge,
		  Massachusetts},
  publisher =	 {Elsevier Science Publishers B.V. and The MIT Press},
  related =	 {leeuwen_1990:_formal_model_seman},
  relatedtype =	 {multivolume},
  title =	 {Handbook of Theoretical Computer Science},
  volumes =	 2,
}

@Thesis{lehmann_1976:_categ_fixpoin_seman_thesis,
  _checked =	 {2020-06-08},
  _source =	 {ev},
  author =	 {Lehmann, Daniel J.},
  date =	 1976,
  institution =	 {Department of Computer Science, University of
		  Warwick},
  location =	 {Coventry, United Kingdom},
  pagetotal =	 75,
  title =	 {Categories for Fixpoint Semantics},
  type =	 {phdthesis},
}

@Misc{leinster_2012:_rethin_set_theor,
  _checked =	 {2020-07-14},
  _source =	 {ev},
  author =	 {Leinster, Tom},
  date =	 {2012-12-28},
  eprint =	 {1212.6543v1},
  eprintclass =	 {math.LO},
  eprinttype =	 {arxiv},
  pagetotal =	 8,
  title =	 {Rethinking Set Theory},
}

@Report{milner_1971:_algeb_defin_simul_between_progr,
  author =	 {Milner, Robin},
  date =	 {1971-02},
  institution =	 {Stanford Artificial Intelligence Project, Computer
		  Science Department, Stanford University},
  location =	 {Stanford, California},
  number =	 {STAN-CS-205, AIM-142},
  pagetotal =	 22,
  title =	 {An Algebraic Definition of Simulation Between
		  Programs},
  type =	 {techreport},
}

@Book{sangiorgi_2012:_introd_bisim_coind,
  author =	 {Sangiorgi, Davide},
  title =	 {Introduction to Bisimulation and Coinduction},
  publisher =	 {Cambridge University Press},
  date =	 {2012-08},
  doi =		 {10.1017/CBO9780511777110},
  isbn =	 9780511777110,
  location =	 {Cambridge, United Kingdom},
  pagetotal =	 {xii+247~\ppno},
}

@InCollection{jacobs_rutten_2012:_introd_coalg_coind,
  author =	 {Jacobs, Bart and Rutten, Jan},
  crossref =	 {sangiorgi_rutten_2012:_advan_topic_bisim_coind},
  date =	 2012,
  pages =	 {38-99},
  title =	 {An Introduction to (Co)algebra and (Co)induction},
}

@Collection{sangiorgi_rutten_2012:_advan_topic_bisim_coind,
  date =	 2012,
  editor =	 {Sangiorgi, Davide and Rutten, Jan},
  isbn =	 {978-1-107-00497-9},
  location =	 {Cambridge, United Kingdom},
  number =	 52,
  pagetotal =	 {xiii+326~\ppno},
  publisher =	 {Cambridge University Press},
  series =	 {Cambridge Tracts in Theoretical Computer Science},
  title =	 {Advanced Topics in Bisimulation and Coinduction},
}


@InProceedings{pfenning_2002:_logic_framew,
  author =	 {Pfenning, Frank},
  title =	 {Logical Frameworks---A Brief Introduction},
  pages =	 {137-166},
  doi =		 {10.1007/978-94-010-0413-8_5},
  abstract =	 {A logical framework is a meta-language for the
		  formalization of deductive systems. We provide a
		  brief introduction to logical frameworks and their
		  methodology, concentrating on LF. We use first-order
		  logic as the running example to illustrate the
		  representations of syntax, natural deductions, and
		  proof transformations.  We also sketch a recent
		  formulation of LF centered on the notion of
		  canonical form, and show how it affects proofs of
		  adequacy of encodings.},
  crossref =	 {2002:_proof_system_reliab},
  date =	 2002,
}

@Proceedings{2002:_proof_system_reliab,
  date =	 2002,
  doi =		 {10.1007/978-94-010-0413-8},
  eventdate =	 {2001-07-24/2001-09-05},
  eventtitle =	 {NATO Advanced Study Institute on Proof and
		  System-Reliability},
  isbn =	 {978-94-010-0413-8},
  location =	 {Dordrecht},
  number =	 62,
  pagetotal =	 {xii+415~\ppno},
  publisher =	 {Springer-Science+ Business Media, B.V.},
  series =	 {NATO Science Series (Series II: Mathematics, Physics
		  and Chemistry)},
  title =	 {Proof and System-Reliability},
  venue =	 {Marktoberdorf, Germany},
}