LPAR23: Author Index

AuthorPapers
A
Adi, YossiMinimal Modifications of Deep Neural Networks using Verification
Alrabbaa, ChristianFinding Small Proofs for Description Logic Entailments: Theory and Practice
Aschieri, FedericoA typed parallel lambda-calculus via 1-depth intermediate proofs
B
Baader, FranzFinding Small Proofs for Description Logic Entailments: Theory and Practice
Baltag, AlexandruLearning What Others Know
Bartocci, EzioParameter Synthesis for Probabilistic Hyperproperties
Bendík, JaroslavRotation Based MSS/MCS Enumeration
Benhamou, BelaidAn ASP-based Approach for Boolean Networks Representation and Attractor Detection
Blaauwbroek, LasseTactic Learning and Proving for the Coq Proof Assistant
Bonakdarpour, BorzooParameter Synthesis for Probabilistic Hyperproperties
Boockmann, Jan H.Learning Data Structure Shapes from Memory Graphs
Borgwardt, StefanFinding Small Proofs for Description Logic Entailments: Theory and Practice
Budde, Carlos E.A compositional semantics for Repairable Fault Trees with general distributions
C
Cerna, IvanaRotation Based MSS/MCS Enumeration
Ciabattoni, AgataA typed parallel lambda-calculus via 1-depth intermediate proofs
D
D'Argenio, Pedro R.A compositional semantics for Repairable Fault Trees with general distributions
Dileep, A.Induction Models on $\mathbb{N}$
Dobe, OyendrilaParameter Synthesis for Probabilistic Hyperproperties
E
Echenim, MnachoEntailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
F
Fleury, MathiasA Verified SAT Solver Framework including Optimization and Partial Valuations
Frohn, FlorianPolynomial Loops: Beyond Termination
G
Gauthier, ThibaultDeep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
Genco, Francesco AntonioA typed parallel lambda-calculus via 1-depth intermediate proofs
Gengelbach, ArveA Mechanised Semantics for HOL with Ad-hoc Overloading
Geuvers, HermanTactic Learning and Proving for the Coq Proof Assistant
Giesl, JürgenPolynomial Loops: Beyond Termination
Glorian, GaelNACRE - A Nogood And Clause Reasoning Engine
Goldberger, BenMinimal Modifications of Deep Neural Networks using Verification
H
Hark, MarcelPolynomial Loops: Beyond Termination
Havlena, VojtěchAntiprenexing for WSkS: A Little Goes a Long Way
Heule, MarijnColoring Unit-Distance Strips using SAT
Sensitivity Analysis of Locked Circuits
Holik, LukasAntiprenexing for WSkS: A Little Goes a Long Way
I
Iosif, RaduEntailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
J
Järvisalo, MattiFinding Periodic Apartments via Boolean Satisfiability and Orderly Generation
K
Katelaan, JensBeyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions
Katz, GuyMinimal Modifications of Deep Neural Networks using Verification
Keshet, JosephMinimal Modifications of Deep Neural Networks using Verification
Khaled, TarekAn ASP-based Approach for Boolean Networks Representation and Attractor Detection
Kieronski, EmanuelThe Triguarded Fragment with Transitivity
Koopmann, PatrickFinding Small Proofs for Description Logic Entailments: Theory and Practice
Kovtunova, AlisaFinding Small Proofs for Description Logic Entailments: Theory and Practice
L
Lagniez, Jean MarieNACRE - A Nogood And Clause Reasoning Engine
Lecoutre, ChristopheNACRE - A Nogood And Clause Reasoning Engine
Lengal, OndrejAntiprenexing for WSkS: A Little Goes a Long Way
Lozano, AdriàDecision levels are stable: towards better SAT heuristics
Luettgen, GeraldLearning Data Structure Shapes from Memory Graphs
M
Malinowski, AdamThe Triguarded Fragment with Transitivity
Martins, RubenColoring Unit-Distance Strips using SAT
Meel, Kuldeep S.Induction Models on $\mathbb{N}$
Monti, Raúl E.A compositional semantics for Repairable Fault Trees with general distributions
N
Nieuwenhuis, RobertDecision levels are stable: towards better SAT heuristics
O
Oikarinen, EmiliaFinding Periodic Apartments via Boolean Satisfiability and Orderly Generation
Oliveras, AlbertDecision levels are stable: towards better SAT heuristics
Oostema, PeterColoring Unit-Distance Strips using SAT
P
Peltier, NicolasEntailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
Pileggi, LawrenceSensitivity Analysis of Locked Circuits
Piotrowski, BartoszStateful Premise Selection by Recurrent Neural Networks
R
Rebola-Pardo, AdriánRAT Elimination
Rodríguez-Carbonell, EnricDecision levels are stable: towards better SAT heuristics
S
Sabili, Ammar F.Induction Models on $\mathbb{N}$
Salhi, YakoubOn Reasoning about Access to Knowledge
Savela, JarkkoFinding Periodic Apartments via Boolean Satisfiability and Orderly Generation
Silva, AlexandraModels of Concurrent Kleene Algebra
Smets, SonjaLearning What Others Know
Sweeney, JosephSensitivity Analysis of Locked Circuits
U
Urban, JosefTactic Learning and Proving for the Coq Proof Assistant
Stateful Premise Selection by Recurrent Neural Networks
V
Vales, OndrejAntiprenexing for WSkS: A Little Goes a Long Way
Vojnar, TomasAntiprenexing for WSkS: A Little Goes a Long Way
W
Weidenbach, ChristophA Verified SAT Solver Framework including Optimization and Partial Valuations
Weissenbacher, GeorgRAT Elimination
Z
Zuleger, FlorianBeyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions
Á
Ábrahám, ErikaParameter Synthesis for Probabilistic Hyperproperties
Å
Åman Pohjola, JohannesA Mechanised Semantics for HOL with Ad-hoc Overloading