WHOOPS — PROGRAM
Days: Sunday, 19 July 2026
Sunday, 19 July 2026
09:00-10:30
Papers 1
WHOOPS
Location:
C1.01
| 09:00-09:10 |
Opening Remarks (abstract) 10 min
1 University of Glasgow
|
| 09:10-09:30 |
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach (abstract) 20 min
1 University of Helsinki
2 Vrije Universiteit Brussel & KU Leuven
3 University of Freiburg
4 KU Leuven & Vrije Universiteit Brussel
|
| 09:30-09:50 |
Towards Practical Zero-Knowledge Proof for PSPACE (abstract) 20 min
1 University of Toronto
2 University of Illinois Urbana-Champaign
3 University of Toronto, Georgia Institute of Technology
|
| 09:50-10:10 |
Trimming Pseudo-Boolean Proofs (abstract) 20 min
1 Vrije Universiteit Brussel, Belgium\\ Arba Minch University, Ethiopia
2 KU Leuven, Belgium\\ Vrije Universiteit Brussel, Belgium
3 University of Copenhagen, Denmark\\ Lund University, Sweden
4 University of Basel, Switzerland
5 University of Glasgow, United Kingdom
6 Lund University, Sweden\\ University of Copenhagen, Denmark
7 Vienna University of Technology, Austria\\ Johannes Kepler University Linz, Austria
|
| 10:10-10:30 |
Proving back and forth with the same rules (abstract) 20 min
1 JKU Linz
2 TU Wien, JKU Linz
|
10:30-11:00
Coffee Break
WHOOPS
Location:
C1.01
11:00-12:00
Invited Talk: Stefan Szeider
WHOOPS
Location:
C1.01
12:00-13:30
Lunch
WHOOPS
Location:
C1.01
13:30-14:30
Invited Talk: Haniel Barbosa
WHOOPS
Location:
C1.01
14:30-15:30
Papers 2
WHOOPS
Location:
C1.01
| 14:30-14:50 |
Proof Logging for Nonlinear Boundary-Value Solvers: A Falkner-Skan Case Study (abstract) 20 min
1 Indiana University Bloomington
|
| 14:50-15:10 |
Certifying Algorithms for Nonlinear Real Arithmetic (abstract) 20 min
1 Universidade Federal de Minas Gerais
|
| 15:10-15:30 |
Pseudo-Boolean Blasting for the SMT Theory of Bit-Vectors (abstract) 20 min
1 Universidade Federal de Minas Gerais
2 Universidade Federal de MInas Ferais
|
15:30-16:00
Coffee Break
WHOOPS
Location:
C1.01
16:00-18:00
Papers 3
WHOOPS
Location:
C1.01
| 16:00-16:20 |
Proof Logging for (Re)Encoding (abstract) 20 min
1 Carnegie Mellon University
|
| 16:20-16:40 |
End-to-End Verification for Constraint Programming: Closing the Encodings Gap (abstract) 20 min
1 Lund University and University of Copenhagen
2 University of Glasgow
3 Chalmers University
4 University of Copenhagen and Lund University
5 Nanyang Technological University and Singapore Institute for Infocomm Research
6 Singapore Institute for Infocomm Research
|
| 16:40-17:00 |
Certificate-Based Propagation: Foundations for Correct Propagator Design (abstract) 20 min
1 Delft University of Technology
|
| 17:00-17:20 |
Generalised Clause Learning for Constraint Programming (abstract) 20 min
1 Uppsala universitet
|
| 17:20-17:40 |
How can hard can multiplication be? (abstract) 20 min
1 University of Glasgow
|
| 17:40-18:00 |
Discussion and Closing (abstract) 20 min
1 University of Glasgow
|