Author:
Reynolds Andrew,Barbosa Haniel,Fontaine Pascal
Publisher
Springer International Publishing
Reference34 articles.
1. Alur, R., Bodík, R., Juniwal, G., Martin, M.M.K., Raghothaman, M., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-guided synthesis. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 1–8. IEEE (2013)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1998)
3. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, pp. 19–99 (2001)
4. Barbosa, H.: New techniques for instantiation and proof production in SMT solving. Ph.D. thesis, Université de Lorraine, Universidade Federal do Rio Grande do Norte (2017)
5. Lecture Notes in Computer Science;H Barbosa,2017
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Encoding TLA+ proof obligations safely for SMT;Science of Computer Programming;2025-01
2. Satisfiability Modulo Theories: A Beginner’s Tutorial;Lecture Notes in Computer Science;2024-09-13
3. Solving Hard Mizar Problems with Instantiation and Strategy Invention;Lecture Notes in Computer Science;2024
4. State Merging with Quantifiers in Symbolic Execution;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30
5. Towards Learning Infinite SMT Models (Work in Progress);2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11