StarExec: A Cross-Community Infrastructure for Logic Solving

  • Aaron Stump
  • Geoff Sutcliffe
  • Cesare Tinelli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)


We introduce StarExec, a public web-based service built to facilitate the experimental evaluation of logic solvers, broadly understood as automated tools based on formal reasoning. Examples of such tools include theorem provers, SAT and SMT solvers, constraint solvers, model checkers, and software verifiers. The service, running on a compute cluster with 380 processors and 23 terabytes of disk space, is designed to provide a single piece of storage and computing infrastructure to logic solving communities and their members. It aims at reducing duplication of effort and resources as well as enabling individual researchers or groups with no access to comparable infrastructure. StarExec allows community organizers to store, manage and make available benchmark libraries; competition organizers to run logic solver competitions; and community members to do comparative evaluations of logic solvers on public or private benchmark problems.


Automate Reasoning Community Space Wall Clock Time Logic Solver Space Leader 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barrett, C., Deters, M., de Moura, L., Oliveras, A., Stump, A.: 6 Years of SMT-COMP. Journal of Automated Reasoning 50(3), 243–277 (2012)CrossRefGoogle Scholar
  2. 2.
    Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2010),
  3. 3.
    Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB Standard: Version 2.0. In: Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (2010)Google Scholar
  4. 4.
    Beyer, D.: Competition on software verification. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 504–524. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Biere, A., Claessen, K.: Hardware model checking competition. In: Hardware Verification Workshop (2010)Google Scholar
  6. 6.
    Hoos, H., Stützle, T.: SATLIB: An Online Resource for Research on SAT. In: Proceedings of the 3rd Workshop on the Satisfiability Problem (2001),
  7. 7.
    Le Berre, D., Simon, L. (eds.): Special Issue on the SAT 2005 Competitions and Evaluations, vol. 2. JSAT (2006)Google Scholar
  8. 8.
    Marché, C., Zantema, H.: The termination competition. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 303–313. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Nieuwenhuis, R.: Special Issue: The CADE ATP System Competition. AI Communications 15(2-3) (2002)Google Scholar
  10. 10.
    Peschiera, C., Pulina, L., Tacchella, A., Bubeck, U., Kullmann, O., Lynce, I.: The seventh QBF solvers evaluation (QBFEVAL’10). In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 237–250. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  11. 11.
    Raths, T., Otten, J., Kreitz, C.: The ILTP Problem Library for Intuitionistic Logic - Release v1.1. Journal of Automated Reasoning 38(1-2), 261–271 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Simon, L., Chatalic, P.: SatEx: A Web-based Framework for SAT Experimentation. In: Proceedings of SAT 2001. ENDM, vol. 9, pp. 129–149 (2001)Google Scholar
  13. 13.
    Stump, A., Deters, M.: SMT-Exec.,
  14. 14.
    Sutcliffe, G.: The TPTP Problem Library and Associated Infrastructure. The FOF and CNF Parts, v3.5.0. Journal of Automated Reasoning 43(4), 337–362 (2009)CrossRefzbMATHGoogle Scholar
  15. 15.
    Sutcliffe, G.: The TPTP World – Infrastructure for Automated Reasoning. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS (LNAI), vol. 6355, pp. 1–12. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Aaron Stump
    • 1
  • Geoff Sutcliffe
    • 2
  • Cesare Tinelli
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa CityUSA
  2. 2.Department of Computer ScienceUniversity of MiamiMiamiUSA

Personalised recommendations