default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd LPAR 2018: Awassa, Ethiopia
- Gilles Barthe, Geoff Sutcliffe, Margus Veanes:
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018. EPiC Series in Computing 57, EasyChair 2018 - Holger Hermanns
, Sebastian Biewer, Pedro R. D'Argenio, Maximilian A. Köhl:
Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions. 1-17 - Orna Kupferman:
Playing with the Maximum-Flow Problem. 18-25 - Elias Alevizos, Alexander Artikis, Georgios Paliouras:
Wayeb: a Tool for Complex Event Forecasting. 26-35 - Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek:
When Are Two Gossips the Same? 36-55 - Sepideh Asadi, Martin Blicha, Grigory Fedyukovich, Antti E. J. Hyvärinen, Karine Even-Mendoza, Natasha Sharygina, Hana Chockler:
Function Summarization Modulo Theories. 56-75 - Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis:
Matching in the Description Logic FL0 with respect to General TBoxes. 76-94 - Matthias Baaz, Anela Lolic:
Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic. 95-110 - Sabine Bauer, Steffen Jost, Martin Hofmann:
Decidable Inequalities over Infinite Trees. 111-130 - Jaroslav Bendík, Ivana Cerna:
Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets. 131-142 - Udi Boker:
Why These Automata Types? 143-163 - Ralph Bottesch, Max W. Haslbeck, René Thiemann:
A Verified Efficient Implementation of the LLL Basis Reduction Algorithm. 164-180 - Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Efficient SAT-Based Encodings of Conditional Cardinality Constraints. 181-195 - Valentin Cassano, Carlos Areces, Pablo F. Castro:
Reasoning About Prescription and Description Using Prioritized Default Rules. 196-213 - Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski:
Two-variable First-Order Logic with Counting in Forests. 214-232 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. 233-253 - Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto:
The involutions-as-principal types/application-as-unification Analogy. 254-270 - Anupam Das, Amina Doumane, Damien Pous:
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. 271-289 - Guillaume Davy, Eric Feron, Pierre-Loïc Garoche, Didier Henrion:
Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm. 290-306 - Nachum Dershowitz, Jean-Pierre Jouannaud:
Graph Path Orderings. 307-325 - Emmanuelle-Anna Dietz, Steffen Hölldobler, Sibylle Schwarz, L. Yohanes Stefanus:
The Weak Completion Semantics and Equality. 326-342 - Rachel Faran, Orna Kupferman:
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems. 343-362 - Benjamin Farinier, Robin David, Sébastien Bardin, Matthieu Lemerre:
Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing. 363-380 - Bernhard Gleiss, Laura Kovács, Simon Robillard:
Loop Analysis by Quantification over Iterations. 381-399 - Antonio González-Burgueño, Damián Aparicio-Sánchez, Santiago Escobar, Catherine Meadows, José Meseguer:
Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA. 400-417 - Antti E. J. Hyvärinen, Matteo Marescotti, Parvin Sadigova, Hana Chockler, Natasha Sharygina:
Lookahead-Based SMT Solving. 418-434 - Radu Iosif, Cristina Serban:
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic. 435-453 - Mikolas Janota, Martin Suda:
Towards Smarter MACE-style Model Finders. 454-470 - Chuan Jiang, Gianfranco Ciardo:
Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse. 471-487 - Martin Jonás, Jan Strejcek:
Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes? (Experimental Paper). 488-497 - Orna Kupferman, Tami Tamir:
Alternating Reachability Games with Behavioral and Revenue Objectives. 498-514 - Francisco Javier López-Fraguas, Manuel Montenegro, Gorka Suárez-García:
Polymorphic success types for Erlang. 515-533 - Matteo Marescotti, Antti E. J. Hyvärinen, Natasha Sharygina:
SMTS: Distributed, Visualized Constraint Solving. 534-542 - Yue Niu, Jan Hoffmann:
Automatic Space Bound Analysis for Functional Programs with Garbage Collection. 543-563 - Vincent Rahli, Liron Cohen, Mark Bickford:
A Verified Theorem Prover Backend Supported by a Monotonic Library. 564-582 - Adrián Rebola-Pardo, Martin Suda:
A Theory of Satisfiability-Preserving Proofs in SAT Solving. 583-603 - Sebastian Rudolph, Mantas Simkus:
The Triguarded Fragment of First-Order Logic. 604-619 - Shubham Sharma, Rahul Gupta, Subhajit Roy, Kuldeep S. Meel:
Knowledge Compilation meets Uniform Sampling. 620-636 - Dhruv Singal, Palak Agarwal, Saket Jhunjhunwala, Subhajit Roy:
Parse Condition: Symbolic Encoding of LL(1) Parsing. 637-655 - Cunxi Yu, Atif Yasin, Tiankai Su, Alan Mishchenko, Maciej J. Ciesielski:
Rewriting Environment for Arithmetic Circuit Verification. 656-666
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
