Author:
Barrett Clark,Deters Morgan,de Moura Leonardo,Oliveras Albert,Stump Aaron
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference49 articles.
1. Barrett, C.: Checking validity of quantifier-free formulas in combinations of first-order theories. PhD thesis, Stanford University (2003)
2. Lecture Notes in Computer Science;C Barrett,2004
3. Brummayer, R., Biere, A.: Fuzzing and delta-debugging SMT solvers. In: Strichman, O., Dutertre, B. (eds.) 7th International Workshop on Satisfiability Modulo Theories (2009)
4. Brummayer, R., Biere, A.: Boolector: an efficient smt solver for bit-vectors and arrays. In: Kowalewski, S., Philippou, A. (eds.) 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’09. Lecture Notes in Computer Science, vol. 5505, pp. 174–177. Springer (2009)
5. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T.A., Ranise, S., van Rossum, P., Sebastiani, R.: Efficient satisfiability modulo theories via delayed theory combination. In: Proceedings of the 17th International Conference on Computer Aided Verification (CAV’05). Lecture Notes in Computer Science. Springer (2005)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献