FLoC on Friday, July 16th

See also the by session program.

CAV	ICLP	IJCAR
09:00‑10:00 David Basin (ETH Zurich) Policy Monitoring in First-order Temporal Logic
10:00‑10:30 Coffee break
10:30‑10:55 Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Ahmed Rezine and Mihaela Sighireanu Invariant Synthesis for Programs Manipulating Lists with Unbounded Data 10:55‑11:20 Daniel Kroening, Natasha Sharygina, Aliaksei Tsitovich and Christoph M.Wintersteiger Termination Analysis with Compositional Transition Invariants 11:20‑11:45 Kenneth McMillan Lazy Annotation for Program Testing and Verification 11:45‑12:00 Thomas Ball, Ella Bounimova, Vladimir Levin, Rahul Kumar and Jakob Lichtenberg The Static Driver Verifier Research Platform 12:00‑12:15 Ming Kawaguchi, Patrick M. Rondon and Ranjit Jhala Dsolve: Verification Via Liquid Type Inference 12:15‑12:30 Sudipta Kundu, Malay Ganai and Chao Wang CONTESSA: Concurrency Testing Augmented with Symbolic Analysis	10:30‑11:00 Peter Schneider-Kamp, Jürgen Giesl, Thomas Stroeder, Alexander Serebrenik and René Thiemann Automated Termination Analysis for Logic Programs with Cut 11:00‑11:30 Alberto Pettorossi, Maurizio Proietti and Valerio Senni Transformations of Logic Programs on Infinite Lists 11:30‑12:00 Pablo Chico de Guzmán, Manuel Carro Liñares and David S. Warren Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling 12:00‑12:30 Vítor Santos Costa, Inês Castro Dutra and Ricardo Rocha Threads and Or-Parallelism Unified	10:30‑10:45 Mike Gordon (University of Cambridge) Remembering Robin Milner 10:45‑11:15 Anders Schack-Nielsen and Carsten Schürmann Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus 11:15‑11:30 Brigitte Pientka and Joshua Dunfield Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description) 11:30‑11:45 Silvio Ghilardi and Silvio Ranise MCMT: A Model Checker Modulo Theories 11:45‑12:15 Carsten Ihlemann and Viorica Sofronie-Stokkermans On efficient reasoning in combinations of theories
12:30‑14:00 Lunch
14:00‑14:25 Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukas Holik, Chih-Duo Hong, Richard Mayr and Tomas Vojnar Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing 14:25‑14:50 Frédéric Herbreteau, B Srivathsan and Igor Walukiewicz Efficient Emptiness Check for Timed Büchi Automata	14:00‑14:30 Jon Sneyers, Wannes Meert, Joost Vennekens, Yoshitaka Kameya and Taisuke Sato CHR(PRISM)-based Probabilistic Logic Learning 14:30‑15:00 Henning Christiansen, Christian Theil Have, Ole Torp Lassen and Matthieu Petit Inference with Constrained Hidden Markov Models in PRISM	14:00‑14:30 Rajeev Goré, Clemens Kupke, Dirk Pattinson and Lutz Schröder Global Caching for Coalgebraic Description Logics 14:30‑15:00 Despoina Magka, Yevgeny Kazakov and Ian Horrocks Tractable Extensions of the Description Logic EL with Numerical Datatypes
15:00‑15:30 Coffee break
15:30‑15:45 Nicolas Caniart Merit: an Interpolating Model-Checker 15:45‑16:00 Alexandre Donzé Breach, A Simulation-based Toolbox for the Verification and Parameter Synthesis of Hybrid Systems 16:00‑16:15 Amir Pnueli, Yaniv Sa'ar and Lenore D. Zuck JTLV : A Framework for Developing Verification Algorithms 16:15‑16:30 Roland Meyer and Tim Strazny Petruchio: From Dynamic Networks to Nets 16:30‑17:30 Moshe Vardi Amir Pnueli: Ahead of His Time 17:30‑18:00 Doron Peled, Zohar Manna and others Reminiscences on Amir Pnueli (TBC)	15:30‑15:42 Michael Maher Contractible Approximations of Soft Global Constraints 15:42‑15:54 Jose Santos and Stephen Muggleton Subsumer: A Prolog theta-subsumption engine 15:54‑16:06 Pedro Lopez-Garcia, Luthfi Darmawan and Francisco Bueno A Framework for Verification and Debugging of Resource Usage Properties 16:06‑16:18 Nicolas Guenot Focused Proof Search for Linear Logic in the Calculus of Structures 16:18‑16:30 neda saeedloei and Gopal Gupta Timed Definite Clause Omega-Grammars 16:30‑16:42 Theofrastos Mantadelis and Gerda Janssens Dedicated Tabling for a Probabilistic Setting 16:42‑16:54 Daan Fierens Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization	15:30‑16:00 Julian Backes and Chad Brown Analytic Tableaux for Higher-Order Logic with Choice 16:00‑16:30 Jasmin Christian Blanchette and Alexander Krauss Monotonicity Inference for Higher-Order Formulas 16:30‑17:00 Sascha Böhme and Tobias Nipkow Sledgehammer: Judgement Day
19:00‑22:00 Drinks reception at The National Galleries of Scotland