FLoC on Sunday, July 18th

See also the by session program.

CAV	CSF	ICLP	IJCAR
09:00‑10:00 Somesh Jha Retrofitting Legacy Code for Security 10:00‑10:15 CAV Award Ceremony	09:00‑09:30 Adam Lee and Ting Yu On the quantitative analysis of proofs of authorization: applications, framework, and techniques 09:30‑10:00 Lujo Bauer, Limin Jia and Divya Sharma Towards precise specification of logic-based access-control policies	09:00‑09:12 Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir and Martine De Cock Communicating Answer Set Programs 09:12‑09:24 Timur Fayruzov, Jeroen Janssen, Martine De Cock, Chris Cornelis and Dirk Vermeir Efficient solving of time-dependent answer set programs 09:24‑09:36 Marcello Balduccini Learning Domain-Specific Heuristics for Answer Set Solvers 09:36‑09:48 Tomi Janhunen Sampler Programs: The Stable Model Semantics Abstract Constraint Programs Revisited 09:48‑10:00 Johannes Oetsch, Joerg Puehrer and Hans Tompits Methods and Methodologies for Developing Answer-Set Programs---Project Description	09:00‑09:30 Markus Aderhold Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion 09:30‑10:00 David Baelde, Dale Miller and Zachary Snow Focused Inductive Theorem Proving
10:00‑10:30 Coffee break
10:30‑10:55 Rüdiger Ehlers Symbolic Bounded Synthesis 10:55‑11:20 Krishnendu Chatterjee, Thomas Henzinger, Barbara Jobstmann and Rohit Singh Measuring and Synthesizing Systems in Probabilistic Environments 11:20‑11:45 Susanne Graf, Doron Peled and Sophie Quinton Achieving Distributed Control Through Model Checking 11:45‑12:10 Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas Henzinger and Barbara Jobstmann Robustness in the Presence of Liveness 12:10‑12:25 Roderick Bloem, Alessandro Cimatti, Karin Greimel, Georg Hofferek, Robert Koenighofer, Marco Roveri, Viktor Schuppan and Richard Seeber RATSY - A new Requirements Analysis Tool with Synthesis 12:25‑12:40 Viktor Kuncak, Mikael Mayer, Ruzica Piskac and Philippe Suter Comfusy: A Tool for Complete Functional Synthesis	10:30‑11:00 Moritz Y. Becker Information flow in credential systems 11:00‑11:30 Alejandro Russo and Andrei Sabelfeld Dynamic vs. static flow-sensitive security analysis 11:30‑12:00 Andrey Chudnov and David Naumann Information flow monitor inlining 12:00‑12:30 Stephen Chong Required information release	10:30‑11:00 Yisong Wang, Jia-Huai You, Li-Yan Yuan and Yi-Dong Shen Loop Formulas for Description Logic Programs 11:00‑11:30 Martin Slota and João Leite Towards Closed World Reasoning in Dynamic Open Worlds 11:30‑12:00 James Delgrande A Program-Level Approach to Revising Logic Programs under the Answer Set Semantics 12:00‑12:30 Ping Hou, Broes De Cat and Marc Denecker FO(FD): Extending classical logic with rule-based fixpoint definitions	10:30‑11:00 Vincent Aravantinos, Ricardo Caferra and Nicolas Peltier A Decidable Class of Nested Iterated Schemata 11:00‑11:15 Vincent Aravantinos, Ricardo Caferra and Nicolas Peltier RegSTAB: a SAT-Solver for Propositional Schemata 11:15‑11:45 Nikolaj Bjørner Linear Quantifier Elimination as an Abstract Decision Procedure 11:45‑12:15 Oliver Friedmann, Markus Latte and Martin Lange A Decision Procedure for CTL* Based on Tableaux and Automata 12:15‑12:30 Filip Maric and Predrag Janicic URBiVA: Uniform Reduction to Bit-Vector Arithmetic
12:30‑14:00 Lunch
14:00‑15:00 Deepak Kapur (University of New Mexico) Induction, Invariants, and Abstraction
15:00‑15:30 Coffee break
15:30‑15:55 Vineet Kahlon and Chao Wang Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs 15:55‑16:20 Viktor Vafeiadis Automatically proving linearizability 16:20‑16:45 Pavol Cerny, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri and Rajeev Alur Model Checking of Linearizability of Concurrent List Implementations 16:45‑17:10 Ernie Cohen, Michał Moskal, Stephan Tobies and Wolfram Schulte Local Verification of Global Invariants in Concurrent Programs 17:10‑17:35 Aws Albarghouthi, Arie Gurfinkel, Ou Wei and Marsha Chechik Abstract Analysis of Symbolic Executions 17:35‑17:50 Clark Barrett, Morgan Deters, Albert Oliveras and Aaron Stump Report on SMT-COMP 2010	15:30‑16:00 Simon Meier, Cas Cremers and David Basin Strong invariants for the efficient construction of machine-checked protocol security proofs 16:00‑16:30 Santiago Zanella Béguelin, Gilles Barthe, Sylvain Heraud, Benjamin Grégoire and Daniel Hedin A machine-checked formalization of sigma-protocols 16:30‑17:00 Benedikt Schmidt, Patrick Schaller and David Basin Impossibility results for secret establishment	15:30‑16:00 Hariolf Betz, Frank Raiser and Thom Fruehwirth A Complete and Terminating Execution Model for Constraint Handling Rules 16:00‑16:30 Maurizio Gabbrielli, Jacopo Mauro, Maria Chiara Meo and Jon Sneyers Decidability properties for fragments of CHR 16:30‑17:00 Mario Rodríguez-Artalejo and Carlos A. Romero-Díaz A Declarative Semantics for CLP with Qualification and Proximity	15:30‑16:00 Jonathan Abourbih, Luke Blaney, Alan Bundy and Fiona McNeill A Single-Significant-Digit Calculus for Semi-Automated Guesstimation 16:00‑16:30 Hicham Bensaid, Ricardo Caferra and Nicolas Peltier Perfect discrimination graphs: indexing terms with integer exponents 16:30‑17:00 Angelo Brillout, Daniel Kroening, Philipp Rümmer and Thomas Wahl An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic 17:10‑17:50 IJCAR Business Meeting
19:30‑23:00 FLoC Banquet at Prestonfield House