![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
SMT 2021: Virtual Event
- Alexander Nadel, Aina Niemetz:
Proceedings of the 19th International Workshop on Satisfiability Modulo Theories co-located with 33rd International Conference on Computer Aided Verification(CAV 2021), Online (initially located in Los Angeles, USA), July 18-19, 2021. CEUR Workshop Proceedings 2908, CEUR-WS.org 2021 - Guy Katz:
Invited Talk: Using SMT and Abstraction-Refinement for Neural Network Verification. 1 - Karem A. Sakallah:
Invited Talk: AVR: Word-Level Verification by Equality Abstraction of Data State. 2 - Elisabeth Henkel, Jochen Hoenicke, Tanja Schindler:
Proof Tree Preserving Sequence Interpolation of Quantified Formulas in the Theory of Equality. 3-16 - Chad E. Brown, Mikolás Janota:
First-Order Instantiation using Discriminating Terms. 17-22 - Martin Brain:
Further Steps Down The Wrong Path: Improving the Bit-Blasting of Multiplication. 23-31 - Guillaume Bury:
Dolmen: A Validator for SMT-LIB and Much More. 32-39 - José Abel Castellanos Joo, Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
AXDInterpolator: A Tool for Computing Interpolants for Arrays with MaxDiff. 40-52 - Jan Jakubuv, Mikolás Janota, Andrew Reynolds:
Characteristic Subsets of SMT-LIB Benchmarks. 53-63 - Hans-Jörg Schurr, Mathias Fleury, Martin Desharnais:
Abstract: Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant. 64 - Fabian Zaiser, Luke Ong:
Abstract: The Extended Theory of Trees and Algebraic (Co)datatypes. 65
![](https://dblp.org/img/cog.dark.24x24.png)
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.