Tools and Algorithms for the Construction and Analysis of Systems: 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part III
By Dirk Beyer, Marieke Huisman, Fabrice Kordon, Bernhard Steffen. Lecture Notes in Computer Science, 2019
506 citations recorded by the source corpus.
Evaluation of scientific contributions can be done in many different ways. For the various research communities working on the verification of systems (software, hardware, or the underlying involved mechanisms), it is important to bring together the community and to compare the state of the art, in order to identify progress of and new challenges in the research area. Competitions are a suitable way to do that. The first verification competition was created in 1992 (SAT competition), shortly followed by the CASC competition in 1996. Since the year 2000, the number of dedicated verification competitions is steadily increasing. Many of these events now happen regularly, gathering researchers that would like to understand how well their research prototypes work in practice. Scientific results have to be reproducible, and powerful computers are becoming cheaper and cheaper, thus, these competitions are becoming an important means for advancing research in verification technology. TOOLympics 2019 is an event to celebrate the achievements of the various competitions, and to understand their commonalities and differences. This volume is dedicated to the presentation of the 16 competitions that joined TOOLympics as part of the celebration of the 25 anniversary of the TACAS conference. https://tacas.info/toolympics.php c © The Author(s) 2019 D. Beyer et al. (Eds.): TACAS 2019, Part III, LNCS 11429, pp. 3–24, 2019. https://doi.org/10.1007/978-3-030-17502-3_1 4 E. Bartocci et al.
View Paper: https://www.semanticscholar.org/paper/8c16605b8bebd1f4714d88274323224f17fb86a0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
Citations in the corpus
- Effective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic (2014, methodology): “SMT solvers that have implemented this algorithm include Barcelogic [18], CVC4 [7], MathSAT [27], OpenSMT [23], SMTInterpol [26], Yices [48], Yices 2 [45], and Z3 [38].”