FLoC on Monday, July 19th

See also the by session program.

CAV	CSF	ICLP	IJCAR
09:00‑10:00 Maged Michael Memory Management in Concurrent Algorithms	09:00‑09:30 Juan Garay, Aggelos Kiayias and Hong-Sheng Zhou A framework for the sound specification of cryptographic tasks 09:30‑10:00 Devdatta Akhawe, Adam Barth, Peifung Lam, John Mitchell and Dawn Song Towards a formal foundation of web security	09:00‑10:00 Molham Aref (LogicBlox) Datalog for Enterprise Software: from Industrial Applications to Research. 10:00‑10:10 ICLP Awards Ceremony	09:00‑10:00 Leonardo de Moura (Microsoft Research Redmond) Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development
10:00‑10:30 Coffee break
10:30‑10:55 Yu-Fang Chen, Edmund Clarke, Azadeh Farzan, Ming-Hsien Tsai, Yih-Kuen Tsay and Bow-Yaw Wang Automated Assume-Guarantee Reasoning through Implicit Learning 10:55‑11:20 Rishabh Singh, Dimitra Giannakopoulou and Corina Pasareanu Learning Component Interfaces with May and Must Abstractions 11:20‑11:45 Ariel Cohen, Kedar Namjoshi and Yaniv Sa'ar A Dash of Fairness for Compositional Reasoning 11:45‑12:00 Ariel Cohen, Kedar Namjoshi and Yaniv Sa'ar SPLIT: A Compositional LTL Verifier 12:00‑12:15 Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll, Marco Roveri and Ralf Wimmer A Model Checker for AADL 12:15‑12:30 Manuel Mazo Jr., Anna Davitian and Paulo Tabuada PESSOA: A tool for embedded controller synthesis.	10:30‑11:00 Alwen Tiu and Jeremy Dawson Automating open bisimulation checking for the spi-calculus 11:00‑11:30 Stefan Ciobaca and Veronique Cortier Protocol composition for arbitrary primitives 11:30‑12:00 Martin Abadi and Gordon Plotkin On protection by layout randomization 12:00‑12:15 Andrew Myers and Michael Backes Program chairs' report and conference close	10:30‑11:00 Michela Milano, Marco Gavanelli, Fabrizio Riguzzi and Paolo Cagnoli Logic-Based Decision Support for Strategic Environmental Assessment 11:00‑11:30 Miguel Gomez-Zamalloa, Elvira Albert and German Puebla Test Case Generation for Object-Oriented Imperative Languages in CLP 11:30‑12:00 Gregory Gelfond, Chitta Baral, Enrico Pontelli and Tran Son Using Logic Programming for Finding Models in the Logics of Knowledge and its Applications 12:00‑12:30 Nuno P. Lopes, Juan Navarro Perez, Andrey Rybalchenko and Atul Singh Applying Prolog to Develop Distributed Systems	10:30‑11:00 Vincent Cheval, Hubert Comon-Lundh and Stephanie Delaune Automating security analysis: symbolic equivalence of constraint systems 11:00‑11:15 Cvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller and Bruno Woltzenlogel Paleo The Proof Transformation System CERES 11:15‑11:30 Daniel Kühlwein, Marcos Cramer, Peter Koepke and Bernhard Schröder Premise Selection in the Naproche System 11:30‑12:00 Martin Suda, Christoph Weidenbach and Patrick Wischnewski On the Saturation of YAGO 12:00‑12:30 Geoff Sutcliffe Results of the CASC-J5 System Competition
12:30‑14:00 Lunch
14:00‑14:25 Min Zhou, Fei He, Bow-Yaw Wang and Ming Gu On Array Theory of Bounded Elements 14:25‑14:50 David Monniaux Quantifier elimination by lazy model enumeration		14:00‑14:12 Paulo Shakarian, V.S. Subrahmanian and Maria Luisa Sapino Using Generalized Annotated Programs to Solve Social Network Optimization Problems 14:12‑14:24 Fabrizio Riguzzi and Terrance Swift Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions 14:24‑14:36 Domenico Corapi, Alessandra Russo and Emil Lupu Inductive Logic Programming as Abductive Search 14:36‑14:48 Marco Alberti, Marco Gavanelli and Evelina Lamma Runtime Addition of Integrity Constraints in Abductive Logic Programs 14:48‑15:00 Gerardo Simari and V.S. Subrahmanian Abductive Inference in Probabilistic Logic Programs	14:00‑14:30 Birte Glimm, Ian Horrocks and Boris Motik Optimized Description Logic Reasoning via Core Blocking 14:30‑15:00 Yevgeny Kazakov An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
15:00‑15:30 Coffee break
15:30‑15:55 Pierre Ganty, Rupak Majumdar and Benjamin Monmege Bounded Underapproximations 15:55‑16:20 Anil Seth Global Reachability in Bounded Phase Multi-Stack Pushdown Systems 16:20‑16:45 Salvatore La Torre, P Madhusudan and Gennaro Parlato Model-checking parameterized concurrent programs using linear interfaces 16:45‑17:10 Alexander Kaiser, Daniel Kroening and Thomas Wahl Dynamic Cutoff Detection in Parameterized Concurrent Programs 17:10‑17:25 Ernst Moritz Hahn, Holger Hermanns, Björn Wachter and Lijun Zhang PARAM: A Model Checker for Parametric Markov Models 17:25‑17:40 Krishnendu Chatterjee, Thomas Henzinger, Barbara Jobstmann and Arjun Radhakrishna GIST: A Solver for Probabilistic Games 17:40‑17:55 Alessandro Ferrante, Maurizio Memoli, Margherita Napoli, Mimmo Parente and Francesco Sorrentino A NuSMV Extension for Graded-CTL Model Checking		15:30‑16:00 Alessandro Dal Palu, Agostino Dovier, Federico Fogolari and Enrico Pontelli CLP-based protein fragment assembly 16:00‑16:30 Marcello Balduccini and Sara Girotto Formalization of Psychological Knowledge in Answer Set Programming and its Application 16:30‑17:00 Robert Brummayer and Matti Järvisalo Testing and Debugging Techniques for Answer Set Solver Development 17:00‑17:30 Johannes Oetsch, Joerg Puehrer, Martin Schwengerer and Hans Tompits The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs	15:30‑16:00 Nao Hirokawa and Aart Middeldorp Decreasing Diagrams and Relative Termination 16:00‑16:30 Friedrich Neurauter, Aart Middeldorp and Harald Zankl Monotonicity Criteria for Polynomial Interpretations over the Naturals 16:30‑17:00 Sarah Winkler and Aart Middeldorp Termination Tools in Ordered Completion 17:00‑17:30 Albert Rubio Results of the Termination 2010 System Competition 17:30‑18:00 Maria Paola Bonacina (Master of Ceremony) Presentation of the Herbrand Award to David Plaisted