Accepted Papers
The list of accepted papers is also available with abstracts.
- Petr Cintula, Denisa Diaconescu and George Metcalfe. Skolemization for Substructural Logics (details)
- Miika Hannula. Reasoning about embedded dependencies using inclusion dependencies (details)
- Miroslav Klimos and Antonin Kucera. Cobra: A Tool for Solving General Deductive Games (details)
- Eric Gregoire and Jean Marie Lagniez. On Anti-Subsumptive Knowledge Enforcement (details)
- Luciano Bello, Daniel Hedin and Andrei Sabelfeld. Value Sensitivity and Observable Abstract Values for Information Flow Control (details)
- Souheib Baarir and Alexandre Duret-Lutz. SAT-based Minimization of Deterministic ω-Automata (details)
- Cezary Kaliszyk and Josef Urban. FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover (details)
- Gilles Dowek and Ying Jiang. Decidability, Introduction Rules and Automata (details)
- Adi Sosnovich, Orna Grumberg and Gabi Nakibly. Analyzing Internet Routing Security Using Model Checking (details)
- Alberto Lovato, Damiano Macedonio, Ciprian Spiridon, Fausto Spoto and Michael D. Ernst. Boolean Formulas for the Static Identification of Injection Attacks in Java (details)
- Kaustuv Chaudhuri and Giselle Reis. An adequate compositional encoding of bigraph structure in linear logic with subexponentials (details)
- Vojtech Forejt, Jan Krcal and Jan Kretinsky. Controller synthesis for MDPs and Frequency LTL\GU (details)
- Uwe Egly, Florian Lonsing and Johannes Oetsch. Automated Benchmarking of Incremental SAT and QBF Solvers (details)
- Shoshin Nomura, Katsuhiko Sano and Satoshi Tojo. A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic (details)
- Patrick Baillot, Gilles Barthe and Ugo Dal Lago. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (details)
- Dan Rosén and Nicholas Smallbone. TIP: Tools for Inductive Provers [tool paper] (details)
- Franck Cassez and Frowin Ziegler. Verification of Concurrent Programs Using Trace Abstraction Refinement (details)
- Yuya Uezato and Yasuhiko Minamide. Synchronized Recursive Timed Automata (details)
- Dale Miller and Marco Volpe. Focused labeled proof systems for modal logic (details)
- Sasha Rubin, Benjamin Aminof and Aniello Murano. On CTL* with Graded Path Modalities (details)
- Chuck Liang and Dale Miller. On Subexponentials, Synthetic Connectives, and Multi-Level Delimited Control (details)
- Florian Zuleger, Sasha Rubin and Benjamin Aminof. On the expressive power of communication primitives in parameterised systems (details)
- Alexander Steen and Christoph Benzmüller. There Is No Best Beta-Normalization Strategy for Higher-Order Reasoners (details)
- Liana Hadarean, Clark Barrett, Morgan Deters, Cesare Tinelli and Andrew Reynolds. Fine grained SMT proofs for the theory of fixed-width bit-vectors (details)
- Arlen Cox, Bor-Yuh Evan Chang, Huisong Li and Xavier Rival. Abstract Domains and Solvers for Sets Reasoning (details)
- Thibault Gauthier and Cezary Kaliszyk. Sharing HOL4 and HOL Light proof knowledge (details)
- Gilles Barthe, Thomas Espitau, Benjamin Gregoire, Justin Hsu, Léo Stefanesco and Pierre-Yves Strub. Relational reasoning via probabilistic coupling (details)
- Peter Brottveit Bock and Carsten Schürmann. A Contextual Logical Framework (details)
- Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly and Martina Seidl. Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination (details)
- Simon Robillard, Laura Kovacs and Wolfgang Ahrendt. Reasoning About Loops Using Vampire in KeY (details)
- Marijn Heule and Armin Biere. Compositional Propositional Proofs (details)
- Cvetan Dunchev, Ferruccio Guidi, Claudio Sacerdoti Coen and Enrico Tassi. A Fast Interpreter for λProlog (details)
- Olivier Hermant and Gaetan Gilbert. Normalization by Completeness with Heyting Algebras (details)
- Cristina David, Daniel Kroening and Matt Lewis. Using Program Synthesis for Program Analysis (details)
- Temesghen Kahsai, Jorge A Navas, Dejan Jovanović and Martin Schaef. Finding Inconsistencies in Programs with Loops (details)
- Iliano Cervesato and Edmund Soon Lee Lam. Modular Multiset Rewriting (details)
- Fiona Berreby, Gauvain Bourgne and Ganascia Jean-Gabriel. Modelling Moral Reasoning and Ethical Responsibility with Logic Programming (details)
- Cynthia Kop and Naoki Nishida. ConsTrained Rewriting tooL (details)
- Elaine Pimentel and Björn Lellmann. Proof Search in Nested Sequent Calculi (details)
- Thinh Dong, Chan Le Duc, Philippe Bonnot and Myriam Lamolle. Tableau-based Revision over SHIQ TBoxes (details)
- Daniel Fava, Matthieu Lemerre, Julien Signoles, Martin Schäf and Ashish Tiwari. Gamifying Program Analysis (details)
- Grigory Fedyukovich, Arie Gurfinkel and Natasha Sharygina. Automated Discovery of Simulation Between Programs (details)
- Koen Claessen. SAT modulo intuitionistic implications (details)