Program

PROGRAM

Days: Tuesday, January 12th Wednesday, January 13th

Tuesday, January 12th

View this program: with abstracts session overview talk overview

16:00-17:05 Session 1: LPAR-23 Opening and Invited Talk (CET Time)

Chair:

16:00	Elvira Albert and Laura Kovacs LPAR-23 Welcome (abstract)
16:05	Robert Nieuwenhuis, Adrià Lozano, Albert Oliveras and Enric Rodríguez-Carbonell Decision levels are stable: towards better SAT heuristics (abstract)

17:05-17:15 Session 2: Breakout (CET time)

Chair:

Laura Kovacs

17:15-18:15 Session 3A: SAT Solving (CET Time)

Chair:

Mikolas Janota

17:15	Peter Oostema, Ruben Martins and Marijn Heule Coloring Unit-Distance Strips using SAT (abstract)
17:35	Jarkko Savela, Emilia Oikarinen and Matti Järvisalo Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation (abstract)
17:55	Mathias Fleury and Christoph Weidenbach A Verified SAT Solver Framework including Optimization and Partial Valuations (abstract)

17:15-18:15 Session 3B: Reasoning and Machine Learning (CET Time)

Chair:

Cezary Kaliszyk

17:15	Thibault Gauthier Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic (abstract)
17:35	Lasse Blaauwbroek, Josef Urban and Herman Geuvers Tactic Learning for the Coq Proof Assistant (Short Paper) (abstract)
17:55	Jan H. Boockmann and Gerald Luettgen Learning Data Structure Shapes from Memory Graphs (abstract)

18:15-18:30 Session 4: Breakout (CET time)

Chair:

Elvira Albert

18:30-19:30 Session 5A: SAT and Proofs (CET Time)

Chair:

Martin Suda

18:30	Emanuel Kieronski and Adam Malinowski The Triguarded Fragment with Transitivity (abstract)
18:50	Adrian Rebola Pardo and Georg Weissenbacher RAT Elimination (abstract)
19:10	Joseph Sweeney, Marijn J. H. Heule and Lawrence Pileggi Sensitivity Analysis of Locked Circuits (abstract)

18:30-19:30 Session 5B: Higher-Order Logic and Learning (CET Time)

Chair:

Sarah Winkler

18:30	Alexandru Baltag and Sonja Smets Learning What Others Know (abstract)
18:50	Ben Goldberger, Guy Katz, Yossi Adi and Joseph Keshet Minimal Modifications of Deep Neural Networks using Verification (abstract)
19:10	Johannes Åman Pohjola and Arve Gengelbach A Mechanised Semantics for HOL with Ad-hoc Overloading (abstract)

Wednesday, January 13th

View this program: with abstracts session overview talk overview

16:00-17:15 Session 6: Invited Talk and Breakout (CET Time)

Chair:

Nikolaj Bjorner

16:00

Mooly Sagiv

Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols (abstract)

17:15-18:15 Session 7A: Logic and Synthesis (CET Time)

Chair:

Dale Miller

17:15	Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann and Alisa Kovtunova Finding Small Proofs for Description Logic Entailments -- Theory and Practice (abstract)
17:35	Erika Abraham, Ezio Bartocci, Borzoo Bonakdarpour and Oyendrila Dobe Parameter Synthesis for Probabilistic Hyperproperties (abstract)
17:55	Tarek Khaled and Belaid Benhamou An ASP-based Approach for Boolean Networks Representation and Attractor Detection (abstract)

17:15-18:15 Session 7B: Verification and Induction (CET Time)

Chair:

Wolfgang Ahrendt

17:15	Marcel Hark, Florian Frohn and Jürgen Giesl Polynomial Loops: Beyond Termination (abstract)
17:35	Mnacho Echenim, Radu Iosif and Nicolas Peltier Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard (abstract)
17:55	A Dileep, Kuldeep S. Meel and Ammar F. Sabili Induction Models on N (abstract)

18:15-19:30 Session 8: Breakout, Invited Talk and LPAR-23 Closing (CET Time)

Chair:

Elvira Albert

18:15

Alexandra Silva

Models of Concurrent Kleene Algebra (abstract)