-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaarnewsletter.html
More file actions
2490 lines (2208 loc) · 122 KB
/
aarnewsletter.html
File metadata and controls
2490 lines (2208 loc) · 122 KB
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
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<meta name="viewport" content="initial-scale=1.0, width=device-width" />
<title>AAR Newsletter #150: May 2026</title>
<style type="text/css">
body {
margin-left: 2em;
margin-right: 2em;
margin-top: 3.5em;
margin-bottom: 3em;
}
h1 {
text-align: center;
}
h2 {
margin-top: 1.75em;
margin-bottom: 0.83em;
}
h3 {
margin-top: 1.75em;
margin-bottom: 1em;
}
h4 {
margin-top: 1em;
margin-bottom: 0.8em;
}
h2+h3 {
margin-top: 1.5em;
}
p {
margin-top: 0em;
margin-bottom: 0.8em;
}
.initial {
font-size: 140%;
}
.details {
color: #556677;
margin-top: -1.1em;
margin-bottom: 1em;
font-weight: bold;
font-size: 0.95em;
text-align: left;
}
.issue {
font-size: 140%;
text-align: center;
margin-bottom: 2.5em;
}
.center table {
margin-left: auto;
margin-right: auto;
text-align: left;
}
.center {
text-align: center;
}
.columnauthor {
color: #556677;
margin-left: 3em;
margin-top: -0.25em;
margin-bottom: 1.15em;
font-weight: bold;
}
dl.bibliography {
font-size: small;
}
a:link {
color: #4866FF;
text-decoration: none
}
a:visited {
color: #4866FF;
text-decoration: none
}
a:active {
color: #88A6FF;
text-decoration: none
}
ul {
list-style-type: square;
}
ul.toc {
padding-left: 0em;
list-style-type: none;
line-height: 180%;
}
ul.toc ul {
padding-left: 3em;
line-height: 135%;
font-size: 95%;
}
body {
font-family: Optima, Geneva, Myriad, Trebuchet, "Helvetica Neue", Helvetica, Arial, Swiss, SunSans-Regular, sans-serif;
color: #002164;
background-color: white;
}
@media all and (max-width:32em) {
html {
font-size: .9em;
}
}
@media all and (max-width:30em) {
html {
font-size: .8em;
}
}
@media all and (max-width:27em) {
html {
font-size: .75em;
}
}
@media all and (max-width:25em) {
html {
font-size: .65em;
}
}
#container {
max-width: 52em;
margin: 0px auto;
list-style-position: outside;
text-align: left;
}
</style>
</head>
<body>
<h1><a href="http://www.aarinc.org/">
<span class="initial">A</span>ssociation for
<span class="initial">A</span>utomated
<span class="initial">R</span>easoning
</a></h1>
<div id="container">
<div class="issue">
Newsletter No. 150<br />May 2026
</div>
<div id="toc">
<ul class="toc">
<li><a href="#Dowek">In Memoriam: Deepak Kapur</a></li>
<li><a href="#herbrand">Announcement of the 2026 Herbrand Award</a></li>
<li><a href="#mccune">Announcement of the 2026 McCune Award</a></li>
<li><a href="#newsecretary">New AAR and CADE Secretary</a></li>
<li><a href="#election">Call for Nominations: CADE Trustees Elections</a></li>
<li><a href="#ijcar2028">Proposals Solicited for Sites for IJCAR 2028</a></li>
<li><a href="#floc-overview-title">FLoC 2026: Programme & Registration</a></li>
<li><a href="#newsecretary">Book Announcement: Concise Introduction to Alternating-Time Temporal Logics</a></li>
<li><a href="#awards-title">Awards</a>
<ul>
<li><a href="#ackermann">Ackermann Award 2026</a></li>
<li><a href="#milestone">Milestone Prize for Foundational Work in Formal Verification</a></li>
</ul>
</li>
<li><a href="#events-title">Events</a>
<ul>
<li><a href="#fmpsi26"> FMPSI'26 & PAT 2026: Formal Mathematics, Proof Systems Interoperability and Proof Assistants for Teaching, call for participation </a></li>
<li><a href="#aiml2026">AiML 2026: 16th International Conference on Advances in Modal Logic</a></li>
<li><a href="#avm26">AVM'26: Alpine Verification Meeting 2026</a></li>
</ul>
</li>
<li><a href="#conferences-title">Conferences</a>
<ul>
<li><a href="#icfem2026">ICFEM 2026: 27th International Conference on Formal Engineering Methods</a></li>
<li><a href="#lpar2026">LPAR 2026: The 26th Conference on Logic for Programming, Artificial Intelligence and Reasoning</a></li>
<li><a href="#FROM2026">FROM 2026: 10th Working Formal Methods Symposium</a></li>
<li><a href="#ictac2026">ICTAC 2026: 23rd International Colloquium on Theoretical Aspects of Computing</a></li>
<li><a href="#ictcs2026">ICTCS 2026: 27th Italian Conference on Theoretical Computer Science</a></li>
<li><a href="#sefm2026">SEFM 2026: 24th International Conference on Software Engineering and Formal Methods</a></li>
<li><a href="#gandalF2026">GandALF 2026: 17th International Symposium on Games, Automata, Logics, and Formal Verification</a></li>
<li><a href="#rp26">RP'26: 20th International Conference on Reachability Problems</a></li>
<li><a href="#cl2026">Colloquium Logicum 2026</a></li>
<li><a href="#csl2027">CSL 2027: 35th Annual Conference on Computer Science Logic</a></li>
<li><a href="#VSTTE2026">VSTTE 2026: 18th International Conference on Verified Software: Theories, Tools, and Experiments</a></li>
<li><a href="#til26">Trends in Logic XXVI: Non-Classical Logics, Non-Classical Mathematics</a></li>
<li><a href="#ETAPS2027">ETAPS 2027: 30th International Joint Conferences on Theory and Practice of Software</a></li>
</ul>
</li>
<li><a href="#workshops-title">Workshops</a>
<ul>
<li><a href="#feschi2027">FeSchi 2027: Festschrift and Fest for David Basin</a></li>
<li><a href="#dt2026">Deduktionstreffen 2026</a></li>
<li><a href="#proofmining2026">Second Workshop on Proof Mining</a></li>
<li><a href="#fmas2026">FMAS 2026: 8th Workshop on Formal Methods for Autonomous Systems</a></li>
</ul>
</li>
<li><a href="#schools-title">Seasonal Schools</a>
<ul>
<li><a href="#sat-smt-ar-2026">SAT/SMT/AR 2026: SAT/SMT/AR Summer School</a></li>
<li><a href="#proofcomputation2026">Autumn School "Proof and Computation" 2026</a></li>
<li><a href="#fopss2026">FoPSS 2026: 6th Summer School on Foundations of Programming and Software Systems</a></li>
<li><a href="#isr2026">ISR 2026: 15th International School on Rewriting</a></li>
<li><a href="#movep26">MOVEP'26: 17th International School on Modeling and Verification of Parallel Processes</a></li>
<li><a href="#plss2026">PLS 2026: Summer School on Programming Languages, Logic, and Software Security</a></li>
<li><a href="#splv2026">SPLV 2026: Scottish Programming Languages and Verification Summer School</a></li>
<li><a href="#vtsa2026">VTSA 2026: 18th Summer School on Verification Technology, Systems and Applications</a></li>
</ul>
</li>
<li><a href="#journal-title">Journal Special Issues</a>
<ul>
<li><a href="#jlc-wil"> Journal of Logic and Computation – Special Issue: 10 Years of the Women in Logic Workshop </a></li>
</ul>
</li>
<li><a href="#competitions-title">Competitions</a>
<ul>
<li><a href="#termcomp2026">TermComp 2026: Termination and Complexity Competition</a></li>
<li><a href="#proover2026">ProoVer-2026: First Proof Verifier Competition</a></li>
<li><a href="#cascj13">CASC-J13: The CADE ATP System Competition</a></li>
</ul>
</li>
<li><a href="#open-positions-title">Open Positions</a>
<ul>
<li><a href="#job-ruc-assprof">Assistant Professor of Computer Science, Roskilde University, Denmark</a></li>
<li><a href="#salzburg-calm">PhD Position, University of Salzburg, Austria</a></li>
<li><a href="#job-lig-postdoc">Postdoctoral Position in Interactive Theorem Proving and Blockchain Technologies, LIG, Grenoble, France</a></li>
<li><a href="#job-rennes-phd">PhD Position in Formal Verification of Distributed Systems using Reinforcement Learning, Mitsubishi Electric R&D Centre Europe & Inria Rennes, France</a></li>
<li><a href="#job-aws-cambridge-intern-title">Internship in Formal Verification of Systems Software, AWS, Cambridge, UK</a></li>
<li><a href="#job-nectry-title">Senior Software Engineer, Nectry, Remote</a></li>
<li><a href="#job-mpi-aol-title">Postdoctoral Positions in Automated Reasoning, Max Planck Institute for Informatics, Saarbrücken, Germany</a>
</li>
</ul>
</li>
</ul>
</div>
<div id="memoriam-kapur">
<h2 id="Dowek">In Memoriam: Deepak Kapur</h2>
<div class="details"><a href="https://verify.rwth-aachen.de/giesl/">Jürgen Giesl</a></div>
<p>Deepak Kapur passed away on April 11, 2026 in Albuquerque, New Mexico, aged 75. He was one
of the pioneers of automated reasoning, with
outstanding contributions in numerous areas, including inductive theorem
proving, geometry theorem proving, term rewriting, unification theory, integration and
combination of decision procedures, lemma and loop invariant generation, as well as his
work to bridge the gap between computer algebra and automated deduction.</p>
<p>After graduating from the Indian Institute of Technology (IIT) in Kanpur, Deepak earned his
Ph.D. in 1980 at MIT under the supervision of Barbara Liskov. From 1980 to 1987 he worked at
General Electric's Research Laboratory in Schenectady, New York,
while also serving as an adjunct professor at Rensselaer Polytechnic Institute. He was
appointed full professor at the University at Albany, State University of New York
in 1988. In 1998, Deepak moved to the University of New Mexico (UNM) in Albuquerque, where he was
Chair of the Computer Science Department until 2006 and was awarded Distinguished
Professor in 2007.</p>
<p>In automated deduction, Deepak introduced one of the most influential approaches for
automated program verification by induction, the "proof by consistency"
method. This approach had an enormous impact on the further development of the
field. His research covered both deep theoretical contributions and
practical aspects concerning the application of his results. His
induction theorem prover "Rewrite Rule Laboratory (RRL)" was very influential and was
successfully used for numerous applications, in particular
in hardware verification. Deepak's work on the foundations of
RRL forms the basis of many modern theorem provers, since RRL was one
of the first tools that successfully combined theorem proving and
decision procedures.</p>
<p>Another topic of Deepak's work was termination
analysis, in particular for systems where certain functions have
additional properties like associativity and commutativity. His
results on techniques for termination proofs of such systems had a wide
influence and remain among the most powerful ones today.</p>
<p>Moreover, Deepak made fundamental contributions to several
other topics in automated deduction, such as methods for unification,
for proving sufficient completeness, etc.</p>
<p>In the area of computer algebra, Deepak developed very substantial
contributions on algebraic and geometric reasoning. Here, his focus was on developing
methods for solving geometric problems and for determining
geometric quantities. Moreover, Deepak found a fascinating way to combine
results from both computer algebra and automated deduction by using methods
from algebraic geometry to generate loop invariants automatically.</p>
<p>His position as one of the leaders of automated deduction
is demonstrated by the fact that he was the editor-in-chief of the
Journal of Automated Reasoning from 1993 to 2007, he served as CADE program chair in 1992,
and he received the Herbrand Award in 2009 in recognition of his seminal contributions to
automated reasoning.</p>
<p>Deepak was also a very devoted teacher and mentor for both students and younger
researchers. I was fortunate to spend a year working with him as a visiting
researcher at UNM in 1999/2000. His advice, suggestions,
and friendship have guided me ever since.</p>
<p>Deepak is survived by his wife Roli Varma and their daughter Ila.</p>
<p>We plan to hold a memorial session at IJCAR during FLoC in Lisbon, July 2026, where
everybody is welcome to share memories of Deepak. If you would like to
speak a few words during this session, please contact
<a href="mailto:giesl@informatik.rwth-aachen.de">Jürgen Giesl</a> by June 26, 2026.
</p>
</div>
<div id="awards-herbrand">
<h2 id="herbrand">Announcement of the 2026 Herbrand Award</h2>
<div class="details"><em><a href="https://verify.rwth-aachen.de/giesl/">Jürgen Giesl</a></em><br />
President of CADE Inc.<br />
On behalf of the 2026 Herbrand Award Committee
</div>
<p>
The International Conference on Automated Deduction (CADE) Herbrand Award for Distinguished Contributions to
Automated Reasoning is presented to</p>
<center>
<b>
Frank Pfenning
</b>
</center>
<br />
<p>for contributions to the foundations of type theory and logical frameworks, and the development of theory, automated tools, and applications for classical and non-classical logics.</p>
<p>
Presented at IJCAR 2026, the 13th International Joint Conference on Automated Reasoning.
</p>
The 2026 Herbrand Award Committee consisted of Nikolaj Bjørner (Chair), Amy Felty, Cynthia Kop, Cláudia Nalon, Andrew Reynolds, and Geoff Sutcliffe.
</p>
</div>
<div id="awards-mccune">
<h2 id="mccune">Announcement of the 2026 McCune Award</h2>
<div class="details"><em><a href="https://verify.rwth-aachen.de/giesl/">Jürgen Giesl</a></em><br />
President of CADE Inc.<br />
On behalf of the 2026 Bill McCune PhD Award Committee
</div>
<p>
The International Conference on Automated Deduction (CADE) Bill McCune PhD Award in Automated Reasoning is presented to</p>
<center>
<b>
Jasper Nalbach
</b>
</center>
<br />
<p>for his dissertation “Cylindrical Algebraic Decomposition Based Methods in Satisfiability Modulo Non-linear Real Arithmetic” supervised by Prof. Dr. Erika Ábrahám and Prof. Dr. James Davenport. The thesis was selected for its strong theoretical contributions to SMT solving for non-linear real arithmetic. The thesis provides a uniform presentation of available algorithms based on the cylindrical algebraic decomposition (CAD) method for satisfiability checking and quantifier elimination; the CAD projection is formalized as a proof system, which allows the design of fine-grained optimizations. These theoretical results are not only important for the understanding, improvement, and applicability of exploration-guided CAD-based algorithms, but also proved to have impact on the development of practically relevant software.
</p>
<p>
Presented at IJCAR 2026, the 13th International Joint Conference on Automated Reasoning.
</p>
The 2026 Bill McCune PhD Award Committee consisted of Viorica Sofronie-Stokkermans (chair), Pascal Fontaine, Carsten Fuhs, Ullrich Hustadt, Mikoláš Janota, Cezary Kaliszyk, Philipp Rümmer, and Sophie Tourret.
</p>
<br />
<p>An honorary mention is given to</p>
<center>
<b>
Joseph Reeves
</b>
</center>
<br />
<p>for his dissertation “Cardinality Constraints in Boolean Satisfiability Solving” supervised by Prof. Marijn Heule and Prof. Randal Bryant. The thesis was selected for its impact on the theory and practice of SAT solving. The thesis introduces KNF (AtLeastK Conjunctive Normal Form), an extension of conjunctive normal form with native cardinality constraint support, and develops native cardinality propagation and an efficient form of cardinality-guided formula splitting for parallel solving. The thesis makes a convincing case for enriching the input of SAT solvers with cardinality constraints by demonstrating the substantial performance improvements that can be achieved through cardinality-aware reasoning, even without using cutting planes.</p>
<p>
Presented at IJCAR 2026, the 13th International Joint Conference on Automated Reasoning.
</p>
The 2026 Bill McCune PhD Award Committee consisted of Viorica Sofronie-Stokkermans (chair), Pascal Fontaine, Carsten Fuhs, Ullrich Hustadt, Mikoláš Janota, Cezary Kaliszyk, Philipp Rümmer, and Sophie Tourret.
</p>
</div>
<div id="cade-secretary">
<h2 id="newsecretary">New AAR and CADE Secretary</h2>
<div class="details"><em><a href="https://verify.rwth-aachen.de/giesl/">Jürgen Giesl</a></em><br />
President of CADE Inc.<br />
<em><a href="https://www.mpi-inf.mpg.de/departments/automation-of-logic/people/christoph-weidenbach/">Christoph Weidenbach</a></em><br />
President of AAR
</div>
<p>
After eight years of excellent service, Philipp Rümmer has resigned from the posts of CADE and AAR secretary. The CADE Board of Trustees and the AAR Board want to thank him for his outstanding service to the community!
</p>
<p>
Our new CADE and AAR secretary is Sophie Tourret. We welcome Sophie in her new role and look forward to working with her.
</p>
</div>
<div id="election_id">
<h2 id="election">Call for Nominations: CADE Trustees Elections</h2>
<div class="details"><em><a href="https://members.loria.fr/STourret/">Sophie Tourret</a></em><br>
Secretary of AAR and CADE</div>
<p>
The affairs of CADE are managed by its Board of
Trustees. This includes the selection of CADE (IJCAR)
co-chairs, the selection of CADE venues, choosing
the Herbrand, Bill McCune, and Skolem Award selection committee,
instituting new awards, etc.
</p>
<p>
Nominations for <b>four CADE trustee positions</b> are being
sought, in preparation for the elections to be held
after IJCAR 2026.
</p>
<p>
<b>The current members of the board of trustees are (in alphabetical order):
</b>
</p>
<ul>
<li>
<a href="https://cca.informatik.uni-freiburg.de/biere/">Armin
Biere</a> (IJCAR 2026 program co-chair)
</li>
<li>
<a href="https://www.tcs.ifi.lmu.de/mitarbeiter/jasmin-blanchette_de.html">Jasmin Blanchette</a> (elected
2023)
</li>
<li>
<a href="https://www.dcs.bbk.ac.uk/~carsten/">Carsten Fuhs</a> (elected 2023)
</li>
<li>
<a href="http://verify.rwth-aachen.de/giesl/">Jürgen Giesl</a> (president, reelected 2025)
</li>
<li>
<a href="https://www.cs.cmu.edu/~mheule/">Marijn Heule</a> (elected 2024)
</li>
<li>
Neil Murray (treasurer since 1992)
</li>
<li>
<a href="https://cic.unb.br/~nalon/">Cláudia Nalon</a> (elected 2025)
</li>
<li>
<a href="http://www.cs.man.ac.uk/~schmidt/">Renate Schmidt</a> (vice president, reelected 2023)
</li>
<li>
<a href="https://people.ciirc.cvut.cz/~sudamar2/">Martin Suda</a> (elected 2024)
</li>
<li>
<a href="https://members.loria.fr/STourret/">Sophie Tourret</a> (secretary, reelected 2025)
</li>
<li>
<a href="https://www.mpi-inf.mpg.de/departments/automation-of-logic/people/uwe-waldmann">Uwe
Waldmann</a> (elected 2025)
</li>
</ul>
<p></p>
<p>
The terms of Jasmin Blanchette, Carsten Fuhs, and Renate Schmidt end.
Jasmin Blanchette and Carsten Fuhs may be nominated
for a second term, whereas Renate Schmidt
has already served two
consecutive terms and cannot be nominated this year.
</p>
<p>
The term of office of Armin Biere as IJCAR 2026
programme chair ends after the IJCAR conference. As outgoing
ex-officio trustee, Armin Biere is eligible to be
nominated as elected trustee.
</p>
<p>
Sophie Tourret has become CADE secretary.
Her position as an elected trustee is thus also open.
</p>
<p>
<b> In summary, we are seeking to elect four trustees.
</b>
</p>
<p>
Nominations can be made by any CADE member, either by
e-mail or at the business meeting at
IJCAR 2026; since nominators must be CADE members,
they must have participated in at least one of the CADE or IJCAR
conferences in the years 2023-2026.
Two members, a principal nominator
and a second, are required to make a nomination, and it
is their responsibility to ask people's permission
before nominating them. A member may nominate or second
only one candidate. For
further details please see the
<a href="http://www.cadeinc.org//bylaws">CADE Inc. bylaws</a> at the
CADE web site.
</p>
<p>
E-mail nominations can be provided up to the upcoming
IJCAR business meeting, via email to
</p>
<blockquote>
<address>
<a href="mailto:president@cadeinc.org">Jürgen Giesl</a>, President of CADE Inc.
</address>
</blockquote>
with copies to
<blockquote>
<address>
<a href="mailto:secretary@cadeinc.org">Sophie Tourret</a>, Secretary of CADE Inc.
</address>
</blockquote>
<p></p>
</div>
<div id="ijcar2028_id">
<h2 id="ijcar2028">Proposals Solicited for Sites for IJCAR 2028</h2>
<div class="details">
<em><a href="https://verify.rwth-aachen.de/giesl/">Jürgen Giesl</a></em><br />
IJCAR Steering Committee Chair
</div>
<p>
We invite proposals for sites to host the 14th International Joint Conference on Automated Reasoning (IJCAR) to be
held in the summer 2028. Previous IJCAR meetings include IJCAR 2001 in Siena, Italy; IJCAR 2004 in Cork, Ireland; IJCAR 2006 as part of
FLoC in Seattle, Washington; IJCAR 2008 in Sydney, Australia; IJCAR 2010 as part of FLoC in Edinburgh, Scotland; IJCAR 2012 in
Manchester, UK; IJCAR 2014 as part of FLoC and the Vienna Summer of Logic in Vienna, Austria; IJCAR 2016 in Coimbra, Portugal; IJCAR 2018
as part of FLoC in Oxford, UK; IJCAR 2020 in Paris, France, as online event;
IJCAR 2022 as part of FLoC in Haifa, Israel; IJCAR 2024 in Nancy, France; and IJCAR 2026 as part of FLoC in Lisbon, Portugal.
</p>
<p>
IJCAR is a merger of CADE (Conference on Automated Deduction), TABLEAUX (Conference on Analytic Tableaux and Related Methods),
and FroCoS (Symposium on Frontiers of Combining Systems) and possibly other meetings. Usually, a considerable number of workshops are also affiliated with the conference.
</p>
<p>
The deadline for proposals is <b>July 6</b>, 2026. Proposals should be sent to the <a href="mailto:giesl@informatik.rwth-aachen.de">IJCAR Steering Committee Chair</a>. We encourage proposers to register their intention informally as soon as possible.
</p>
<p>
Proposals should address the following points that also represent criteria for evaluation:
<ul>
<li>National, regional, and local AR community support: IJCAR Conference Chair and host institution, IJCAR Local Arrangements Committee, availability of (and reward for) student-volunteers.</li>
<li>National, regional, and local government and industry support, both organizational and financial.</li>
<li>Accessibility (i.e., transportation), attractiveness, and desirability of proposed site.</li>
<li>Appropriateness of proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities (a.k.a. residence halls).</li>
<li>An estimate on registration cost for the conference and workshops, both for regular participants and students.</li>
<li>Conference and exhibit facilities for the anticipated number of registrants (typically up to 200), for example, number, capacity and audiovisual equipment of meeting rooms; a large plenary session room that can hold all the registrants; enough rooms for parallel sessions/workshops/tutorials; Internet connectivity and workstations for demos/competitions; catering services; and presence of professional staff.</li>
<li>Residence accommodation and food services in a range of price categories and close to the conference facilities, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer.</li>
<li>Rough budget projections for the various budget categories, e.g., cost of renting/cleaning the meeting rooms, if applicable; cost of professional conference secretariat, if hired; and financial model for satellite workshops and/or co-located events.</li>
<!-- <li>Balance with regard to the geographical distribution of previous IJCAR and its constituent meetings.</li>
<li>For the unlikely case that travel or contact restrictions are still in
place: willingness and ability to organize an online or hybrid event.</li> -->
<li>Prospective organizers are encouraged to get in touch with the IJCAR
Steering Committee Chair as soon as possible for informal discussion. If the host institution is not actually located at the proposed site, then one or more visits to the site by the proposers is encouraged.</li>
</ul>
</p>
<p>Information about the previous IJCAR conferences (including organizers, number of accepted papers, number of registrations) can be found at <a href="https://ijcar.org//conferences">https://ijcar.org//conferences</a>.
</p>
<p>
Please also take into account the Conference management notes at <a href="https://cadeinc.org//Schedule">https://cadeinc.org//Schedule</a> and the financial summaries of previous conferences at <a href="https://cadeinc.org//FinancialSummaries">https://cadeinc.org//FinancialSummaries</a>.
</p>
</div>
<div id="floc-overiew">
<h2 id="floc-overview-title">
<a href="https://www.floc26.org">FLoC 2026: Programme & Registration</a>
</h2>
<div class="details">July 13–29, 2026, Lisbon, Portugal</div>
<p>
The Federated Logic Conference (FLoC) 2026 brings together major conferences,
workshops, and summer schools in logic and computer science.
</p>
<h4>Registration deadlines</h4>
<table style="border-collapse: collapse; margin-bottom: 1em; width: 100%;">
<thead>
<tr>
<th style="text-align:left; width: 30%;">Category</th>
<th style="text-align:left; width: 35%;">Early</th>
<th style="text-align:left; width: 35%;">Late</th>
</tr>
</thead>
<tbody>
<tr>
<td>Conferences</td>
<td>May 15</td>
<td>July 13</td>
</tr>
<tr>
<td>Workshops</td>
<td>June 1</td>
<td>July 13</td>
</tr>
<tr>
<td>Summer School</td>
<td>June 1</td>
<td>July 6</td>
</tr>
</tbody>
</table>
<h4>Programme overview</h4>
<table style="border-collapse: collapse; width: 100%;">
<thead>
<tr>
<th style="text-align:left; width: 20%;">Dates</th>
<th style="text-align:left; width: 25%;">Category</th>
<th style="text-align:left; width: 55%;">Events</th>
</tr>
</thead>
<tbody>
<tr>
<td>July 13–17</td>
<td>Summer Schools</td>
<td>
FoPSS, SAT/SMT/AR Summer School
</td>
</tr>
<tr>
<td>July 17–19</td>
<td>3-Day Workshops</td>
<td>
DL, NMR
</td>
</tr>
<tr>
<td>July 18–19</td>
<td>Workshops</td>
<td>
MW1, LSFA, ML4SP, FMQC, OVERLAY, TGD, TLLA, PoS, RocqWS, TERMGRAPH, ThEdu, WHOOPS, WPTE, ...
</td>
</tr>
<tr>
<td>July 20–23</td>
<td>Week 1 Conferences</td>
<td>
CP, FSCD, ICLP, KR, LICS, SAT<br />
</td>
</tr>
<tr>
<td>July 24–25</td>
<td>Workshops</td>
<td>
MW2, ARQNL, IWC, Isabelle, LFMTP, SMT, TPTPTP, UNIF, VAMPIRE, WiL, AR4Space, CompBench, HCVS, Lean, PAAR,
TEAL, WST, Rocqshop, ...
</td>
</tr>
<tr>
<td>July 26–29</td>
<td>Week 2 Conferences</td>
<td>
CAV, CSF, IJCAR, ITP
</td>
</tr>
</tbody>
</table>
</div>
<div id="book-announcement">
<h2 id="newsecretary">Book Announcement: Concise Introduction to Alternating-Time Temporal Logics</h2>
<div class="details"><a href="https://lsv.ens-paris-saclay.fr/~demri/">Stéphane Demri</a></div>
<p>The formal verification of multi-agent systems aimed at proving that such
systems meet their specifications has given rise to a very active field of
research at the crossroads of formal methods, knowledge representation and
artificial intelligence. Alternating-time temporal logics are considered as
one of the most popular and influential logical formalisms for strategic
reasoning in multi-agent systems and have been introduced by Rajeev Alur,
Thomas Henzinger and Orna Kupferman about 25 years ago.</p>
<p>
This textbook provides a concise presentation of alternating-time temporal
logics devoted to strategic reasoning in multi-agent systems. Dedicated mainly
to the model-checking problem, the work examines developments about basic
semantical properties of such logics, decision procedures and computational
complexity. It provides results for solving optimally the model-checking
problem on concurrent game structures by taking advantage of—or adapting proof
methods from—temporal logics, games in theoretical computer science and
automata theory.
</p>
<p>Further information can be found <a href="https://link.springer.com/book/9783032118844">here</a>.</p>
</div>
<div id="awards">
<h2 id="awards-title">Awards</h2>
<div id="awards-ackermann">
<h3 id="ackermann"><a href="https://www.eacsl.org/ackermann-award/">Ackermann Award 2026</a>, call for Nominations</h3>
<p>
Nominations are invited for the 2026 Ackermann Award.
PhD dissertations in topics specified by the CSL and LICS
conferences, which were formally accepted as PhD theses at a
university or equivalent institution between 1 January 2025
and 31 December 2025 are eligible for nomination for the award.
</p>
<p>
The deadline for submission is <b>July 1, 2026</b>.
</p>
<p>
<b>Nominations</b><br />
Nominations should be submitted by the candidate or the
supervisor via <a href="https://easychair.org/conferences/?conf=ackermann2026">Easychair</a>.
</p>
<p>
<b>Procedure</b><br />
Please submit a pdf file containing:
</p>
<ul>
<li>a summary in English of the thesis (maximum 10 pages),
providing a gentle introduction and overview of the thesis,
highlighting the novel results and their impact and
including a link to the thesis in the first page
(please do not include the thesis itself);</li>
<li>a supporting letter by the PhD advisor and two supporting
letters by other senior researchers (in English);</li>
<li>a copy of a document stating that the thesis was accepted
as a PhD thesis at a recognised University (or equivalent
institution) and that the candidate was awarded the PhD
degree within the specified period;</li>
<li>a short CV of the candidate.</li>
</ul>
<p>
<b>The Award</b><br />
The 2026 Ackermann award will be presented to the recipient(s)
at CSL 2027.
The award consists of a certificate, an invitation to present
the thesis at the CSL conference, the publication of the
laudatio in the CSL proceedings, and financial support to
attend the conference.
The Ackermann Award 2026 is sponsored by Amazon Automated Reasoning.
</p>
<p>
<b>Ackermann Jury</b><br />
The jury consists of:
</p>
<ul>
<li>Albert Atserias (UPC Barcelona)</li>
<li>Christel Baier (TU Dresden)</li>
<li>Andrej Bauer (U Ljubljana)</li>
<li>Javier Esparza (TU Munich)</li>
<li>Maribel Fernandez (King's College London), EACSL president</li>
<li>Jean Goubault-Larrecq (ENS Paris-Saclay)</li>
<li>Joost-Pieter Katoen (RWTH Aachen U), ACM SigLog rep.</li>
<li>Delia Kesner (IRIF, U Paris Cite)</li>
<li>Slawomir Lasota (U Warsaw)</li>
<li>Florin Manea (U Goettingen), EACSL vice-president</li>
<li>Prakash Panangaden (U Edinburgh & McGill U)</li>
</ul>
<p>
For more information please contact <a href="mailto:Maribel.Fernandez@kcl.ac.uk">Maribel Fernandez</a>.
</p>
</div>
<div id="awards-milestone">
<h3 id="milestone"><a href="https://www.ams.org/prizes-awards/paview.cgi?parent_id=63">Milestone Prize for Foundational Work in Formal Verification</a>, call for Nominations</h2>
<p>This prize was recently reestablished with support from the AI For Math Fund, which is run by Renaissance Philanthropy and funded by XTX Markets. The goal of the prize is to highlight and celebrate influential work and to encourage formal verification throughout mathematics and its applications. The work can be published in a recognized journal or code repository or other comparable database of record.
</p>
<p>
Nominations are accepted from March 20 to <b>June 30, 2026</b>.
</p>
<p>More information is available on the prize's <a href="https://www.ams.org/prizes-awards/paview.cgi?parent_id=63">web page</a>.</p>
</div>
</div>
<!-- ============================================================ -->
<!-- EVENTS -->
<!-- ============================================================ -->
<div id="events">
<h2 id="events-title">Events</h2>
<div id="event-fmpsi26">
<h3 id="fmpsi26">
FMPSI'26 & PAT 2026: <a href="https://deducteam.gitlabpages.inria.fr/FMPSI26/">Formal Mathematics, Proof
Systems Interoperability</a> and <a href="https://pat2026.irif.fr/">Proof Assistants for Teaching</a>, call
for participation
</h3>
<div class="details">June 22–July 3, 2026, Orsay, France</div>
<p>
<b>FMPSI'26</b> is a two-week meeting aiming at gathering experts in formal mathematics and proof systems
interoperability in order to discuss recent advances and make concrete progress on the formalization of
advanced mathematics, the management of collaborative development of large libraries of proofs, the
certification of proofs generated by automated theorem provers, the translation of definitions, theorems
and proofs between different interactive theorem provers, and the use of proof assistants in teaching.
There will be three working groups: one on proof systems interoperability, one on formal mathematics, and
one on computer algebra.
</p>
<p>
In the second week (June 29–July 2), the 2nd edition of <b>PAT 2026 (Proof Assistants for Teaching)</b>
is co-organised. PAT aims to bring together researchers, teachers, students, and stakeholders interested in
the use of proof assistant for
teaching. PAT seeks to offer a broad spectrum of current research in the field of didactic of proof, the
impact of the
use of proof assistants in education, formalization of mathematics and user interfaces for theorem proving.
The
objective is to gather three audiences:
researchers in didactics of mathematics or informatics who would like to learn how and why use proof
assistants in class;
mathematicians who would like to learn how to use proof assistants for their research and teaching;
specialists of proof assistants, who want to learn more about the didactic of proof and proving in
mathematics. Remote participation is possible.
</p>
<p>More information is available on the <a href="https://deducteam.gitlabpages.inria.fr/FMPSI26/">FMPSI</a> and
<a href="https://pat2026.irif.fr/">PAT</a> web pages.
</p>
</div>
<div id="conf-aiml2026">
<h3 id="aiml2026">
<a href="https://events.illc.uva.nl/aiml2026/">AiML 2026: 16th International Conference on Advances in Modal Logic</a>, call for participation
</h3>
<div class="details">June 29–July 3, 2026, Amsterdam, The Netherlands</div>
<p>
Advances in Modal Logic is an initiative aimed at presenting the state of the art in modal logic and its various applications. The initiative consists of a conference series together with volumes based on the conferences.
</p>
<p>Topics of interest include (but are not limited to):</p>
<ul>
<li>Semantics and model theory</li>
<li>Proof theory, including automated deduction</li>
<li>Applications of modal logic</li>
<li>Co-algebraic aspects</li>
<li>History and philosophy of modal logic</li>
<li>Computational or theoretical aspects</li>
<li>Specific instances and variations of modal logic (e.g., description logics, dynamic logics, epistemic and deontic logics, modal logics for agent-based systems, provability and interpretability logics, spatial and temporal logics, hybrid logic, intuitionistic logic, substructural logics)</li>
</ul>
<p><b>Important Dates (AoE)</b></p>
<ul>
<li>Registration deadline: <b>June 15, 2026</b></li>
</ul>
<p>More information is available on the conference's <a href="https://events.illc.uva.nl/aiml2026/">web page</a>.</p>
</div>
<div id="event-avm26">
<h3 id="avm26"><a href="https://avm26.github.io/">AVM'26: Alpine Verification Meeting 2026</a>, call for
participation</h3>
<div class="details">September 22–24, 2026, Eger, Hungary</div>
<p>
The Alpine Verification Meeting (AVM) is an informal meeting on current problems in formal verification,
bringing together researchers from the Alpine and surrounding regions to discuss ongoing work and foster
collaborations. The format encourages short presentations and discussion of work in progress.
</p>
<p>More information is available on the event's <a href="https://avm26.github.io/">web page</a>.</p>
</div>
</div>
<!-- ============================================================ -->
<!-- CONFERENCES -->
<!-- ============================================================ -->
<div id="conferences">
<h2 id="conferences-title">Conferences</h2>
<div id="conf-icfem2026">
<h3 id="icfem2026">
<a href="https://icfem2026.github.io/">ICFEM 2026: 27th International Conference on Formal Engineering
Methods</a>, call for papers
</h3>
<div class="details">November 17–20, 2026, Southampton, United Kingdom</div>
<p>
ICFEM is an internationally leading conference series in formal methods and software engineering. Since 1997,
ICFEM has
served as an international forum for researchers and practitioners who have been seriously applying formal
methods to
practical applications. Researchers and practitioners from industry, academia, and government are encouraged
to attend,
present their research, and help advance the state of the art. ICFEM is interested in work that has been
incorporated
into real production systems, as well as in theoretical work that promises to bring practical and tangible
benefits.
</p>
<p>Topics of interest include (but are not limited to):</p>
<ul>
<li>Formal specification and modeling</li>
<li>Formal approaches to fault prevention and detection</li>
<li>Abstraction, refinement, and evolution</li>
<li>Formal verification and validation</li>
<li>Integration of formal methods and testing</li>
<li>Integration of formal methods and review</li>
<li>SAT/SMT solvers for software analysis and testing</li>
<li>Practical formal methods</li>
<li>Applications of formal methods</li>
<li>Formal approaches to software maintenance</li>
<li>Formal approaches to safety-critical system development</li>
<li>Supporting tools for formal methods</li>
<li>Formal methods for agile development</li>
<li>Formal methods for human-machine pair programming</li>
<li>Formal methods for and with AI</li>
<li>Formal methods for Cyber-physical systems and IoT</li>
<li>Formal methods for security</li>
<li>Formal certification of products</li>
<li>Industrial case studies</li>
</ul>
<p><b>Important Dates (AoE)</b></p>
<ul>
<li>Abstract submission: <b>June 1, 2026</b></li>
<li>Full paper submission: June 8, 2026</li>
<li>Notification: August 8, 2026</li>
<li>Camera-ready: September 7, 2026</li>
</ul>
<p>More information is available on the conference's <a href="https://icfem2026.github.io/">web page</a>.</p>
</div>
<div id="conf-lpar2026">
<h3 id="lpar2026">
<a href="https://lpar-26.info">LPAR 2026: The 26th Conference on Logic for Programming, Artificial Intelligence and Reasoning</a>, call for papers
</h3>
<div class="details">October 25–30, 2026, Spetses, Greece</div>
<p>
The International Conference on Logic for Programming, Artificial Intelligence
and Reasoning (LPAR) is an academic conference aimed at discussing cutting-edge
results in the fields of automated reasoning, computational logic, programming
languages and their applications. Papers from previous proceedings are listed
in DBLP. LPAR's slogan is "To boldly go where no reasonable conference has gone
before". LPAR brings first class research and researchers to interesting
places, and exposes the conference attendees to interesting cultures.
</p>
<p>Topics of interest include (but are not limited to):</p>
<ul>
<li>Abduction</li>
<li>Answer set programming</li>
<li>Automated reasoning</li>
<li>Constraint programming</li>
<li>Computational proof theory</li>
<li>Decision procedures</li>
<li>Description logics</li>
<li>Formalizing mathematics</li>
<li>Foundations of security</li>
<li>Hardware verification</li>
<li>Implementations of logic</li>
<li>Interpolation</li>
<li>Interactive theorem proving</li>
<li>Knowledge representation and reasoning</li>
<li>Logic and computational complexity</li>
<li>Logic and databases</li>
<li>Logic and games</li>
<li>Logic and language models</li>
<li>Logic and machine learning</li>
<li>Logic and the web</li>
<li>Logic and types</li>
<li>Logic in artificial intelligence</li>
<li>Logic programming</li>
<li>Logical foundations of programming</li>
<li>Logics of knowledge and belief</li>
<li>Modal and temporal logics</li>
<li>Model checking</li>
<li>Non-monotonic reasoning</li>
<li>Ontologies and large knowledge bases</li>
<li>Probabilistic and fuzzy reasoning</li>
<li>Program analysis</li>
<li>Rewriting</li>
<li>Satisfiability checking</li>
<li>Satisfiability modulo theories</li>
<li>Software verification</li>
<li>Unification theory</li>