LPAR-20: 20TH INTERNATIONAL CONFERENCES ON LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE AND REASONING

A
Ahrendt, Wolfgang	Reasoning About Loops Using Vampire in KeY
Aminof, Benjamin	On the expressive power of communication primitives in parameterised systems On CTL* with Graded Path Modalities
Arhami, Negin	Automated Theorem Proving by Translation to Description Logic
B
Baarir, Souheib	SAT-based Minimization of Deterministic ω-Automata
Bacchus, Fahiem	Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
Baillot, Patrick	Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
Barrett, Clark	Fine grained SMT proofs for the theory of fixed-width bit-vectors
Barthe, Gilles	Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs Relational reasoning via probabilistic coupling
Bello, Luciano	Value Sensitivity and Observable Abstract Values for Information Flow Control
Benzmüller, Christoph	There Is No Best Beta-Normalization Strategy for Higher-Order Reasoners
Berreby, Fiona	Modelling Moral Reasoning and Ethical Responsibility with Logic Programming
Biere, Armin	Compositional Propositional Proofs Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
Bijorner, Nikolaj	Satisfiability: from Quality to Quantities Playing with Quantified Satisfaction On Conflicts and Strategies in QBF
Bock, Peter Brottveit	A Contextual Logical Framework
Bonnot, Philippe	Tableau-based Revision over SHIQ TBoxes
Bourgne, Gauvain	Modelling Moral Reasoning and Ethical Responsibility with Logic Programming
Broda, Krysia	Reasoning in the presence of inconsistency through Preferential ALC
Bury, Guillaume	Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
C
Cassez, Franck	Verification of Concurrent Programs Using Trace Abstraction Refinement
Cervesato, Iliano	Modular Multiset Rewriting
Chang, Bor-Yuh Evan	Abstract Domains and Solvers for Sets Reasoning
Chaudhuri, Kaustuv	An adequate compositional encoding of bigraph structure in linear logic with subexponentials
Cintula, Petr	Skolemization for Substructural Logics
Claessen, Koen	SAT modulo intuitionistic implications
Cox, Arlen	Abstract Domains and Solvers for Sets Reasoning
D
D'Antoni, Loris	Symbolic WS1S
Dal Lago, Ugo	Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
David, Cristina	Using Program Synthesis for Program Analysis
Deane, Graham	Reasoning in the presence of inconsistency through Preferential ALC
Delahaye, David	Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
Deters, Morgan	Fine grained SMT proofs for the theory of fixed-width bit-vectors
Diaconescu, Denisa	Skolemization for Substructural Logics
Doligez, Damien	Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
Dong, Thinh	Tableau-based Revision over SHIQ TBoxes
Dowek, Gilles	Decidability, Introduction Rules and Automata
Dunchev, Cvetan	A Fast Interpreter for λProlog
Duret-Lutz, Alexandre	SAT-based Minimization of Deterministic ω-Automata
E
Egly, Uwe	Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination Automated Benchmarking of Incremental SAT and QBF Solvers
Ernst, Michael D.	Boolean Formulas for the Static Identification of Injection Attacks in Java
Espitau, Thomas	Relational reasoning via probabilistic coupling
Estraillier, Pascal	Application of Trace-Based Subjective Logic to User Preferences Modeling
F
Fava, Daniel	Gamifying Program Analysis
Fedyukovich, Grigory	Automated Discovery of Simulation Between Programs
Forejt, Vojtech	Controller synthesis for MDPs and Frequency LTL\GU
G
Gauthier, Thibault	Sharing HOL4 and HOL Light proof knowledge
Gilbert, Frederic	A Lightweight Double-negation Translation
Gilbert, Gaetan	Normalization by Completeness with Heyting Algebras
Gregoire, Benjamin	Relational reasoning via probabilistic coupling
Gregoire, Eric	On Anti-Subsumptive Knowledge Enforcement
Grumberg, Orna	Analyzing Internet Routing Security Using Model Checking
Guidi, Ferruccio	A Fast Interpreter for λProlog
Gurfinkel, Arie	Automated Discovery of Simulation Between Programs
H
Hadarean, Liana	Fine grained SMT proofs for the theory of fixed-width bit-vectors
Halmagrand, Pierre	Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
Hannula, Miika	Reasoning about embedded dependencies using inclusion dependencies
Hedin, Daniel	Value Sensitivity and Observable Abstract Values for Information Flow Control
Hermant, Olivier	Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo Normalization by Completeness with Heyting Algebras
Heule, Marijn	Compositional Propositional Proofs
Ho, Hoang Nam	Application of Trace-Based Subjective Logic to User Preferences Modeling
Hsu, Justin	Relational reasoning via probabilistic coupling
J
Janota, Mikolas	Playing with Quantified Satisfaction On Conflicts and Strategies in QBF
Jean-Gabriel, Ganascia	Modelling Moral Reasoning and Ethical Responsibility with Logic Programming
Jiang, Ying	Decidability, Introduction Rules and Automata
Jovanović, Dejan	Finding Inconsistencies in Programs with Loops
K
Kahsai, Temesghen	Finding Inconsistencies in Programs with Loops
Kaliszyk, Cezary	Sharing HOL4 and HOL Light proof knowledge FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
Klein, Gerwin	Scaling Formal Software Verification
Klieber, William	On Conflicts and Strategies in QBF
Klimos, Miroslav	Cobra: A Tool for Solving General Deductive Games
Kop, Cynthia	ConsTrained Rewriting tooL
Kovacs, Laura	Reasoning About Loops Using Vampire in KeY
Krcal, Jan	Controller synthesis for MDPs and Frequency LTL\GU
Kretinsky, Jan	Controller synthesis for MDPs and Frequency LTL\GU
Kroening, Daniel	Using Program Synthesis for Program Analysis
Kucera, Antonin	Cobra: A Tool for Solving General Deductive Games
L
Lagniez, Jean Marie	On Anti-Subsumptive Knowledge Enforcement
Lam, Edmund Soon Lee	Modular Multiset Rewriting
Lamolle, Myriam	Tableau-based Revision over SHIQ TBoxes
Le Duc, Chan	Tableau-based Revision over SHIQ TBoxes
Leino, Rustan	Compiling Hilbert's epsilon operator
Lellmann, Björn	Proof Search in Nested Sequent Calculi
Lemerre, Matthieu	Gamifying Program Analysis
Lewis, Matt	Using Program Synthesis for Program Analysis
Li, Huisong	Abstract Domains and Solvers for Sets Reasoning
Liang, Chuck	On Subexponentials, Synthetic Connectives, and Multi-Level Delimited Control
Lonsing, Florian	Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination Automated Benchmarking of Incremental SAT and QBF Solvers
Lovato, Alberto	Boolean Formulas for the Static Identification of Injection Attacks in Java
M
Macedonio, Damiano	Boolean Formulas for the Static Identification of Injection Attacks in Java
Matsuoka, Satoshi	A New Proof of P-time Completeness of Linear Lambda Calculus
Metcalfe, George	Skolemization for Substructural Logics
Miller, Dale	On Subexponentials, Synthetic Connectives, and Multi-Level Delimited Control Focused labeled proof systems for modal logic
Minamide, Yasuhiko	Synchronized Recursive Timed Automata
Murano, Aniello	On CTL* with Graded Path Modalities
N
Nakibly, Gabi	Analyzing Internet Routing Security Using Model Checking
Navas, Jorge A	Finding Inconsistencies in Programs with Loops
Nishida, Naoki	ConsTrained Rewriting tooL
Nomura, Shoshin	A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic
Nowakowski, Samuel	Application of Trace-Based Subjective Logic to User Preferences Modeling
O
Oetsch, Johannes	Automated Benchmarking of Incremental SAT and QBF Solvers
P
Pimentel, Elaine	Proof Search in Nested Sequent Calculi
R
Rabah, Mourad	Application of Trace-Based Subjective Logic to User Preferences Modeling
Reis, Giselle	An adequate compositional encoding of bigraph structure in linear logic with subexponentials
Reynolds, Andrew	Fine grained SMT proofs for the theory of fixed-width bit-vectors
Rival, Xavier	Abstract Domains and Solvers for Sets Reasoning
Robillard, Simon	Reasoning About Loops Using Vampire in KeY
Rosén, Dan	SAT modulo intuitionistic implications TIP: Tools for Inductive Provers
Rubin, Sasha	On the expressive power of communication primitives in parameterised systems On CTL* with Graded Path Modalities
Russo, Alessandra	Reasoning in the presence of inconsistency through Preferential ALC
S
Sabelfeld, Andrei	Value Sensitivity and Observable Abstract Values for Information Flow Control
Sacerdoti Coen, Claudio	A Fast Interpreter for λProlog
Sano, Katsuhiko	A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic
Schäf, Martin	Gamifying Program Analysis Finding Inconsistencies in Programs with Loops
Schürmann, Carsten	A Contextual Logical Framework
Seidl, Martina	Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
Sharygina, Natasha	Automated Discovery of Simulation Between Programs
Signoles, Julien	Gamifying Program Analysis
Smallbone, Nicholas	TIP: Tools for Inductive Provers
Sosnovich, Adi	Analyzing Internet Routing Security Using Model Checking
Spiridon, Ciprian	Boolean Formulas for the Static Identification of Injection Attacks in Java
Spoto, Fausto	Boolean Formulas for the Static Identification of Injection Attacks in Java
Steen, Alexander	There Is No Best Beta-Normalization Strategy for Higher-Order Reasoners
Stefanesco, Léo	Relational reasoning via probabilistic coupling
Strub, Pierre-Yves	Relational reasoning via probabilistic coupling
Sutcliffe, Geoff	Automated Theorem Proving by Translation to Description Logic
T
Tassi, Enrico	A Fast Interpreter for λProlog
Tinelli, Cesare	Fine grained SMT proofs for the theory of fixed-width bit-vectors
Tiwari, Ashish	Gamifying Program Analysis
Tojo, Satoshi	A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic
U
Uezato, Yuya	Synchronized Recursive Timed Automata
Urban, Josef	FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
V
Veanes, Margus	Symbolic WS1S
Volpe, Marco	Focused labeled proof systems for modal logic
W
Wallace, Mark	Logic and Search
Z
Ziegler, Frowin	Verification of Concurrent Programs Using Trace Abstraction Refinement
Zuleger, Florian	On the expressive power of communication primitives in parameterised systems

Disclaimer | Powered by EasyChair Smart Program