-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathreferences.bib
1924 lines (1742 loc) · 60.3 KB
/
references.bib
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
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@inproceedings{lenses,
author = {Bohannon, Aaron and Foster, J. Nathan and Pierce, Benjamin C. and Pilkiewicz, Alexandre and Schmitt, Alan},
title = {Boomerang: Resourceful Lenses for String Data},
year = {2008},
isbn = {9781595936899},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1328438.1328487},
doi = {10.1145/1328438.1328487},
booktitle = {Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
pages = {407–419},
numpages = {13},
keywords = {regular types, lenses, view update problem, regular string transducers, bidirectional languages},
location = {San Francisco, California, USA},
series = {POPL '08}
}
%% Program logics {{{
@article{hoarelog,
title={An axiomatic basis for computer programming},
author={Hoare, Charles Antony Richard},
journal={Communications of the ACM},
volume={12},
number={10},
pages={576--580},
year={1969},
publisher={ACM New York, NY, USA}
}
@article{melocoton,
title={Melocoton: A program logic for verified interoperability between OCaml and C},
author={Gu{\'e}neau, Arma{\"e}l and Hostert, Johannes and Spies, Simon and Sammler, Michael and Birkedal, Lars and Dreyer, Derek},
journal={Proceedings of the ACM on Programming Languages},
volume={7},
number={OOPSLA2},
pages={716--744},
year={2023},
publisher={ACM New York, NY, USA}
}
%% }}}
% Foundations {{{
%% Kleene Algebra {{{
@techreport{tka,
title={Typed {K}leene algebra},
author={Kozen, Dexter},
year={1998},
month=mar,
institution={Cornell University},
number={TR98-1669},
url={https://hdl.handle.net/1813/7323}
}
@inproceedings{pom,
title={Partially ordered monads and powerset {K}leene algebras},
author={Eklund, Patrik and G{\"a}hler, Werner},
booktitle={Proceedings of the 10th Information Processing and Management of
Uncertainty in Knowledge Based Systems Conference},
series={IPMU 2004},
volume={3},
pages={1865--1869},
year={2004},
url={http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7910}
}
@inproceedings{kleenem,
title={Kleene monads: handling iteration in a framework of generic effects},
author={Goncharov, Sergey and Schr{\"o}der, Lutz and Mossakowski, Till},
booktitle={International Conference on
Algebra and Coalgebra in Computer Science},
pages={18--33},
year={2009},
organization={Springer}
}
@inproceedings{failkat,
title={Equational Theories of Abnormal Termination Based on Kleene Algebra},
author={Mamouras, Konstantinos},
booktitle={International Conference on
Foundations of Software Science and Computation Structures},
pages={88--105},
year={2017},
organization={Springer}
}
%}}}
%% Abstract Interpretation {{{
@inproceedings{absint,
title={Abstract interpretation: a unified lattice model for static
analysis of programs by construction or approximation of fixpoints},
author={Cousot, Patrick and Cousot, Radhia},
booktitle={Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on
Principles of programming languages},
pages={238--252},
year={1977},
organization={ACM}
}
@article{aif,
title={Abstract interpretation frameworks},
author={Cousot, Patrick and Cousot, Radhia},
journal={J. Log. Comput.},
volume={2},
number={4},
pages={511--547},
year={1992},
publisher={Oxford University Press}
}
@inproceedings{aigp,
title={Abstract interpretation of game properties},
author={Henzinger, Thomas A and Majumdar, Rupak and Mang, Freddy and
Raskin, Jean-Fran{\c{c}}ois},
booktitle={International Static Analysis Symposium},
pages={220--239},
year={2000},
organization={Springer}
}
%%}}}
%% Category theory {{{
@book{ctcs,
title={Basic category theory for computer scientists},
author={Pierce, Benjamin C},
year={1991},
publisher={MIT press},
isbn={9780262660716},
}
@book{awodeyct,
title={Category theory},
author={Awodey, Steve},
year={2010},
publisher={Oxford university press},
isbn={9780199237180},
}
@book{maclane,
title={Categories for the working mathematician},
author={Mac Lane, Saunders},
year={1978},
publisher={Springer Science \& Business Media},
doi={10.1007/978-1-4757-4721-8},
}
@inproceedings{kappa,
author="Hasegawa, Masahito",
title="Decomposing typed lambda calculus into a couple of categorical
programming languages",
booktitle="Proceedings of the 6th International Conference on
Category Theory and Computer Science",
series="CTCS '95",
year="1995",
publisher="Springer",
address="Berlin, Heidelberg",
pages="200--219",
numpages="20",
doi="10.1007/3-540-60164-3_28",
}
@book{egg,
author = {Joyal, André and Tierney, Myles},
title = {An extension of the {Galois} theory of {Grothendieck}},
series = {Memoirs of the {American} {Mathematical} {Society}},
number = {309},
month = Sep,
year = {1984},
isbn = {978-0-8218-2312-5},
publisher = {American Mathematical Society},
}
@article{tpbm,
author = {Banaschewski, Bernhard and Nelson, Evelyn},
title = {Tensor products and bimorphisms},
journal = {Canadian Mathematical Bulletin},
volume = {19},
number = {4},
year = {1976},
pages = {385--402},
doi = {10.4153/CMB-1976-060-2}
}
%% }}}
@inproceedings{pts,
author = {Hutchins, DeLesley S.},
title = {Pure Subtype Systems},
booktitle = {Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages},
series = {POPL'10},
year = {2010},
isbn = {978-1-60558-479-9},
location = {Madrid, Spain},
pages = {287--298},
numpages = {12},
url = {http://doi.acm.org/10.1145/1706299.1706334},
doi = {10.1145/1706299.1706334},
acmid = {1706334},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {abstract reduction systems, dependent types, singleton types,
subtyping, transitivity elimination},
}
@article{ccs,
title={A calculus of communicating systems},
author={Milner, Robin},
journal={LNCS},
volume={92},
year={1980},
publisher={springer-Verlag}
}
%}}}
% Game semantics {{{
%% Introductory material {{{
@incollection{cspgs,
author="Abramsky, Samson",
title="From {CSP} to Game Semantics",
booktitle="Reflections on the Work of C.A.R. Hoare",
year="2010",
publisher="Springer",
address="London",
pages="33--45",
abstract="In this short essay, we describe in informal terms how game
semantics can be seen to arise as a perturbation of process calculi such
as CSP, by making an explicit distinction between the r{\^o}les of the
System and the Environment. Drawing out the consequences of this
distinction uncovers a wealth of mathematical structure, with Game
intuitions entering in a natural and compelling fashion. This leads
ultimately to the elaboration of mathematically well-structured and
behaviourally expressive semantic universes for computation. These
provide a basis for fully abstract models of a wide range of programming
languages, and lead on to algorithmic methods, with applications to
compositional model-checking and program analysis.",
isbn="978-1-84882-912-1",
doi="10.1007/978-1-84882-912-1_2",
url="https://doi.org/10.1007/978-1-84882-912-1_2"
}
@incollection{rosetta,
title={Physics, topology, logic and computation: a {R}osetta {S}tone},
author={Baez, John and Stay, Mike},
booktitle={New structures for physics},
pages={95--172},
year={2010},
publisher={Springer},
address={Berlin, Heidelberg},
doi={10.1007/978-3-642-12821-9_2}
}
@inproceedings{gamesem99,
title={Game semantics},
author={Abramsky, Samson and McCusker, Guy},
booktitle={Computational logic: Proceedings of the 1997 Marktoberdorf Summer School},
year={1999},
publisher="Springer",
address="Berlin, Heidelberg",
pages="1--55",
abstract="The aim of this chapter is to give an introduction to some
recent work on the application of game semantics to the study of
programming languages.",
isbn="978-3-642-58622-4",
doi="10.1007/978-3-642-58622-4_1"
}
@article{pcfajm,
title = "Full Abstraction for PCF",
journal = "Inf. Comput.",
volume = "163",
number = "2",
pages = "409--470",
year = "2000",
issn = "0890-5401",
doi = "10.1006/inco.2000.2930",
url = "http://www.sciencedirect.com/science/article/pii/S0890540100929304",
author = "Samson Abramsky and Radha Jagadeesan and Pasquale Malacaria",
keywords = "game semantics, full abstraction, sequentiality, PCF,
functional computation, programming language semantics, linear logic",
abstract = "An intensional model for the programming language PCF is
described in which the types of PCF are interpreted by games and the
terms by certain history-free strategies. This model is shown to capture
definability in PCF. More precisely, every compact strategy in the model
is definable in a certain simple extension of PCF. We then introduce an
intrinsic preorder on strategies and show that it satisfies some
striking properties such that the intrinsic preorder on function types
coincides with the pointwise preorder. We then obtain an
order-extensional fully abstract model of PCF by quotienting the
intensional model by the intrinsic preorder. This is the first
syntax-independent description of the fully abstract model for PCF.
(Hyland and Ong have obtained very similar results by a somewhat
different route, independently and at the same time.) We then consider
the effective version of our model and prove a universality theorem:
every element of the effective extensional model is definable in PCF.
Equivalently, every recursive strategy is definable up to observational
equivalence."
}
@article{pcfho,
title={On Full Abstraction for {PCF}: {I}, {II}, and {III}},
author={Hyland, J. M. E. and Ong, C.-H. L.},
journal={Inf. Comput.},
volume={163},
number={2},
pages={285--408},
year={2000},
publisher={Elsevier},
doi={10.1006/inco.2000.2917},
}
@article{gsll,
title={A game semantics for linear logic},
author={Blass, Andreas},
journal={Ann. Pure Appl. Log.},
volume={56},
number={1--3},
pages={183--220},
year={1992},
issn={0168-0072},
doi={10.1016/0168-0072(92)90073-9},
publisher={Elsevier}
}
@article{gsllaj,
title={Games and full completeness for multiplicative linear logic},
author={Abramsky, Samson and Jagadeesan, Radha},
journal={J. Symb. Log.},
volume={59},
number={2},
pages={543--574},
year={1994},
publisher={Cambridge University Press}
}
%}}}
%% Nondeterminism {{{
@inproceedings{gsfnd,
title={A fully abstract game semantics for finite nondeterminism},
author={Harmer, Russell and McCusker, Guy},
booktitle = {Proceedings of the 14th Annual IEEE Symposium on
Logic in Computer Science},
series={LICS '99},
pages={422--430},
year={1999},
doi={10.1109/LICS.1999.782637},
publisher = {IEEE Computer Society},
address = {USA},
}
@inproceedings{gscnd,
author = {W. John Gowers and James D. Laird},
title = {A Fully Abstract Game Semantics for Countable Nondeterminism},
booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-088-0},
ISSN = {1868-8969},
year = {2018},
volume = {119},
editor = {Dan Ghica and Achim Jung},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9691},
URN = {urn:nbn:de:0030-drops-96918},
doi = {10.4230/LIPIcs.CSL.2018.24},
annote = {Keywords: semantics, nondeterminism, games and logic}
}
@inproceedings{gsndsheaves,
title={Nondeterminism in game semantics via sheaves},
author={Tsukada, Takeshi and Ong, C.-H. Luke},
booktitle={Proceedings of the 30th Annual ACM/IEEE Symposium on
Logic in Computer Science},
series={LICS 2015},
pages={220--231},
year={2015},
doi={10.1109/LICS.2015.30},
publisher={IEEE Computer Society},
address={USA}
}
@inproceedings{gseia,
author={Andrzej S. Murawski},
booktitle={Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science},
series={LICS 2008},
title={Reachability Games and Game Semantics: Comparing Nondeterministic Programs},
year={2008},
pages={353-363},
doi = {10.1109/LICS.2008.24},
publisher = {IEEE Computer Society},
address = {USA},
month = {jun}
}
@inproceedings{nacgs,
title={Non-angelic concurrent game semantics},
author={Castellan, Simon and Clairambault, Pierre and Hayman, Jonathan
and Winskel, Glynn},
booktitle={Proceedings of the 21st International Conference on
Foundations of Software Science and Computation Structures},
series={FoSSaCS 2018},
pages={3--19},
year={2018},
doi={10.1007/978-3-319-89366-2_1},
isbn={978-3-319-89366-2},
publisher={Springer},
address={Cham, Switzerland},
}
%}}}
%% Concurrency {{{
@InProceedings{agames,
author="Melli{\`e}s, Paul-Andr{\'e} and Mimram, Samuel",
title="Asynchronous Games: Innocence Without Alternation",
booktitle="Proceedings of the 18th International Conference on
Concurrency Theory",
series="CONCUR 2007",
year="2007",
publisher="Springer",
address="Berlin, Heidelberg",
pages="395--411",
doi="10.1007/978-3-540-74407-8_27",
isbn="978-3-540-74407-8"
}
@inproceedings{agames2,
title={Asynchronous games 2: the true concurrency of innocence},
author={Mellies, Paul-Andr{\'e}},
booktitle={Proceedings of the 15th
International Conference on Concurrency Theory},
pages={448--465},
series={CONCUR 2004},
year={2004},
publisher={Springer},
address={Berlin, Heidelberg}
}
@article{tgames,
title={Categorical combinatorics of scheduling and synchronization in game semantics},
author={Melli{\`e}s, Paul-Andr{\'e}},
journal={Proceedings of the ACM on Programming Languages},
volume={3},
number={POPL},
pages={1--30},
year={2019},
publisher={ACM New York, NY, USA}
}
@InProceedings{asfgc,
author="Ghica, Dan R. and Murawski, Andrzej S.",
title="Angelic Semantics of Fine-Grained Concurrency",
booktitle="Proceedings of the 7th International Conference on
Foundations of Software Science and Computation Structures",
series="FoSSaCS 2004",
year="2004",
publisher="Springer",
address="Berlin, Heidelberg",
pages="211--225",
abstract="We introduce a game model for a procedural programming
language extended with primitives for parallel composition and
synchronization on binary semaphores. The model uses an interleaved
version of Hyland-Ong-style games, where most of the original
combinatorial constraints on positions are replaced with a simple
principle naturally related to static process creation. The model is
fully abstract for may-equivalence.",
doi="10.1007/978-3-540-24727-2_16",
isbn="978-3-540-24727-2",
}
@INPROCEEDINGS{cgames,
author = {Abramsky, Samson and Melli\`{e}s, Paul-Andr\'{e}},
title = {Concurrent Games and Full Completeness},
year = {1999},
isbn = {0769501583},
doi = {10.1109/LICS.1999.782638},
publisher = {IEEE Computer Society},
address = {USA},
booktitle = {Proceedings of the 14th Annual IEEE Symposium on
Logic in Computer Science},
pages = {431--442},
series = {LICS '99}
}
%% }}}
%% Various things {{{
@incollection{gsia,
author="Abramsky, Samson and McCusker, Guy",
title="Linearity, Sharing and State: A Fully Abstract Game Semantics for
{I}dealized {A}lgol with Active Expressions",
booktitle="Algol-like Languages",
year="1997",
publisher="Birkh{\"a}user",
address="Boston, MA",
pages="297--329",
abstract="The manipulation of objects with state which changes over time
is all-pervasive in computing. Perhaps the simplest example of such
objects are the program variables of classical imperative languages. An
important strand of work within the study of such languages, pioneered
by John Reynolds, focusses on Idealized Algol, an elegant synthesis of
imperative and functional features.",
isbn="978-1-4757-3851-3",
doi="10.1007/978-1-4757-3851-3_10",
url="https://doi.org/10.1007/978-1-4757-3851-3_10"
}
@inproceedings{gscontrol,
title={Full abstraction for functional languages with control},
author={Laird, James},
booktitle={Proceedings of the 12th Annual IEEE Symposium on
Logic in Computer Science},
series={LICS '97},
pages={58--67},
year={1997},
doi={10.1109/LICS.1997.614931},
publisher={IEEE Computer Society},
address={USA}
}
@inproceedings{gsconcur,
title={Angelic semantics of fine-grained concurrency},
author={Ghica, Dan R and Murawski, Andrzej S},
booktitle={International Conference on
Foundations of Software Science and Computation Structures},
pages={211--225},
year={2004},
organization={Springer}
}
@inproceedings{gsgr,
author = {Samson Abramsky and Kohei Honda and Guy Mccusker},
title = {A Fully Abstract Game Semantics for General References},
booktitle = {Proceedings of the Thirteenth Annual IEEE Symposium on
Logic in Computer Science},
year = {1998},
pages = {334--344},
publisher = {Society Press}
}
@article{mwjava,
title={Game semantics for interface middleweight {J}ava},
author={Murawski, Andrzej S and Tzevelekos, Nikos},
booktitle={ACM SIGPLAN Notices},
volume={49},
number={1},
pages={517--528},
year={2014},
publisher={ACM}
}
%}}}
%% Refinement {{{
@article{atl,
title={Alternating-Time Temporal Logic},
author={Alur, Rajeev and Henzinger, Thomas A and Kupferman, Orna},
journal = {J. ACM},
volume={49},
number={5},
pages={672--713},
numpages={42},
issn={0004-5411},
doi={10.1145/585265.585270},
year={2002},
month=sep,
publisher={ACM},
address={New York, NY, USA},
keywords={model checking, Alternation, temporaxl logic, games}
}
@inproceedings{altref,
author="Alur, Rajeev
and Henzinger, Thomas A.
and Kupferman, Orna
and Vardi, Moshe Y.",
title="Alternating refinement relations",
booktitle="Proceedings of the 9th International Conference on
Concurrency Theory",
series="CONCUR '98",
year="1998",
publisher="Springer",
address="Berlin, Heidelberg",
pages="163--178",
doi="10.1007/BFb0055622",
isbn="978-3-540-68455-8"
}
@inproceedings{rbgs-cal,
author = {Koenig, J\'{e}r\'{e}mie and Shao, Zhong},
title = {Refinement-Based Game Semantics for Certified Abstraction Layers},
booktitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on
Logic in Computer Science},
series = {LICS '20},
year = {2020},
isbn = {9781450371049},
publisher = {ACM},
address = {New York, NY, USA},
doi = {10.1145/3373718.3394799},
pages = {633–647},
numpages = {15},
}
% location = {Saarbr\"{u}cken, Germany},
@phdthesis{thesis,
title={Refinement-Based Game Semantics for Certified Components},
author={Koenig, Jeremie},
year={2020},
school={Yale University}
}
@inproceedings{act21,
author = {Koenig, J\'er\'emie},
title = {Grounding Game Semantics in Categorical Algebra},
booktitle = {Proceedings of the Fourth International Conference
on Applied Category Theory},
series = {ACT 2021},
year = {2021},
note = {To appear},
}
@article{popl22,
author = {Oliveira Vale, Arthur and Melli\`{e}s, Paul-Andr\'{e} and Shao,
Zhong and Koenig, J\'{e}r\'{e}mie and Stefanesco, L\'{e}o},
title = {Layered and Object-Based Game Semantics},
year = {2022},
issue_date = {January 2022},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {6},
number = {POPL},
doi = {10.1145/3498703},
journal = {Proc. ACM Program. Lang.},
month = jan,
articleno = {42},
numpages = {32},
keywords = {certified abstraction layers, program refinement, game semantics,
object-based semantics}
}
@article{ccr,
author = {Song, Youngju and Cho, Minki and Lee, Dongjae and Hur, Chung-Kil and Sammler, Michael and Dreyer, Derek},
title = {Conditional Contextual Refinement},
year = {2023},
issue_date = {January 2023},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {7},
number = {POPL},
doi = {10.1145/3571232},
journal = {Proc. ACM Program. Lang.},
month = jan,
articleno = {39},
numpages = {31},
keywords = {verification, Coq, separation logic, contextual refinement}
}
@software{compcertoe-artifact,
author = {Zhang, Yu and
Koenig, Jérémie and
Wang, Yuting and
Shao, Zhong},
title = {{Unifying compositional verification and certified
compilation with a three-dimensional refinement
algebra (artifact)}},
month = oct,
year = 2024,
publisher = {Zenodo},
doi = {10.5281/zenodo.14202535},
url = {https://doi.org/10.5281/zenodo.14202535}
}
@techreport{compcertoe-tr,
author = {Zhang, Yu and
Koenig, Jérémie and
Wang, Yuting and
Shao, Zhong},
title = {Unifying compositional verification and certified
compilation with a three-dimensional refinement
algebra (extended version)},
month = nov,
year = 2024,
institution = {Yale University},
number = {YALEU/DCS/TR1572},
}
%%}}}
@inproceedings{tmc,
title={Traced monoidal categories},
author={Joyal, Andr{\'e} and Street, Ross and Verity, Dominic},
booktitle={Mathematical Proceedings of the Cambridge Philosophical
Society},
volume={119},
number={3},
pages={447--468},
year={1996},
organization={Cambridge University Press}
}
@inproceedings{gsnecessary,
title={Is game semantics necessary?},
author={Blass, Andreas},
booktitle={International Workshop on Computer Science Logic},
pages={66--77},
year={1993},
organization={Springer}
}
@Inbook{objsem,
title="Global State Considered Unnecessary: Introduction to Object-Based Semantics",
author="Reddy, Uday S.",
editor="O'Hearn, Peter W. and Tennent, Robert D.",
bookTitle="Algol-like Languages",
year="1997",
publisher="Birkh{\"a}user Boston",
address="Boston, MA",
pages="227--295",
isbn="978-1-4757-3851-3",
doi="10.1007/978-1-4757-3851-3_9",
}
%}}}
% Dual nondeterminism {{{
%% Hoare logic etc {{{
@article{gc,
title={Guarded commands, nondeterminacy, and formal derivation of programs},
author={Dijkstra, Edsger W},
journal = {Commun. ACM},
volume = {18},
number = {8},
year = {1975},
month = aug,
pages = {453--457},
publisher = {ACM},
address = {New York, NY, USA},
issn = {0001-0782},
doi = {10.1145/360933.360975},
}
@article{specstm,
title={The specification statement},
author={Morgan, Carroll},
journal={ACM Trans. Program. Lang. Syst.},
volume={10},
number={3},
pages={403--419},
year={1988},
month=jul,
doi = {10.1145/44501.44503},
publisher={ACM},
address={New York, NY, USA}
}
%}}}
%% Refinement calculus {{{
@techreport{backthesis,
author="Back, Ralph-Johan",
title="On the correctness of refinement steps in program development",
year="1978",
institution="Department of Computer Science, University of Helsinky",
address="Helsinki, Finland",
isbn="951-45-1505-6",
issn="0356-6951",
number="A-1978-4",
}
@book{refcal,
author="Back, Ralph-Johan and Wright, Joakim von",
title="Refinement Calculus: A Systematic Introduction",
publisher="Springer",
address="New York",
year="1998",
doi="10.1007/978-1-4612-1674-2",
isbn="978-1-4612-1674-2"
}
@article{refcalgames,
title={Contracts, games, and refinement},
author={Back, Ralph-Johan and von Wright, Joakim},
journal={Inf. Comput.},
volume={156},
number={1-2},
pages={25--45},
year={2000},
publisher={Elsevier}
}
@incollection{multirel,
title={Binary multirelations},
author={Rewitzky, Ingrid},
booktitle={Theory and Applications of Relational Structures as
Knowledge Instruments},
pages={256--271},
year={2003},
doi={10.1007/978-3-540-24615-2_12},
publisher={Springer},
address={Berlin, Heidelberg},
}
@article{mrdnd,
title = "Modelling angelic and demonic nondeterminism with
multirelations",
journal = "Science of Computer Programming",
volume = "65",
number = "2",
pages = "140--158",
year = "2007",
issn = "0167-6423",
doi = "https://doi.org/10.1016/j.scico.2006.01.007",
author = "C.E. Martin and S.A. Curtis and I. Rewitzky",
keywords = "Multirelation, Predicate transformer, Agent, Strongest
postcondition, Angelic nondeterminism, Demonic nondeterminism, Resource
sharing",
abstract = "This paper presents an introduction to a calculus of binary
multirelations, which can model both angelic and demonic kinds of
non-determinism. The isomorphism between up-closed multirelations and
monotonic predicate transformers allows a different view of program
transformation, and program transformation calculations using
multirelations are easier to perform in some circumstances.
Multirelations are illustrated by modelling both kinds of
nondeterministic behaviour in games and resource-sharing protocols."
}
@inproceedings{dataref,
title={Changing data representation in the refinement calculus},
author={Back, Ralph-JR},
booktitle={Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track},
volume={2},
pages={231--232},
year={1989},
organization={IEEE Computer Society}
}
%}}}
%% Morris and Tyrrell {{{
@inproceedings{augtyp,
author="Morris, Joseph M.",
title="Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy",
booktitle="Proceedings of the 7th International Conference on
Mathematics of Program Construction",
series="MPC 2004",
year="2004",
publisher="Springer",
address="Berlin, Heidelberg",
pages="274--288",
doi="10.1007/978-3-540-27764-4_15",
isbn="978-3-540-27764-4"
}
@inproceedings{cspdnd,
author="Tyrrell, Malcolm
and Morris, Joseph M.
and Butterfield, Andrew
and Hughes, Arthur",
title="A Lattice-Theoretic Model for an Algebra of
Communicating Sequential Processes",
booktitle="Proceedings of the Third International Colloquium on
Theoretical Aspects of Computing",
series="ICTAC 2006",
year="2006",
publisher="Springer",
address="Berlin, Heidelberg",
pages="123--137",
doi="10.1007/11921240_9",
isbn="978-3-540-48816-3"
}
@article{dndf,
title={Dually nondeterministic functions},
author={Morris, Joseph M and Tyrrell, Malcolm},
journal={ACM Trans. Program. Lang. Syst.},
volume={30},
number={6},
pages={34},
numpages={34},
year={2008},
month=oct,
doi={10.1145/1391956.1391961},
publisher={ACM}
}
%}}}
%% Interface automata {{{
@article{ia,
title={Interface automata},
author={de Alfaro, Luca and Henzinger, Thomas A.},
journal={SIGSOFT Softw. Eng. Notes},
volume={26},
number={5},
month=sep,
pages={109--120},
year={2001},
publisher={ACM},
address={New York, NY, USA},
issn={0163-5948},
doi={10.1145/503271.503226},
}
@inproceedings{itcd,
title={Interface theories for component-based design},
author={de Alfaro, Luca and Henzinger, Thomas A.},
booktitle={Embedded Software: First International Workshop},
series={EMSOFT 2001},
pages={148--165},
year={2001},
doi={10.1007/3-540-45449-7_11},
publisher={Springer},
address={Berlin, Heidelberg}
}
@inproceedings{gmos,
author="de Alfaro, Luca",
title="Game Models for Open Systems",
bookTitle="Verification: Theory and Practice: Essays Dedicated to
Zohar Manna on the Occasion of His 64th Birthday",
year="2003",
publisher="Springer",
address="Berlin, Heidelberg",
pages="269--289",
abstract="An open system is a system whose behavior is jointly
determined by its internal structure, and by the input it receives from
the environment. To solve control and verification problems, open
systems have often been modeled as games between the system and the
environment; we argue that the game view of open systems should be
extended also to the definitions of system refinement and composition.
We give a symmetrical interpretation to games between system and
environment: the moves of the system represent the outputs that the
system can generate (the output guarantees), and symmetrically, the
moves of the environment represent the inputs that the system can accept
(the input assumptions). We argue in favor of defining refinement of
open systems in terms of alternating simulation, which is the relation
between games that plays the same role of simulation between transition
systems. Alternating simulation captures the principle that a component
refines another if it has weaker input assumptions, and stronger output
guarantees. Furthermore, we argue in favor of a notion of composition
that accounts for the compatibility between input assumptions and output
guarantees, and that enables the synthesis of new input guarantees for
the composed system. These game-theoretical notions of refinement and
compatibility are related to the type-theoretical notions of subtyping
and type compatibility, and give rise to an expressive modeling
framework for component-based design and verification.",
isbn="978-3-540-39910-0",
doi="10.1007/978-3-540-39910-0_12",
url="https://doi.org/10.1007/978-3-540-39910-0_12"
}
@article{gtf,
title={Interfaces: A game-theoretic framework for
reasoning about component-based systems},
author={de Alfaro, Luca and Stoelinga, Mari{\"e}lle},
journal={Electron. Notes Theor. Comput. Sci.},
volume={97},
pages={3--23},
year={2004},
doi={10.1016/j.entcs.2004.04.030},
publisher={Elsevier}
}
%%}}}
@article{hyperprop,
title={Hyperproperties},
author={Clarkson, Michael R and Schneider, Fred B},
journal={Journal of Computer Security},
volume={18},
number={6},
pages={1157--1210},
year={2010},
publisher={IOS Press}
}
%}}}