PCR'17

Local Information

9:00 - 9.30	From parallel theorem proving to parallel SAT-solving and back Maria Paola Bonacina (Università degli Studi di Verona)
9:30 - 10.00	Harnessing over a Million CPU Cores to Solve a Single Hard Mixed Integer Programming Problem on a Supercomputer Yuji Shinano (Zuse Institute Berlin)
10:00 - 10.30	Coffee break
10:30 - 11.00	Solving very hard problems: Cube-and-Conquer, a hybrid SAT solving method Marijn Heule (University of Texas at Austin)
11:00 - 11.30	Parallel SAT Solving: Past, Present and Future Carsten Sinz (Karlsruhe Institute of Technology)
11:30 - 12.00	Parallel Answer Set Programming Andrea Formisano (Università di Perugia)
12:00 - 14.00	Lunch break
14:00 - 14.30	Parallel QBF Solving: State of the Art Techniques and Future Perspectives Florian Lonsing (TU Wien)
14:30 - 15.00	Parallel Model-based Diagnosis on Multi-Core Computers Dietmar Jannach (TU Dortmund)
15:00 - 15.30	Coffee Break
15:30 - 16.00	Concurrent Data Structures for Multi-Core Model Checking Alfons Laarman (Universiteit Leiden)
16:00 - 16.30	P3: Model Checking using distributed PDR Matteo Marescotti (Università della Svizzera italiana)