Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Hunt Jr, Warren"'
Publikováno v:
EPTCS 359, 2022, pp. 61-75
VWSIM is a circuit simulator for rapid, single-flux, quantum (RSFQ) circuits. The simulator is designed to model and simulate primitive-circuit devices such as capacitors, inductors, Josephson Junctions, and can be extended to simulate other circuit
Externí odkaz:
http://arxiv.org/abs/2205.11698
Autor:
Slobodova, Anna, Hunt Jr, Warren
Publikováno v:
EPTCS 249, 2017
This volume contains the proceedings of the Fourteenth International Workshop on the ACL2 Theorem Prover and Its Applications, ACL2 2017, a two-day workshop held in Austin, Texas, USA, on May 22-23, 2017. ACL2 workshops occur at approximately 18-mont
Externí odkaz:
http://arxiv.org/abs/1705.00766
Publikováno v:
EPTCS 192, 2015, pp. 35-51
We formalize some basic properties of Fourier series in the logic of ACL2(r), which is a variant of ACL2 that supports reasoning about the real and complex numbers by way of non-standard analysis. More specifically, we extend a framework for formally
Externí odkaz:
http://arxiv.org/abs/1509.06087
Publikováno v:
EPTCS 114, 2013, pp. 54-69
We introduce a new ACL2 feature, the abstract stobj, and show how to apply it to modeling the instruction set architecture of a microprocessor. Benefits of abstract stobjs over traditional ("concrete") stobjs can include faster execution, support for
Externí odkaz:
http://arxiv.org/abs/1304.7858
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Cruz-Filipe, L, Heule, M, Hunt, Jr, W, Kaufmann, M & Schneider-Kamp, P 2017, Efficient Certified RAT Verification . in L de Moura (ed.), Automated Deduction-CADE 26 : Proceedings of the 26th International Conference on Automated Deduction . Springer, Lecture Notes in Computer Science, vol. 10395, pp. 220-236, 26th International Conference on Automated Deduction, Gothenburg, Sweden, 06/08/2017 . https://doi.org/10.1007/978-3-319-63046-5_14
Clausal proofs have become a popular approach to validate the results of SAT solvers. However, validating clausal proofs in the most widely supported format (DRAT) is expensive even in highly optimized implementations. We present a new format, called
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3062::7eb7d9bc05f1df7552e2c5d23dc01e19
https://findresearcher.sdu.dk:8443/ws/files/141252237/Efficient_Certified_RAT_Verification.pdf
https://findresearcher.sdu.dk:8443/ws/files/141252237/Efficient_Certified_RAT_Verification.pdf
Publikováno v:
Philosophical Transactions of the Royal Society A: Mathematical, Physical & Engineering Sciences; 10/13/2017, Vol. 375 Issue 2104, p1-20, 20p
Publikováno v:
Automated Deduction - CADE-25; 2015, p591-606, 16p
Publikováno v:
Theory & Applications of Satisfiability Testing - SAT 2014; 2014, p422-429, 8p
Autor:
Goel, Shilpi, Hunt Jr., Warren A.
Publikováno v:
Verified Software: Theories, Tools, Experiments: 5th International Conference, VSTTE 2013, Menlo Park, CA, USA, May 17-19, 2013, Revised Selected Papers; 2014, p222-241, 20p