LPAR22: Author IndexAuthor  Papers 

A  Agarwal, Palak  Parse Condition: Symbolic Encoding of LL(1) Parsing  Alevizos, Elias  Wayeb: a Tool for Complex Event Forecasting  AparicioSánchez, Damián  Formal veriﬁcation of the YubiKey and YubiHSM APIs in MaudeNPA  Apt, Krzysztof  When Are Two Gossips the Same?  Areces, Carlos  Reasoning About Prescription and Description Using Prioritized Default Rules  Artikis, Alexander  Wayeb: a Tool for Complex Event Forecasting  Asadi, Sepideh  Function Summarization Modulo Theories  B  Baader, Franz  Matching in the Description Logic FL0 with respect to General TBoxes  Baaz, Matthias  Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic  Bardin, Sébastien  Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing  Bauer, Sabine  Decidable Inequalities over Infinite Trees  Bendík, Jaroslav  Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets  Bickford, Mark  A Verified Theorem Prover Backend Supported by a Monotonic Library  Biewer, Sebastian  Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions  Blicha, Martin  Function Summarization Modulo Theories  Boker, Udi  Why These Automata Types?  Bottesch, Ralph  A Verified Efficient Implementation of the LLL Basis Reduction Algorithm  Boudane, Abdelhamid  Efficient SATBased Encodings of Conditional Cardinality Constraints  C  Cassano, Valentin  Reasoning About Prescription and Description Using Prioritized Default Rules  Castro, Pablo  Reasoning About Prescription and Description Using Prioritized Default Rules  Cerna, Ivana  Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets  Charatonik, Witold  Twovariable FirstOrder Logic with Counting in Forests  Chatterjee, Krishnendu  Quasipolynomial SetBased Symbolic Algorithms for Parity Games  Chockler, Hana  Function Summarization Modulo Theories LookaheadBased SMT Solving  Ciaffaglione, Alberto  The involutionsasprincipal types/applicationasunification Analogy  Ciardo, Gianfranco  Improving SATbased Bounded Model Checking for Existential CTL through Path Reuse  Ciesielski, Maciej  Rewriting Environment for Arithmetic Circuit Verification  Cohen, Liron  A Verified Theorem Prover Backend Supported by a Monotonic Library  D  D'Argenio, Pedro R.  Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions  Das, Anupam  LeftHanded Completeness for Kleene algebra, via Cyclic Proofs  David, Robin  Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing  Davy, Guillaume  Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm  Dershowitz, Nachum  Graph Path Orderings  Dietz, EmmanuelleAnna  The Weak Completion Semantics and Equality  Doumane, Amina  LeftHanded Completeness for Kleene algebra, via Cyclic Proofs  Dvořák, Wolfgang  Quasipolynomial SetBased Symbolic Algorithms for Parity Games  E  Escobar, Santiago  Formal veriﬁcation of the YubiKey and YubiHSM APIs in MaudeNPA  EvenMendoza, Karine  Function Summarization Modulo Theories  F  Faran, Rachel  LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems  Farinier, Benjamin  Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing  Fedyukovich, Grigory  Function Summarization Modulo Theories  Fernandez Gil, Oliver  Matching in the Description Logic FL0 with respect to General TBoxes  Feron, Eric  Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm  G  Garoche, PierreLoic  Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm  Gleiss, Bernhard  Loop Analysis by Quantification over Iterations  GonzálezBurgueño, Antonio  Formal veriﬁcation of the YubiKey and YubiHSM APIs in MaudeNPA  Grossi, Davide  When Are Two Gossips the Same?  Gupta, Rahul  Knowledge Compilation meets Uniform Sampling  Guskov, Yegor  Twovariable FirstOrder Logic with Counting in Forests  H  Haslbeck, Max W.  A Verified Efficient Implementation of the LLL Basis Reduction Algorithm  Henrion, Didier  Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm  Henzinger, Monika  Quasipolynomial SetBased Symbolic Algorithms for Parity Games  Hermanns, Holger  Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions  Hoffmann, Jan  Automatic Space Bound Analysis for Functional Programs with Garbage Collection  Hofmann, Martin  Decidable Inequalities over Infinite Trees  Honsell, Furio  The involutionsasprincipal types/applicationasunification Analogy  Hyvärinen, Antti  Function Summarization Modulo Theories LookaheadBased SMT Solving SMTS: Distributed, Visualized Constraint Solving  Hölldobler, Steffen  The Weak Completion Semantics and Equality  I  Iosif, Radu  A Complete Cyclic Proof System for Inductive Entailments in First Order Logic  J  Jabbour, Said  Efficient SATBased Encodings of Conditional Cardinality Constraints  Janota, Mikolas  Towards Smarter MACEstyle Model Finders  Jhunjhunwala, Saket  Parse Condition: Symbolic Encoding of LL(1) Parsing  Jiang, Chuan  Improving SATbased Bounded Model Checking for Existential CTL through Path Reuse  Jonáš, Martin  Is Satisfiability of Quantified BitVector Formulas Stable Under BitWidth Changes? (Experimental Paper)  Jost, Steffen  Decidable Inequalities over Infinite Trees  Jouannaud, JeanPierre  Graph Path Orderings  K  Kovács, Laura  Loop Analysis by Quantification over Iterations  Kupferman, Orna  Playing with the MaximumFlow Problem LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems Alternating Reachability Games with Behavioral and Revenue Objectives  Köhl, Maximilian A.  Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions  L  Lemerre, Matthieu  Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing  Lenisa, Marina  The involutionsasprincipal types/applicationasunification Analogy  Lolic, Anela  Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic  LópezFraguas, Francisco J.  Polymorphic success types for Erlang  M  Marantidis, Pavlos  Matching in the Description Logic FL0 with respect to General TBoxes  Marescotti, Matteo  LookaheadBased SMT Solving SMTS: Distributed, Visualized Constraint Solving  Meadows, Catherine  Formal veriﬁcation of the YubiKey and YubiHSM APIs in MaudeNPA  Meel, Kuldeep S.  Knowledge Compilation meets Uniform Sampling  Meseguer, José  Formal veriﬁcation of the YubiKey and YubiHSM APIs in MaudeNPA  Mishchenko, Alan  Rewriting Environment for Arithmetic Circuit Verification  Montenegro, Manuel  Polymorphic success types for Erlang  N  Niu, Yue  Automatic Space Bound Analysis for Functional Programs with Garbage Collection  P  Paliouras, Georgios  Wayeb: a Tool for Complex Event Forecasting  Pous, Damien  LeftHanded Completeness for Kleene algebra, via Cyclic Proofs  PrattHartmann, Ian  Twovariable FirstOrder Logic with Counting in Forests  R  Raddaoui, Badran  Efficient SATBased Encodings of Conditional Cardinality Constraints  Rahli, Vincent  A Verified Theorem Prover Backend Supported by a Monotonic Library  RebolaPardo, Adrián  A Theory of SatisfiabilityPreserving Proofs in SAT Solving  Robillard, Simon  Loop Analysis by Quantification over Iterations  Roy, Subhajit  Knowledge Compilation meets Uniform Sampling Parse Condition: Symbolic Encoding of LL(1) Parsing  Rudolph, Sebastian  The Triguarded Fragment of FirstOrder Logic  S  Sadigova, Parvin  LookaheadBased SMT Solving  Sais, Lakhdar  Efficient SATBased Encodings of Conditional Cardinality Constraints  Scagnetto, Ivan  The involutionsasprincipal types/applicationasunification Analogy  Schwarz, Sibylle  The Weak Completion Semantics and Equality  Serban, Cristina  A Complete Cyclic Proof System for Inductive Entailments in First Order Logic  Sharma, Shubham  Knowledge Compilation meets Uniform Sampling  Sharygina, Natasha  Function Summarization Modulo Theories LookaheadBased SMT Solving SMTS: Distributed, Visualized Constraint Solving  Simkus, Mantas  The Triguarded Fragment of FirstOrder Logic  Singal, Dhruv  Parse Condition: Symbolic Encoding of LL(1) Parsing  Stefanus, L. Yohanes  The Weak Completion Semantics and Equality  Strejček, Jan  Is Satisfiability of Quantified BitVector Formulas Stable Under BitWidth Changes? (Experimental Paper)  Su, Tiankai  Rewriting Environment for Arithmetic Circuit Verification  Suda, Martin  Towards Smarter MACEstyle Model Finders A Theory of SatisfiabilityPreserving Proofs in SAT Solving  SuárezGarcía, Gorka  Polymorphic success types for Erlang  Svozil, Alexander  Quasipolynomial SetBased Symbolic Algorithms for Parity Games  T  Tamir, Tami  Alternating Reachability Games with Behavioral and Revenue Objectives  Thiemann, René  A Verified Efficient Implementation of the LLL Basis Reduction Algorithm  v  van der Hoek, Wiebe  When Are Two Gossips the Same?  W  Witkowski, Piotr  Twovariable FirstOrder Logic with Counting in Forests  Y  Yasin, Atif  Rewriting Environment for Arithmetic Circuit Verification  Yu, Cunxi  Rewriting Environment for Arithmetic Circuit Verification 

