Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 135 matches
- 2023
- Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown:
Exploiting Strict Constraints in the Cylindrical Algebraic Covering. SMT 2023: 33-45 - Romain Béguet, Raphaël Amiard:
Application of SMT in a Meta-Compiler: A Logic DSL for Specifying Type Systems. SMT 2023: 46-61 - Guillaume Bury, François Bobot:
Verifying Models with Dolmen. SMT 2023: 62-70 - Jan Jakubuv, Mikolás Janota, Bartosz Piotrowski, Jelle Piepenbrock, Andrew Reynolds:
Selecting Quantifiers for Instantiation in SMT. SMT 2023: 71-77 - Hanna Lachnitt, Mathias Fleury, Leni Aniva, Andrew Reynolds, Haniel Barbosa, Andres Nötzli, Clark W. Barrett, Cesare Tinelli:
Automatic Verification of SMT Rewrites in Isabelle/HOL. SMT 2023: 78 - Christopher Lynch, Stephen Miner:
Complete Trigger Selection in Satisfiability Modulo First-Order Theories. SMT 2023: 18-32 - Oded Padon:
Invited Talk: Deductive Verification of Distributed Protocols in Decidable Logics. SMT 2023: 1 - Fatemeh Heidari Soureshjani, Mathias Hall-Andersen, MohammadMahdi Jahanara, Jeffrey Kam, Jan Gorzny, Mohsen Ahmadvand:
Automated Analysis of Halo2 Circuits. SMT 2023: 3-17 - Michael Whalen:
Invited Talk: SAT and SMT Solving at Cloud Scale. SMT 2023: 2 - Stéphane Graham-Lengrand, Mathias Preiner:
Proceedings of the 21st International Workshop on Satisfiability Modulo Theories (SMT 2023) co-located with the 29th International Conference on Automated Deduction (CADE 2023), Rome, Italy, July, 5-6, 2023. CEUR Workshop Proceedings 3429, CEUR-WS.org 2023 [contents] - 2022
- Milan Bankovic, David Scepanovic:
Trail Saving in SMT. SMT 2022: 2-17 - Nikolaj S. Bjørner, Clemens Eisenhofer, Laura Kovács:
User-Propagators for Custom Theories in SMT Solving. SMT 2022: 71-79 - Maria Paola Bonacina, Stéphane Graham-Lengrand, Natarajan Shankar:
CDSAT for Nondisjoint Theories with Shared Predicates: Arrays With Abstract Length. SMT 2022: 18-37 - Chad E. Brown, Mikolás Janota, Cezary Kaliszyk:
Abstract: Challenges and Solutions for Higher-Order SMT Proofs. SMT 2022: 128 - Alessandro Cimatti, Alberto Griggio, Stefano Tonetta:
The VMT-LIB Language and Tools. SMT 2022: 80-89 - Zafer Esen, Philipp Rümmer:
An SMT-LIB Theory of Heaps. SMT 2022: 38-53 - Thomas Hader, Laura Kovács:
An SMT Approach for Solving Polynomials over Finite Fields. SMT 2022: 90-98 - Jochen Hoenicke, Tanja Schindler:
A Simple Proof Format for SMT. SMT 2022: 54-70 - Aina Niemetz:
Invited Talk: Local Search for Bit-Precise Reasoning and Beyond. SMT 2022: 1 - Joseph Scott, Guanting Pan, Elias B. Khalil, Vijay Ganesh:
Goose: A Meta-Solver for Deep Neural Network Verification. SMT 2022: 99-113 - Lucas Clemente Vella, Leonardo Alt:
On Satisfiability of Polynomial Equations over Large Prime Fields. SMT 2022: 114-127 - David Déharbe, Antti E. J. Hyvärinen:
Proceedings of the 20th Internal Workshop on Satisfiability Modulo Theories co-located with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022) part of the 8th Federated Logic Conference (FLoC 2022), Haifa, Israel, August 11-12, 2022. CEUR Workshop Proceedings 3185, CEUR-WS.org 2022 [contents] - 2021
- Martin Brain:
Further Steps Down The Wrong Path: Improving the Bit-Blasting of Multiplication. SMT 2021: 23-31 - Chad E. Brown, Mikolás Janota:
First-Order Instantiation using Discriminating Terms. SMT 2021: 17-22 - Guillaume Bury:
Dolmen: A Validator for SMT-LIB and Much More. SMT 2021: 32-39 - Elisabeth Henkel, Jochen Hoenicke, Tanja Schindler:
Proof Tree Preserving Sequence Interpolation of Quantified Formulas in the Theory of Equality. SMT 2021: 3-16 - Jan Jakubuv, Mikolás Janota, Andrew Reynolds:
Characteristic Subsets of SMT-LIB Benchmarks. SMT 2021: 53-63 - José Abel Castellanos Joo, Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
AXDInterpolator: A Tool for Computing Interpolants for Arrays with MaxDiff. SMT 2021: 40-52 - Guy Katz:
Invited Talk: Using SMT and Abstraction-Refinement for Neural Network Verification. SMT 2021: 1 - Karem A. Sakallah:
Invited Talk: AVR: Word-Level Verification by Equality Abstraction of Data State. SMT 2021: 2
skipping 105 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-05 03:24 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint