LPAR 2024: Author Index| Author | Papers |
|---|
| A | | Akshay, S. | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers | | Aleksandrova, Kristina | Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery | | B | | Baaz, Matthias | On Translations of Epsilon Proofs to LK | | Barenbaum, Pablo | Hybrid Intersection Types for PCF | | Barrett, Clark | Verifying SQL queries using theories of tables and relations | | Baumgartner, Peter | Automated Theorem Provers Help Improve Large Language Model Reasoning | | Biere, Armin | Certifying Incremental SAT Solving | | Blanqui, Frédéric | Translating HOL-Light proofs to Coq | | Bonichon, Richard | A Generic Deskolemization Strategy | | Bromberger, Martin | Automatic Bit- and Memory-Precise Verification of eBPF Code | | Brown, Chad | Experiments with Choice in Dependently-Typed Higher-Order Logic | | Brugger, Lea Salome | Scaling CheckMate for Game-Theoretic Security | | C | | Cailler, Julie | A Generic Deskolemization Strategy | | Chakraborty, Supratik | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers | | Chimes, Mark | Tree-Verifiable Graph Grammars | | Cruz-Filipe, Luís | Minimizing Sorting Networks at the Sub-Comparator Level | | F | | Fazekas, Katalin | Certifying Incremental SAT Solving | | Fermüller, Christian | Reasoning About Group Polarization: From Semantic Games to Sequent Systems A Simple Token Game and its Logic | | Fleury, Mathias | Certifying Incremental SAT Solving | | Freiman, Robert | Reasoning About Group Polarization: From Semantic Games to Sequent Systems A Simple Token Game and its Logic | | G | | Georgiou, Pamina | Saturating Sorting without Sorts | | Gottlob, Georg | Fuzzy Datalog∃ over Arbitrary t-Norms | | Govind, R. | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers | | Guerrieri, Giulio | Confluence for Proof-Nets via Parallel Cut Elimination | | Gurfinkel, Arie | Efficient Simulation for Hardware Model Checking | | H | | Hajdu, Márton | Saturating Sorting without Sorts Rewriting and Inductive Reasoning | | Hennicker, Rolf | Symbolic Realisation of Epistemic Processes | | Hermant, Olivier | A Generic Deskolemization Strategy | | Hunter, Aaron | A Tool for Reasoning about Trust and Belief | | I | | Iglesias, Alberto | A Tool for Reasoning about Trust and Belief | | Iosif, Radu | Tree-Verifiable Graph Grammars | | J | | Jakubův, Jan | First Experiments with Neural cvc5 Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery | | Janota, Mikoláš | First Experiments with Neural cvc5 | | K | | Kafshdar Goharshady, Amir | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers | | Kahramanogullari, Ozan | Deep Inference in Proof Search: The Need for Shallow Inference | | Kaliszyk, Cezary | Experiments with Choice in Dependently-Typed Higher-Order Logic Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery | | Kesner, Delia | Hybrid Intersection Types for PCF | | Knapp, Alexander | Symbolic Realisation of Epistemic Processes | | Korovin, Konstantin | VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic | | Kovács, Laura | Saturating Sorting without Sorts VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic Scaling CheckMate for Game-Theoretic Security Rewriting and Inductive Reasoning | | L | | Lang, Timo | A Simple Token Game and its Logic | | Lanzinger, Matthias | Fuzzy Datalog∃ over Arbitrary t-Norms | | Leitsch, Alexander | Herbrand's Theorem in Inductive Proofs | | Lolic, Anela | On Translations of Epsilon Proofs to LK Herbrand's Theorem in Inductive Proofs | | M | | Manara, Giulia | Confluence for Proof-Nets via Parallel Cut Elimination | | McGinness, Lachlan | Automated Theorem Provers Help Improve Large Language Model Reasoning | | Milicich, Mariana | Hybrid Intersection Types for PCF | | Miné, Antoine | Automatic Detection of Vulnerable Variables for CTL Properties of Programs | | Mohamed, Mudathir Mahgoub Yahia | Verifying SQL queries using theories of tables and relations | | Motwani, Harshit Jitendra | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers | | Moussaoui Remil, Naïm | Automatic Detection of Vulnerable Variables for CTL Properties of Programs | | O | | Olarte, Carlos | Reasoning About Group Polarization: From Semantic Games to Sequent Systems | | P | | Petković Komel, Anja | Scaling CheckMate for Game-Theoretic Security | | Piepenbrock, Jelle | First Experiments with Neural cvc5 | | Pimentel, Elaine | Reasoning About Group Polarization: From Semantic Games to Sequent Systems | | Pollitt, Florian | Certifying Incremental SAT Solving | | R | | Rain, Sophie | Scaling CheckMate for Game-Theoretic Security | | Ranalter, Daniel | Experiments with Choice in Dependently-Typed Higher-Order Logic | | Rawson, Michael | Scaling CheckMate for Game-Theoretic Security Rewriting and Inductive Reasoning | | Reynolds, Andrew | Verifying SQL queries using theories of tables and relations | | Rosain, Johann | A Generic Deskolemization Strategy | | S | | Schneider-Kamp, Peter | Minimizing Sorting Networks at the Sub-Comparator Level | | Schoisswohl, Johannes | VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic | | Schwarz, Simon | Automatic Bit- and Memory-Precise Verification of eBPF Code | | Sferrazza, Stefano | Fuzzy Datalog∃ over Arbitrary t-Norms | | Subercaseaux, Bernardo | Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition | | T | | Tafese, Joseph | Efficient Simulation for Hardware Model Checking | | Tammet, Tanel | Waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper) | | Tinelli, Cesare | Verifying SQL queries using theories of tables and relations | | Toledo, Guilherme | Combining Combination Properties: Minimal Models | | Tortora de Falco, Lorenzo | Confluence for Proof-Nets via Parallel Cut Elimination | | U | | Urban, Caterina | Automatic Detection of Vulnerable Variables for CTL Properties of Programs | | Urban, Josef | First Experiments with Neural cvc5 | | V | | Varanasi, Sai Teja | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers | | Vaux Auclair, Lionel | Confluence for Proof-Nets via Parallel Cut Elimination | | W | | Wałęga, Przemysław Andrzej | Fuzzy Datalog∃ over Arbitrary t-Norms | | Weidenbach, Christoph | Automatic Bit- and Memory-Precise Verification of eBPF Code | | Wirsing, Martin | Symbolic Realisation of Epistemic Processes | | Z | | Zohar, Yoni | Combining Combination Properties: Minimal Models | | Zuleger, Florian | Tree-Verifiable Graph Grammars |
|
|