LPAR23: Author Index| Author | Papers |
|---|
| A | | Adi, Yossi | Minimal Modifications of Deep Neural Networks using Verification | | Alrabbaa, Christian | Finding Small Proofs for Description Logic Entailments: Theory and Practice | | Aschieri, Federico | A typed parallel lambda-calculus via 1-depth intermediate proofs | | B | | Baader, Franz | Finding Small Proofs for Description Logic Entailments: Theory and Practice | | Baltag, Alexandru | Learning What Others Know | | Bartocci, Ezio | Parameter Synthesis for Probabilistic Hyperproperties | | Bendík, Jaroslav | Rotation Based MSS/MCS Enumeration | | Benhamou, Belaid | An ASP-based Approach for Boolean Networks Representation and Attractor Detection | | Blaauwbroek, Lasse | Tactic Learning and Proving for the Coq Proof Assistant | | Bonakdarpour, Borzoo | Parameter Synthesis for Probabilistic Hyperproperties | | Boockmann, Jan H. | Learning Data Structure Shapes from Memory Graphs | | Borgwardt, Stefan | Finding Small Proofs for Description Logic Entailments: Theory and Practice | | Budde, Carlos E. | A compositional semantics for Repairable Fault Trees with general distributions | | C | | Cerna, Ivana | Rotation Based MSS/MCS Enumeration | | Ciabattoni, Agata | A 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, Oyendrila | Parameter Synthesis for Probabilistic Hyperproperties | | E | | Echenim, Mnacho | Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard | | F | | Fleury, Mathias | A Verified SAT Solver Framework including Optimization and Partial Valuations | | Frohn, Florian | Polynomial Loops: Beyond Termination | | G | | Gauthier, Thibault | Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic | | Genco, Francesco Antonio | A typed parallel lambda-calculus via 1-depth intermediate proofs | | Gengelbach, Arve | A Mechanised Semantics for HOL with Ad-hoc Overloading | | Geuvers, Herman | Tactic Learning and Proving for the Coq Proof Assistant | | Giesl, Jürgen | Polynomial Loops: Beyond Termination | | Glorian, Gael | NACRE - A Nogood And Clause Reasoning Engine | | Goldberger, Ben | Minimal Modifications of Deep Neural Networks using Verification | | H | | Hark, Marcel | Polynomial Loops: Beyond Termination | | Havlena, Vojtěch | Antiprenexing for WSkS: A Little Goes a Long Way | | Heule, Marijn | Coloring Unit-Distance Strips using SAT
Sensitivity Analysis of Locked Circuits | | Holik, Lukas | Antiprenexing for WSkS: A Little Goes a Long Way | | I | | Iosif, Radu | Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard | | J | | Järvisalo, Matti | Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation | | K | | Katelaan, Jens | Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions | | Katz, Guy | Minimal Modifications of Deep Neural Networks using Verification | | Keshet, Joseph | Minimal Modifications of Deep Neural Networks using Verification | | Khaled, Tarek | An ASP-based Approach for Boolean Networks Representation and Attractor Detection | | Kieronski, Emanuel | The Triguarded Fragment with Transitivity | | Koopmann, Patrick | Finding Small Proofs for Description Logic Entailments: Theory and Practice | | Kovtunova, Alisa | Finding Small Proofs for Description Logic Entailments: Theory and Practice | | L | | Lagniez, Jean Marie | NACRE - A Nogood And Clause Reasoning Engine | | Lecoutre, Christophe | NACRE - A Nogood And Clause Reasoning Engine | | Lengal, Ondrej | Antiprenexing for WSkS: A Little Goes a Long Way | | Lozano, Adrià | Decision levels are stable: towards better SAT heuristics | | Luettgen, Gerald | Learning Data Structure Shapes from Memory Graphs | | M | | Malinowski, Adam | The Triguarded Fragment with Transitivity | | Martins, Ruben | Coloring 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, Robert | Decision levels are stable: towards better SAT heuristics | | O | | Oikarinen, Emilia | Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation | | Oliveras, Albert | Decision levels are stable: towards better SAT heuristics | | Oostema, Peter | Coloring Unit-Distance Strips using SAT | | P | | Peltier, Nicolas | Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard | | Pileggi, Lawrence | Sensitivity Analysis of Locked Circuits | | Piotrowski, Bartosz | Stateful Premise Selection by Recurrent Neural Networks | | R | | Rebola-Pardo, Adrián | RAT Elimination | | Rodríguez-Carbonell, Enric | Decision levels are stable: towards better SAT heuristics | | S | | Sabili, Ammar F. | Induction Models on $\mathbb{N}$ | | Salhi, Yakoub | On Reasoning about Access to Knowledge | | Savela, Jarkko | Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation | | Silva, Alexandra | Models of Concurrent Kleene Algebra | | Smets, Sonja | Learning What Others Know | | Sweeney, Joseph | Sensitivity Analysis of Locked Circuits | | U | | Urban, Josef | Tactic Learning and Proving for the Coq Proof Assistant
Stateful Premise Selection by Recurrent Neural Networks | | V | | Vales, Ondrej | Antiprenexing for WSkS: A Little Goes a Long Way | | Vojnar, Tomas | Antiprenexing for WSkS: A Little Goes a Long Way | | W | | Weidenbach, Christoph | A Verified SAT Solver Framework including Optimization and Partial Valuations | | Weissenbacher, Georg | RAT Elimination | | Z | | Zuleger, Florian | Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions | | Á | | Ábrahám, Erika | Parameter Synthesis for Probabilistic Hyperproperties | | Å | | Åman Pohjola, Johannes | A Mechanised Semantics for HOL with Ad-hoc Overloading |
|
|
