-
Notifications
You must be signed in to change notification settings - Fork 0
/
cyclic_proof.published.bib
1938 lines (1796 loc) · 66.7 KB
/
cyclic_proof.published.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
@article{Mints_1978,
author = {Mints, G. E.},
doi = {10.1007/bf01091743},
issn = {0090-4104},
journal = {Journal of Soviet Mathematics},
month = {October},
number = {4},
pages = {548–596},
publisher = {Springer Science and Business Media LLC},
title = {Finite Investigations of Transfinite Derivations},
url = {https://doi.org/10.1007/BF01091743},
volume = {10},
year = {1978}
}
@InProceedings{Dam_CONCUR95,
author = {Dam, Mads},
editor = {Lee, Insup and Smolka, Scott A.},
title = {Compositional Proof Systems for Model Checking Infinite State Processes},
booktitle = {CONCUR '95: Concurrency Theory},
year = {1995},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
pages = {12–26},
doi = {10.1007/3-540-60218-6_2},
url = {https://doi.org/10.1007/3-540-60218-6_2}
}
@article{Niwinski_1996,
author = {Niwiński, Damian and Wałukiewicz, Igor},
doi = {10.1016/0304-3975(95)00136-0},
issn = {0304-3975},
journal = {Theoretical Computer Science},
month = {August},
number = {1–2},
pages = {99–116},
publisher = {Elsevier BV},
title = {Games for the μ-calculus},
url = {https://doi.org/10.1016/0304-3975(95)00136-0},
volume = {163},
year = {1996}
}
@article{Dam98,
author = {Dam, Mads},
title = {Proving Properties of Dynamic Process Networks},
journal = {Information and Computation},
volume = {140},
number = {2},
pages = {95–114},
year = {1998},
doi = {10.1006/inco.1997.2680},
url = {https://doi.org/10.1006/inco.1997.2680}
}
@InProceedings{DamFredlundGurov98,
author = {Dam, Mads and Fredlund, Lars-{\AA}ke and Gurov, Dilian},
editor = {de Roever, Willem-Paul and Langmaack, Hans and Pnueli, Amir},
title = {Toward Parametric Verification of Open Distributed Systems},
booktitle = {Compositionality: The Significant Difference (COMPOS 1997)},
series = {International Symposium on Compositionality},
year = {1998},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
pages = {150–185},
doi = {10.1007/3-540-49213-5_7},
url = {https://doi.org/10.1007/3-540-49213-5_7},
}
@inproceedings{ArtsDFG98,
author = {Arts, Thomas and Dam, Mads and Fredlund, Lars{-}{\AA}ke and Gurov, Dilian},
editor = {Claude Kirchner and H{\'{e}}l{\`{e}}ne Kirchner},
title = {System Description: Verification of Distributed Erlang Programs},
booktitle = {Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1421},
pages = {38–41},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054244},
doi = {10.1007/BFB0054244}
}
@inproceedings{ArtsD99,
author = {Arts, Thomas and Dam, Mads},
editor = {Jeannette M. Wing and Jim Woodcock and Jim Davies},
title = {Verifying a Distributed Database Lookup Manager Written in Erlang},
booktitle = {FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {I}},
series = {Lecture Notes in Computer Science},
volume = {1708},
pages = {682–700},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48119-2\_38},
doi = {10.1007/3-540-48119-2\_38}
}
@inproceedings{DamG99,
author = {Dam, Mads and Gurov, Dilian},
editor = {Dines Bj{\o}rner and Manfred Broy and Alexandre V. Zamulin},
title = {Compositional Verification of {CCS} Processes},
booktitle = {Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, PSI'99, Akademgorodok, Novosibirsk, Russia, July 6-9, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1755},
pages = {247–256},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46562-6_22},
doi = {10.1007/3-540-46562-6_22}
}
@article{Walukiewicz_2000,
author = {Wałukiewicz, Igor},
doi = {10.1006/inco.1999.2836},
issn = {0890-5401},
journal = {Information and Computation},
month = {February},
number = {1–2},
pages = {142–182},
publisher = {Elsevier BV},
title = {Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus},
url = {https://doi.org/10.1006/inco.1999.2836},
volume = {157},
year = {2000}
}
@inproceedings{Lee_2001,
author = {Lee, Chin Soon and Jones, Neil D. and Ben-Amram, Amir M.},
booktitle = {Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages (POPL'01)},
doi = {10.1145/360204.360210},
month = {January},
publisher = {ACM},
title = {The Size-Change Principle for Program Termination},
url = {https://doi.org/10.1145/360204.360210},
year = {2001},
pages = {81–92}
}
@article{Dam_2002,
author = {Dam, Mads},
doi = {10.1093/logcom/12.2.255},
issn = {1465-363X},
journal = {Journal of Logic and Computation},
month = {April},
number = {2},
pages = {255–269},
publisher = {Oxford University Press (OUP)},
title = {\mu-Calculus with Explicit Points and Approximations},
url = {https://doi.org/10.1093/logcom/12.2.255},
volume = {12},
year = {2002}
}
@inbook{Santocanale_2002,
author = {Santocanale, Luigi},
booktitle = {Foundations of Software Science and Computation Structures},
doi = {10.1007/3-540-45931-6_25},
isbn = {9783540459316},
issn = {0302-9743},
pages = {357–371},
publisher = {Springer Berlin Heidelberg},
title = {A Calculus of Circular Proofs and Its Categorical Semantics},
url = {https://doi.org/10.1007/3-540-45931-6_25},
year = {2002}
}
@inbook{Schopp_2002,
author = {Schöpp, Ulrich and Simpson, Alex},
booktitle = {Foundations of Software Science and Computation Structures},
doi = {10.1007/3-540-45931-6_26},
isbn = {9783540459316},
issn = {0302-9743},
pages = {372–386},
publisher = {Springer Berlin Heidelberg},
title = {Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes},
url = {https://doi.org/10.1007/3-540-45931-6_26},
year = {2002}
}
@inproceedings{SprengerD02,
author = {Sprenger, Christoph and Dam, Mads},
editor = {Zolt{\'{a}}n {\'{E}}sik and Anna Ing{\'{o}}lfsd{\'{o}}ttir},
title = {A Note on Global Induction in a mu-calculus with Explicit Approximations},
booktitle = {Fixed Points in Computer Science, {FICS} 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary Proceedings},
series = {{BRICS} Notes Series},
volume = {{NS-02-2}},
pages = {22–24},
publisher = {University of Aarhus},
year = {2002},
url = {https://www.brics.dk/NS/02/2/},
}
@inbook{SprengerDam_FoSSaCS2003,
author = {Sprenger, Christoph and Dam, Mads},
booktitle = {Foundations of Software Science and Computation Structures},
doi = {10.1007/3-540-36576-1_27},
isbn = {9783540365761},
issn = {1611-3349},
pages = {425–440},
publisher = {Springer Berlin Heidelberg},
title = {On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μCalculus},
url = {https://doi.org/10.1007/3-540-36576-1_27},
year = {2003}
}
@article{SprengerDam_2003,
author = {Sprenger, Christoph and Dam, Mads},
doi = {10.1051/ita:2003024},
issn = {1290-385X},
journal = {RAIRO - Theoretical Informatics and Applications},
month = {October},
number = {4},
pages = {365–391},
publisher = {EDP Sciences},
title = {On Global Induction Mechanisms in a μ-calculus with Explicit Approximations},
url = {https://doi.org/10.1051/ita:2003024},
volume = {37},
year = {2003}
}
@article{FredlundGNDAC03,
author = {Fredlund, Lars-Åke and Gurov, Dilian and Noll, Thomas and Dam, Mads and Arts, Thomas and Chugunov, Gennady},
title = {A Verification Tool for {ERLANG}},
journal = {Int. J. Softw. Tools Technol. Transf.},
volume = {4},
number = {4},
pages = {405–420},
year = {2003},
url = {https://doi.org/10.1007/s100090100071},
doi = {10.1007/S100090100071}
}
@incollection{Dam03,
author = {Mads Dam},
editor = {Ruy J. G. B. de Queiroz},
title = {Proof Systems for {\pi}-Calculus Logics},
booktitle = {Logic for Concurrency and Synchronisation},
series = {Trends in Logic},
volume = {18},
pages = {145–212},
publisher = {Kluwer},
year = {2003},
url = {https://doi.org/10.1007/0-306-48088-3_4},
doi = {10.1007/0-306-48088-3_4}
}
@article{Wirth04,
author = {Wirth, Claus{-}Peter},
title = {Descente Infinie + Deduction},
journal = {Log. J. {IGPL}},
volume = {12},
number = {1},
pages = {1–96},
year = {2004},
url = {https://doi.org/10.1093/jigpal/12.1.1},
doi = {10.1093/JIGPAL/12.1.1}
}
@inbook{Brotherston_2005,
author = {Brotherston, James},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods},
doi = {10.1007/11554554_8},
isbn = {9783540318224},
issn = {1611-3349},
pages = {78–92},
publisher = {Springer Berlin Heidelberg},
title = {Cyclic Proofs for First-Order Logic with Inductive Definitions},
url = {https://doi.org/10.1007/11554554_8},
year = {2005}
}
@inbook{Dax_2006,
author = {Dax, Christian and Hofmann, Martin and Lange, Martin},
booktitle = {Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2006)},
series = {Lecture Notes in Computer Science},
volume = {4337},
doi = {10.1007/11944836_26},
isbn = {9783540499954},
issn = {1611-3349},
pages = {273–284},
publisher = {Springer Berlin Heidelberg},
title = {A Proof System for the Linear Time μ-Calculus},
url = {https://doi.org/10.1007/11944836_26},
year = {2006}
}
@inproceedings{Brotherston_LICS2007,
author = {Brotherston, James and Simpson, Alex},
booktitle = {22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
doi = {10.1109/lics.2007.16},
publisher = {IEEE},
title = {Complete Sequent Calculi for Induction and Infinite Descent},
url = {https://doi.org/10.1109/LICS.2007.16},
year = {2007}
}
@inbook{Brotherston_SAS2007,
author = {Brotherston, James},
booktitle = {Static Analysis (SAS 2007)},
series = {Lecture Notes in Computer Science},
volume = {4634},
doi = {10.1007/978-3-540-74061-2_6},
isbn = {9783540740612},
issn = {1611-3349},
pages = {87–103},
publisher = {Springer Berlin Heidelberg},
title = {Formalised Inductive Reasoning in the Logic of Bunched Implications},
url = {https://doi.org/10.1007/978-3-540-74061-2_6},
year = {2007}
}
@article{Ben_Amram_2007,
author = {Ben-Amram, Amir M. and Lee, Chin Soon},
doi = {10.1145/1180475.1180480},
issn = {1558-4593},
journal = {ACM Transactions on Programming Languages and Systems},
month = {January},
number = {1},
pages = {1–37},
publisher = {Association for Computing Machinery (ACM)},
title = {Program Termination Analysis in Polynomial Time},
url = {https://doi.org/10.1145/1180475.1180480},
volume = {29},
year = {2007}
}
@inproceedings{Brotherston_2008,
author = {Brotherston, James and Bornat, Richard and Calcagno, Cristiano},
booktitle = {Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages (POPL'08)},
doi = {10.1145/1328438.1328453},
month = {January},
publisher = {ACM},
title = {Cyclic Proofs of Program Termination in Separation Logic},
url = {https://doi.org/10.1145/1328438.1328453},
year = {2008},
pages = {101–112}
}
@article{Studer_2008,
author = {Studer, Thomas},
doi = {10.1007/s11225-008-9133-6},
issn = {1572-8730},
journal = {Studia Logica},
month = {August},
number = {3},
pages = {343–363},
publisher = {Springer Science and Business Media LLC},
title = {On the Proof Theory of the Modal mu-Calculus},
url = {https://doi.org/10.1007/s11225-008-9133-6},
volume = {89},
year = {2008}
}
@inbook{Jungteerapanich_2009,
author = {Jungteerapanich, Natthapong},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods},
doi = {10.1007/978-3-642-02716-1_17},
isbn = {9783642027161},
issn = {1611-3349},
pages = {220–234},
publisher = {Springer Berlin Heidelberg},
title = {A Tableau System for the Modal μ-Calculus},
url = {https://doi.org/10.1007/978-3-642-02716-1_17},
year = {2009}
}
@inbook{Baelde_2009,
author = {Baelde, David},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods},
doi = {10.1007/978-3-642-02716-1_8},
isbn = {9783642027161},
issn = {1611-3349},
pages = {93–107},
publisher = {Springer Berlin Heidelberg},
title = {On the Proof Theory of Regular Fixed Points},
url = {https://doi.org/10.1007/978-3-642-02716-1_8},
year = {2009}
}
@inproceedings{Mendel_Gleason,
author = {Mendel-Gleason, Gavin and Hamilton, Geoff},
booktitle = {PAR-10: Partiality and Recursion in Interactive Theorem Provers},
series = {EPiC Series in Computing},
volume = {5},
doi = {10.29007/hxgm},
issn = {2398-7340},
publisher = {EasyChair},
title = {Cyclic Proofs and Coinductive Principles},
url = {https://doi.org/10.29007/hxgm},
year = {2010},
pages = {107–113}
}
@article{Bucheli_2010,
author = {Bucheli, Samuel and Kuznets, Roman and Studer, Thomas},
doi = {10.1016/j.entcs.2010.04.007},
issn = {1571-0661},
journal = {Electronic Notes in Theoretical Computer Science},
month = {May},
pages = {83–98},
publisher = {Elsevier BV},
title = {Two Ways to Common Knowledge},
url = {https://doi.org/10.1016/j.entcs.2010.04.007},
volume = {262},
year = {2010}
}
@article{Brotherston_2010,
author = {Brotherston, James and Simpson, Alex},
doi = {10.1093/logcom/exq052},
issn = {1465-363X},
journal = {Journal of Logic and Computation},
month = {September},
number = {6},
pages = {1177–1216},
publisher = {Oxford University Press (OUP)},
title = {Sequent Calculi for Induction and Infinite Descent},
url = {https://doi.org/10.1093/logcom/exq052},
volume = {21},
year = {2010}
}
@inbook{Brotherston_2011,
author = {Brotherston, James and Distefano, Dino and Petersen, Rasmus Lerchedahl},
booktitle = {Automated Deduction – CADE-23},
doi = {10.1007/978-3-642-22438-6_12},
isbn = {9783642224386},
issn = {1611-3349},
pages = {131–146},
publisher = {Springer Berlin Heidelberg},
title = {Automated Cyclic Entailment Proofs in Separation Logic},
url = {https://doi.org/10.1007/978-3-642-22438-6_12},
year = {2011}
}
@inbook{Brotherston_2012,
author = {Brotherston, James and Gorogiannis, Nikos and Petersen, Rasmus L.},
booktitle = {Programming Languages and Systems - 10th Asian Symposium (APLAS 2012)},
volume = {7705},
series = {Lecture Notes in Computer Science},
doi = {10.1007/978-3-642-35182-2_25},
isbn = {9783642351822},
issn = {1611-3349},
pages = {350–367},
publisher = {Springer Berlin Heidelberg},
title = {A Generic Cyclic Theorem Prover},
url = {https://doi.org/10.1007/978-3-642-35182-2_25},
year = {2012}
}
@inproceedings{Stratulat,
author = {Stratulat, Sorin},
booktitle = {Turing-100, The Alan Turing Centenary},
series = {EPiC Series in Computing},
volume = {10},
doi = {10.29007/nsx4},
issn = {2398-7340},
publisher = {EasyChair},
title = {A Unified View of Induction Reasoning for First-Order Logic},
url = {https://doi.org/10.29007/nsx4},
year = {2012},
pages = {326–352}
}
@inproceedings{FortierSantocanale2013,
author = {Fortier, Jérôme and Santocanale, Luigi},
booktitle = {Computer Science Logic 2013 (CSL 2013)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {23},
pages = {248–262},
doi = {10.4230/LIPICS.CSL.2013.248},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
title = {Cuts for Circular Proofs: Semantics and Cut-elimination},
url = {https://doi.org/10.4230/LIPIcs.CSL.2013.248},
year = {2013}
}
@article{Stirling_2013,
author = {Stirling, Colin},
doi = {10.4204/eptcs.129.2},
issn = {2075-2180},
journal = {Electronic Proceedings in Theoretical Computer Science},
month = {September},
pages = {18–29},
publisher = {Open Publishing Association},
title = {A Proof System with Names for Modal Mu-calculus},
url = {https://doi.org/10.4204/EPTCS.129.2},
volume = {129},
year = {2013},
note = {(Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday)}
}
@inproceedings{MioSimpson13,
author = {Mio, Matteo and Simpson, Alex},
editor = {Frank Pfenning},
title = {A Proof System for Compositional Verification of Probabilistic Concurrent Processes},
booktitle = {Foundations of Software Science and Computation Structures - 16th International Conference, {FOSSACS} 2013},
series = {Lecture Notes in Computer Science},
volume = {7794},
pages = {161–176},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37075-5_11},
doi = {10.1007/978-3-642-37075-5_11}
}
@article{Pierre_2014,
author = {Pierre, Hyvernat},
doi = {10.2168/lmcs-10(1:11)2014},
issn = {1860-5974},
journal = {Logical Methods in Computer Science},
month = {February},
publisher = {Centre pour la Communication Scientifique Directe (CCSD)},
title = {The Size-Change Termination Principle for Constructor Based Languages},
url = {https://doi.org/10.2168/LMCS-10(1:11)2014},
volume = {Volume 10, Issue 1},
year = {2014},
pages = {1–30}
}
@inproceedings{Stirling2014Festschrift,
author = {Colin Stirling},
title = {A Tableau Proof System with Names for Modal Mu-calculus},
booktitle = {HOWARD-60. A Festschrift on the Occasion of Howard Barringer's 60th Birthday},
editor = {Andrei Voronkov and Margarita Korovina},
series = {EPiC Series in Computing},
volume = {42},
pages = {306–318},
year = {2014},
publisher = {EasyChair},
url = {https://doi.org/10.29007/lwqm},
doi = {10.29007/lwqm}
}
@inbook{Brotherston_2014,
author = {Brotherston, James and Gorogiannis, Nikos},
booktitle = {Static Analysis (SAS 2014)},
series = {Lecture Notes in Computer Science},
volume = {8723},
doi = {10.1007/978-3-319-10936-7_5},
isbn = {9783319109367},
issn = {1611-3349},
pages = {68–84},
publisher = {Springer International Publishing},
title = {Cyclic Abduction of Inductively Defined Safety and Termination Preconditions},
url = {https://doi.org/10.1007/978-3-319-10936-7_5},
year = {2014}
}
@article{Shamkanov_2014,
author = {Shamkanov, D. S.},
doi = {10.1134/s0001434614090326},
issn = {1573-8876},
journal = {Mathematical Notes},
month = {September},
number = {3–4},
pages = {575–585},
publisher = {Pleiades Publishing Ltd},
title = {Circular Proofs for the Gödel-Löb Provability Logic},
url = {https://doi.org/10.1134/S0001434614090326},
volume = {96},
year = {2014}
}
@inbook{Blanchette_2014,
author = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
booktitle = {Automated Reasoning (IJCAR 2014)},
series = {Lecture Notes in Computer Science},
volume = {8562},
doi = {10.1007/978-3-319-08587-6_4},
isbn = {9783319085876},
issn = {1611-3349},
pages = {46–60},
publisher = {Springer International Publishing},
title = {Unified Classical Logic Completeness},
url = {https://doi.org/10.1007/978-3-319-08587-6_4},
year = {2014}
}
@inproceedings{BaeldeDS15,
author = {Baelde, David and Doumane, Amina and Saurin, Alexis},
editor = {Stephan Kreutzer},
title = {Least and Greatest Fixed Points in Ludics},
booktitle = {24th {EACSL} Annual Conference on Computer Science Logic ({CSL} 2015)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {41},
pages = {549–566},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CSL.2015.549},
doi = {10.4230/LIPICS.CSL.2015.549}
}
@inbook{Kokkinis_2016,
author = {Kokkinis, Ioannis and Studer, Thomas},
booktitle = {Concepts of Proof in Mathematics, Philosophy, and Computer Science},
doi = {10.1515/9781501502620-011},
month = {July},
pages = {171–192},
publisher = {De Gruyter},
title = {Cyclic Proofs for Linear Temporal Logic},
url = {https://doi.org/10.1515/9781501502620-011},
year = {2016}
}
@inbook{DeYoung_2016,
author = {DeYoung, Henry and Pfenning, Frank},
booktitle = {Programming Languages and Systems (APLAS 2016)},
series = {Lecture Notes in Computer Science},
volume = {10017},
doi = {10.1007/978-3-319-47958-3_1},
isbn = {9783319479583},
issn = {1611-3349},
pages = {3–22},
publisher = {Springer International Publishing},
title = {Substructural Proofs as Automata},
url = {https://doi.org/10.1007/978-3-319-47958-3_1},
year = {2016}
}
@inproceedings{BDS16,
author = {Baelde, David and Doumane, Amina and Saurin, Alexis},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {62},
pages = {42:1–42:17},
doi = {10.4230/LIPICS.CSL.2016.42},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
title = {Infinitary Proof Theory: the Multiplicative Additive Case},
url = {https://doi.org/10.4230/LIPIcs.CSL.2016.42},
year = {2016}
}
@inproceedings{Doumane_2016,
author = {Doumane, Amina and Baelde, David and Hirschi, Lucca and Saurin, Alexis},
booktitle = {Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science},
collection = {LICS '16},
doi = {10.1145/2933575.2933598},
month = {July},
publisher = {ACM},
series = {LICS '16},
title = {Towards Completeness via Proof Search in the Linear Time μ-calculus: The Case of Büchi Inclusions},
url = {https://doi.org/10.1145/2933575.2933598},
year = {2016},
pages = {377–386}
}
@inproceedings{Stratulat_2016,
author = {Stratulat, Sorin},
booktitle = {2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)},
doi = {10.1109/synasc.2016.018},
month = {September},
publisher = {IEEE},
title = {Structural vs. Cyclic Induction: A Report on Some Experiments with Coq},
url = {https://doi.org/10.1109/SYNASC.2016.018},
year = {2016}
}
@article{Shamkanov_2016,
author = {Shamkanov, Daniyar Salkarbekovich},
doi = {10.4213/sm8667},
issn = {2305-2783},
journal = {Matematicheskii Sbornik},
number = {9},
pages = {171–190},
publisher = {Steklov Mathematical Institute},
title = {A Realization Theorem for the Gödel-Löb Provability Logic},
url = {https://doi.org/10.4213/sm8667},
volume = {207},
year = {2016}
}
@article{Blanchette_2016,
author = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
doi = {10.1007/s10817-016-9391-3},
issn = {1573-0670},
journal = {Journal of Automated Reasoning},
month = {October},
number = {1},
pages = {149–179},
publisher = {Springer Science and Business Media LLC},
title = {Soundness and Completeness Proofs by Coinductive Methods},
url = {https://doi.org/10.1007/s10817-016-9391-3},
volume = {58},
year = {2016}
}
@inbook{Iemhoff16_VisserFestschrift,
author = {Iemhoff, Rosalie},
title = {Reasoning in Circles},
booktitle = {Liber Amicorum Alberti. A Tribute to Albert Visser},
editor = {van Eijck, Jan and Joosten, Joost J. and Iemhoff, Rosalie},
isbn = {978-1-84890-204-6},
pages = {165–178},
publisher = {College Publications},
year = {2016},
url = {https://arxiv.org/abs/2112.15028}
}
@inbook{Rowe_2017,
author = {Rowe, Reuben N. S. and Brotherston, James},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods},
doi = {10.1007/978-3-319-66902-1_18},
isbn = {9783319669021},
issn = {1611-3349},
pages = {295–310},
publisher = {Springer International Publishing},
title = {Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent},
url = {https://doi.org/10.1007/978-3-319-66902-1_18},
year = {2017}
}
@inbook{Das_2017,
author = {Das, Anupam and Pous, Damien},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods},
doi = {10.1007/978-3-319-66902-1_16},
isbn = {9783319669021},
issn = {1611-3349},
pages = {261–277},
publisher = {Springer International Publishing},
title = {A Cut-Free Cyclic Proof System for Kleene Algebra},
url = {https://doi.org/10.1007/978-3-319-66902-1_16},
year = {2017}
}
@inbook{Stratulat_2017,
author = {Stratulat, Sorin},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods},
doi = {10.1007/978-3-319-66902-1_19},
isbn = {9783319669021},
issn = {1611-3349},
pages = {311–327},
publisher = {Springer International Publishing},
title = {Cyclic Proofs with Ordering Constraints},
url = {https://doi.org/10.1007/978-3-319-66902-1_19},
year = {2017}
}
@inproceedings{Rowe_2017,
author = {Rowe, Reuben N. S. and Brotherston, James},
booktitle = {Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs},
collection = {CPP '17},
doi = {10.1145/3018610.3018623},
month = {January},
publisher = {ACM},
series = {CPP '17},
title = {Automatic Cyclic Termination Proofs for Recursive Procedures in Separation Logic},
url = {https://doi.org/10.1145/3018610.3018623},
year = {2017},
pages = {53–65}
}
@inproceedings{Afshari_2017,
author = {Afshari, Bahareh and Leigh, Graham E.},
booktitle = {2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
doi = {10.1109/lics.2017.8005088},
month = {June},
publisher = {IEEE},
title = {Cut-free Completeness for Modal Mu-calculus},
url = {https://doi.org/10.1109/LICS.2017.8005088},
year = {2017}
}
@inproceedings{Doumane_2017,
author = {Doumane, Amina},
booktitle = {32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
doi = {10.1109/lics.2017.8005075},
month = {June},
publisher = {IEEE},
title = {Constructive Completeness for the Linear-time μ-calculus},
url = {https://doi.org/10.1109/LICS.2017.8005075},
year = {2017}
}
@inproceedings{Berardi_2017,
author = {Berardi, Stefano and Tatsuta, Makoto},
booktitle = {32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
doi = {10.1109/lics.2017.8005114},
month = {June},
publisher = {IEEE},
title = {Equivalence of Inductive Definitions and Cyclic Proofs Under Arithmetic},
url = {https://doi.org/10.1109/LICS.2017.8005114},
year = {2017}
}
@inbook{Simpson_2017,
author = {Simpson, Alex},
booktitle = {Foundations of Software Science and Computation Structures},
doi = {10.1007/978-3-662-54458-7_17},
isbn = {9783662544587},
issn = {1611-3349},
pages = {283–300},
publisher = {Springer Berlin Heidelberg},
title = {Cyclic Arithmetic Is Equivalent to Peano Arithmetic},
url = {https://doi.org/10.1007/978-3-662-54458-7_17},
year = {2017}
}
@inbook{Savateev_2017,
author = {Savateev, Yury and Shamkanov, Daniyar},
booktitle = {Logic, Language, Information, and Computation (WoLLIC 2017)},
series = {Lecture Notes in Computer Science},
volume = {10388},
doi = {10.1007/978-3-662-55386-2_23},
isbn = {9783662553862},
issn = {1611-3349},
pages = {321–335},
publisher = {Springer Berlin Heidelberg},
title = {Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs},
url = {https://doi.org/10.1007/978-3-662-55386-2_23},
year = {2017}
}
@inbook{Tellez_2017,
author = {Tellez, Gadi and Brotherston, James},
booktitle = {Automated Deduction – CADE 26},
series = {Lecture Notes in Computer Science},
volume = {10395},
doi = {10.1007/978-3-319-63046-5_30},
isbn = {9783319630465},
issn = {1611-3349},
pages = {491–508},
publisher = {Springer International Publishing},
title = {Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof},
url = {https://doi.org/10.1007/978-3-319-63046-5_30},
year = {2017}
}
@inbook{Berardi_2017,
author = {Berardi, Stefano and Tatsuta, Makoto},
booktitle = {Foundations of Software Science and Computation Structures},
doi = {10.1007/978-3-662-54458-7_18},
isbn = {9783662544587},
issn = {1611-3349},
pages = {301–317},
publisher = {Springer Berlin Heidelberg},
title = {Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System},
url = {https://doi.org/10.1007/978-3-662-54458-7_18},
year = {2017}
}
@inproceedings{Shamkanov17,
author = {Shamkanov, Daniyar S.},
editor = {Juliette Kennedy and Ruy J. G. B. de Queiroz},
title = {Global Neighbourhood Completeness of the Gödel-Löb Provability Logic},
booktitle = {Logic, Language, Information, and Computation - 24th International Workshop, WoLLIC 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10388},
pages = {358–370},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55386-2\_26},
doi = {10.1007/978-3-662-55386-2\_26}
}
@inproceedings{CohenRowe2018,
author = {Cohen, Liron and Rowe, Reuben N. S.},
booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {119},
pages = {17:1–17:16},
doi = {10.4230/LIPICS.CSL.2018.17},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
title = {Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent},
url = {https://doi.org/10.4230/LIPIcs.CSL.2018.17},
year = {2018}
}
@inproceedings{DasPous2018,
author = {Das, Anupam and Pous, Damien},
booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {119},
pages = {19:1–19:18},
doi = {10.4230/LIPICS.CSL.2018.19},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
title = {Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)},
url = {https://doi.org/10.4230/LIPIcs.CSL.2018.19},
year = {2018}
}
@inproceedings{Nollet2018,
author = {Nollet, Rémi and Saurin, Alexis and Tasson, Christine},
booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)},
doi = {10.4230/LIPICS.CSL.2018.35},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {119},
pages = {35:1–35:23},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
title = {Local Validity for Circular Proofs in Linear Logic with Fixed Points},
url = {https://doi.org/10.4230/LIPIcs.CSL.2018.35},
year = {2018}
}
@inproceedings{DasDoumanePous18,
author = {Das, Anupam and Doumane, Amina and Pous, Damien},
booktitle = {22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-22)},
series = {EPiC Series in Computing},
volume = {57},
pages = {271–289},
doi = {10.29007/hzq3},
issn = {2398-7340},
publisher = {EasyChair},
title = {Left-Handed Completeness for Kleene algebra, via Cyclic Proofs},
url = {https://doi.org/10.29007/hzq3},
year = {2018}
}
@inproceedings{IosifSerban18,
author = {Iosif, Radu and Serban, Cristina},
booktitle = {22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-22)},
series = {EPiC Series in Computing},
volume = {57},
pages = {435–453},
doi = {10.29007/xgc6},
issn = {2398-7340},
publisher = {EasyChair},
title = {A Complete Cyclic Proof System for Inductive Entailments in First Order Logic},
url = {https://doi.org/10.29007/xgc6},
year = {2018}
}
@article{Enqvist_2018,
author = {Enqvist, Sebastian and Seifan, Fatemeh and Venema, Yde},
doi = {10.1016/j.tcs.2018.03.001},
issn = {0304-3975},
journal = {Theoretical Computer Science},
month = {May},
pages = {37–100},
publisher = {Elsevier BV},
title = {Completeness for the Modal μ-calculus: Separating the Combinatorics from the Dynamics},
url = {https://doi.org/10.1016/j.tcs.2018.03.001},
volume = {727},
year = {2018}
}
@inbook{Dardha_2018,
author = {Dardha, Ornela and Gay, Simon J.},
booktitle = {Foundations of Software Science and Computation Structures},
doi = {10.1007/978-3-319-89366-2_5},
isbn = {9783319893662},
issn = {1611-3349},
pages = {91–109},
publisher = {Springer International Publishing},
title = {A New Linear Logic for Deadlock-Free Session-Typed Processes},
url = {https://doi.org/10.1007/978-3-319-89366-2_5},
year = {2018}
}
@article{Stratulat_2018,
author = {Stratulat, Sorin},
doi = {10.4204/eptcs.281.4},
issn = {2075-2180},
journal = {Electronic Proceedings in Theoretical Computer Science},
month = {October},
pages = {39–53},
publisher = {Open Publishing Association},
title = {Validating Back-links of {FOLID} Cyclic Pre-proofs},
url = {https://doi.org/10.4204/EPTCS.281.4},
volume = {281},
year = {2018},
note = {Proceedings Seventh International Workshop on Classical Logic and Computation, CL&C 2018}
}
@article{Heath_2018,
author = {Heath, Quentin and Miller, Dale},
doi = {10.1007/s10817-018-9475-3},
issn = {1573-0670},
journal = {Journal of Automated Reasoning},
month = {June},
number = {4},
pages = {857–885},
publisher = {Springer Science and Business Media LLC},
title = {A Proof Theory for Model Checking},
url = {https://doi.org/10.1007/s10817-018-9475-3},
volume = {63},
year = {2018}
}
@article{SerbanIosif_2019,
author = {Serban, Cristina and Iosif, Radu},
doi = {10.14279/TUJ.ECEASST.76.1073},
journal = {Electronic Communications of the EASST},
language = {en},
volume = {76: Automated Verification of Critical Systems 2018 (AVoCS 2018)},
publisher = {European Association of Software Science and Technology},
title = {An Entailment Checker for Separation Logic with Inductive Definitions},
url = {https://doi.org/10.14279/TUJ.ECEASST.76.1073},
year = {2019}
}
@inbook{Tatsuta_2019,
author = {Tatsuta, Makoto and Nakazawa, Koji and Kimura, Daisuke},
booktitle = {Programming Languages and Systems (APLAS 2019)},
series = {Lecture Notes in Computer Science},
volume = {11893},
doi = {10.1007/978-3-030-34175-6_19},
isbn = {9783030341756},
issn = {1611-3349},
pages = {367–387},