Author:
Larraz Daniel,Rodríguez-Carbonell Enric,Rubio Albert
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Lecture Notes in Computer Science;M. Colón,2003
2. Borralleras, C., Lucas, S., Oliveras, A., Rodríguez-Carbonell, E., Rubio, A.: SAT Modulo Linear Arithmetic for Solving Polynomial Constraints. J. Autom. Reasoning 48(1), 107–131 (2012)
3. Schrijver, A.: Theory of Linear and Integer Programming. Wiley (June 1998)
4. Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints Among Variables of a Program. In: POPL, pp. 84–96 (1978)
5. Lecture Notes in Computer Science;M. Bofill,2008
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Demystifying Template-Based Invariant Generation for Bit-Vector Programs;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11
2. Lemmaless Induction in Trace Logic;Lecture Notes in Computer Science;2022
3. MCBAT: a practical tool for model counting constraints on bounded integer arrays;Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2020-11-07
4. MCBAT: Model Counting for Constraints over Bounded Integer Arrays;Lecture Notes in Computer Science;2020
5. Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers;ACM Transactions on Computational Logic;2019-10-31