{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:14:34Z","timestamp":1743135274278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_18","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"304-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards Faster Reasoners by Using Transparent Huge Pages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8681-7470","authenticated-orcid":false,"given":"Johannes K.","family":"Fichte","sequence":"first","affiliation":[]},{"given":"Norbert","family":"Manthey","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Stecklina","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Schidler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"18_CR1","unstructured":"Arcangeli, A.: Transparent hugepage support. In: KVM forum, vol. 9 (2010)"},{"key":"18_CR2","unstructured":"Arnold, R.S., et al.: The GNU C library (glibc) (2019). https:\/\/www.gnu.org\/software\/libc\/"},{"key":"18_CR3","unstructured":"Audemard, G., Simon, L.: Glucose in the SAT race 2019. In: Heule, M.J., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Race 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series, vol. B-2019-1, pp. 19\u201320. University of Helsinki (2019)"},{"key":"18_CR4","unstructured":"AWS: Astera labs uses AWS to accelerate chip development (2020). https:\/\/aws.amazon.com\/solutions\/case-studies\/astera-labs\/?did=cr_card&trk=cr_card"},{"key":"18_CR5","unstructured":"AWS: Aws customer success story: Zalando (2020). https:\/\/aws.amazon.com\/solutions\/case-studies\/zalando\/"},{"issue":"3\/4","key":"18_CR6","first-page":"123","volume":"8","author":"A Belov","year":"2012","unstructured":"Belov, A., Marques-Silva, J.: MUSer2: an efficient MUS extractor. J. Satisf. Boolean Model. Comput. 8(3\/4), 123\u2013128 (2012)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Biere, A.: Lingeling essentials, a tutorial on design and implementation aspects of the the SAT solver Lingeling. In: Berre, D.L. (ed.) POS 2014, Fifth Pragmatics of SAT Workshop. EPiC Series in Computing, vol. 27, p. 88. EasyChair (2014). https:\/\/doi.org\/10.29007\/jhd7. https:\/\/easychair.org\/publications\/paper\/xJs","DOI":"10.29007\/jhd7"},{"key":"18_CR8","unstructured":"Biere, A.: Splatz, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2016. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2016 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2016-1, pp. 44\u201345. University of Helsinki (2016)"},{"key":"18_CR9","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2017. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2017 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2017-1, pp. 14\u201315. University of Helsinki (2017)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Biere, A., van Dijk, T., Heljanko, K.: Hardware model checking competition 2017. In: Stewart, D., Weissenbacher, G. (eds.) Formal Methods in Computer-Aided Design, FMCAD 2017, Vienna, Austria, 02\u201306 October 2017, p. 9. IEEE (2017)","DOI":"10.23919\/FMCAD.2017.8102233"},{"key":"18_CR11","unstructured":"Biere, A., Heljanko, K., Wieringa, S.: AIGER 1.9 and beyond. Technical report 11\/2, Institute for Formal Models and Verification, Johannes Kepler University, Altenbergerstr. 69, 4040 Linz, Austria (2011)"},{"key":"18_CR12","unstructured":"Biere, A., Heule, M.: The effect of scrambling CNFs. In: Berre, D.L., J\u00e4rvisalo, M. (eds.) Proceedings of Pragmatics of SAT 2015 and 2018. EPiC Series in Computing, vol. 59, pp. 111\u2013126. EasyChair (2019)"},{"volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2009","key":"18_CR13","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-39611-3_3","volume-title":"Hardware and Software: Verification and Testing","author":"N Bj\u00f8rner","year":"2013","unstructured":"Bj\u00f8rner, N.: SMT in verification, modeling, and testing at Microsoft. In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, p. 3. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39611-3_3"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Sikora, F.: The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: Paul, C., Pilipczuk, M. (eds.) Proceedings of the 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, pp. 26:1\u201326:15. Dagstuhl Publishing, Helsinki (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.26","DOI":"10.4230\/LIPIcs.IPEC.2018.26"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Bornebusch, F., Wille, R., Drechsler, R.: Towards lightweight satisfiability solvers for self-verification. In: Proceedings of the 7th International Symposium on Embedded Computing and System Design (ISED 2017), pp. 1\u20135, December 2017. https:\/\/doi.org\/10.1109\/ISED.2017.8303924","DOI":"10.1109\/ISED.2017.8303924"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3233\/SAT19006","volume":"6","author":"G Chu","year":"2009","unstructured":"Chu, G., Harwood, A., Stuckey, P.: Cache conscious data structures for Boolean satisfiability solvers. J. Satisf. Boolean Model. Comput. 6, 99\u2013120 (2009). https:\/\/doi.org\/10.3233\/SAT19006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The pace 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: Lokshtanov, D., Nishimura, N. (eds.) Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), pp. 30:1\u201330:13. Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl Publishing (2017). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2017.30","DOI":"10.4230\/LIPIcs.IPEC.2017.30"},{"issue":"7","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TCAD.2008.923410","volume":"27","author":"V D\u2019Silva","year":"2008","unstructured":"D\u2019Silva, V., Kroening, D., Weissenbacher, G.: A survey of automated techniques for formal software verification. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(7), 1165\u20131178 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Dzulfikar, M.A., Fichte, J.K., Hecher, M.: The PACE 2019 parameterized algorithms and computational experiments challenge: the fourth iteration (invited paper). In: Jansen, B.M.P., Telle, J.A. (eds.) 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 148, pp. 25:1\u201325:23. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.25. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11486","DOI":"10.4230\/LIPIcs.IPEC.2019.25"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-98334-9_8","volume-title":"Principles and Practice of Constraint Programming","author":"JK Fichte","year":"2018","unstructured":"Fichte, J.K., Hecher, M., Lodha, N., Szeider, S.: An SMT approach to fractional hypertree width. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 109\u2013127. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_8"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Szeider, S.: Breaking symmetries with RootClique and LexTopsort. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 286\u2013303. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-58475-7_17"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-319-66263-3_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"JK Fichte","year":"2017","unstructured":"Fichte, J.K., Lodha, N., Szeider, S.: SAT-based local improvement for finding tree decompositions of small width. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 401\u2013411. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_25"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"CP Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 121\u2013135. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0017434"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11757283_5","volume-title":"Formal Methods for Hardware Verification","author":"A Gupta","year":"2006","unstructured":"Gupta, A., Ganai, M.K., Wang, C.: SAT-based verification methods and applications in hardware verification. In: Bernardo, M., Cimatti, A. (eds.) SFM 2006. LNCS, vol. 3965, pp. 108\u2013143. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11757283_5"},{"key":"18_CR28","unstructured":"Hackenberg, D., Sch\u00f6ne, R., Ilsche, T., Molka, D., Schuchart, J., Geyer, R.: An energy efficiency feature survey of the intel Haswell processor. In: Lalande, J.F., Moh, T. (eds.) Proceedings of the 17th International Conference on High Performance Computing & Simulation (HPCS 2019) (2019)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-16242-8_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S H\u00f6lldobler","year":"2010","unstructured":"H\u00f6lldobler, S., Manthey, N., Saptawijaya, A.: Improving resource-unaware SAT solvers. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 519\u2013534. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_37"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-44973-4_16","volume-title":"Learning and Intelligent Optimization","author":"HH Hoos","year":"2013","unstructured":"Hoos, H.H., Kaufmann, B., Schaub, T., Schneider, M.: Robust benchmark set selection for Boolean constraint solvers. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 138\u2013152. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44973-4_16"},{"key":"18_CR31","unstructured":"Hykes, S., et al.: Docker CE (2019). https:\/\/github.com\/docker\/docker-ce"},{"key":"18_CR32","unstructured":"Intel: Intel\u00ae 64 and IA-32 Architectures Software Developer\u2019s Manual (2019). Order Number: 325462\u2013069US"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-31365-3_28","volume-title":"Automated Reasoning","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355\u2013370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_28"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-21581-0_27","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"H Katebi","year":"2011","unstructured":"Katebi, H., Sakallah, K.A., Marques-Silva, J.P.: Empirical study of the anatomy of modern SAT solvers. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 343\u2013356. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21581-0_27"},{"key":"18_CR35","unstructured":"Kaufmann, B., Gebser, M., Kaminski, R., Schaub, T.: clasp - a conflict-driven nogood learning answer set solver (2015). http:\/\/www.cs.uni-potsdam.de\/clasp\/"},{"key":"18_CR36","volume-title":"Propositional Logic: Deduction and Algorithms","author":"H Kleine B\u00fcning","year":"1999","unstructured":"Kleine B\u00fcning, H., Lettman, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)"},{"key":"18_CR37","unstructured":"Kochemazov, S., Zaikin, O., Kondratiev, V., Semenov, A.: MapleLCMDistChronoBT-DL, duplicate learnts heuristic-aided solvers at the SAT Race 2019. In: Heule, M.J., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Race 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series, vol. B-2019-1, pp. 24\u201324. University of Helsinki (2019)"},{"key":"18_CR38","unstructured":"van der Kouwe, E., Andriesse, D., Bos, H., Giuffrida, C., Heiser, G.: Benchmarking crimes: an emerging threat in systems security. CoRR abs\/1801.02381 (2018). http:\/\/arxiv.org\/abs\/1801.02381"},{"key":"18_CR39","unstructured":"Kwon, Y., Yu, H., Peter, S., Rossbach, C.J., Witchel, E.: Coordinated and efficient huge page management with ingens. In: Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI 2016), pp. 705\u2013721. USENIX Association, Savannah (2016)"},{"key":"18_CR40","doi-asserted-by":"publisher","unstructured":"Luo, M., Li, C.M., Xiao, F., Many\u00e0, F., L\u00fc, Z.: An effective learnt clause minimization approach for CDCL SAT solvers. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 703\u2013711 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/98","DOI":"10.24963\/ijcai.2017\/98"},{"key":"18_CR41","unstructured":"Manthey, N.: MergeSAT. In: Heule, M.J., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Race 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series, vol. B-2019-1, pp. 29\u201330. University of Helsinki, Helsinki (2019)"},{"issue":"5","key":"18_CR42","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J Marques-Silva","year":"1999","unstructured":"Marques-Silva, J., Sakallah, K.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999). https:\/\/doi.org\/10.1109\/12.769433","journal-title":"IEEE Trans. Comput."},{"key":"18_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver\u2019. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"18_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-27705-4_12","volume-title":"Verified Software: Theories, Tools, Experiments","author":"F Merz","year":"2012","unstructured":"Merz, F., Falke, S., Sinz, C.: LLBMC: bounded model checking of C and C++ programs using a compiler IR. In: Joshi, R., M\u00fcller, P., Podelski, A. (eds.) VSTTE 2012. LNCS, vol. 7152, pp. 146\u2013161. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27705-4_12"},{"key":"18_CR45","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Rabaey, J. (ed.) Proceedings of the 38th Annual Design Automation Conference (DAC 2001), pp. 530\u2013535. Association for Computing Machinery, New York (2001). https:\/\/doi.org\/10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"key":"18_CR46","doi-asserted-by":"publisher","unstructured":"Navarro, J., Iyer, S., Druschel, P., Cox, A.: Practical, transparent operating system support for superpages. SIGOPS Oper. Syst. Rev. 36(SI), 89\u2013104 (2003). https:\/\/doi.org\/10.1145\/844128.844138. This paper describes Super Page implementation in FreeBSD. It also has performance numbers, but really ancient ones. They roughly match the SAT solver performance improvements, though","DOI":"10.1145\/844128.844138"},{"key":"18_CR47","doi-asserted-by":"publisher","unstructured":"Panwar, A., Prasad, A., Gopinath, K.: Making huge pages actually useful. In: Bianchini, R., Sarkar, V. (eds.) Proceedings of the 23rd ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2018), pp. 679\u2013692. Association for Computing Machinery, New York, March 2018. https:\/\/doi.org\/10.1145\/3173162.3173203","DOI":"10.1145\/3173162.3173203"},{"issue":"3","key":"18_CR48","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/TC.2018.2869169","volume":"68","author":"S Park","year":"2019","unstructured":"Park, S., Kim, M., Yeom, H.Y.: GCMA: guaranteed contiguous memory allocator. IEEE Trans. Comput. 68(3), 390\u2013401 (2019). https:\/\/doi.org\/10.1109\/TC.2018.2869169","journal-title":"IEEE Trans. Comput."},{"key":"18_CR49","doi-asserted-by":"publisher","unstructured":"Schidler, A., Szeider, S.: Computing optimal hypertree decompositions. In: Blelloch, G., Finocchi, I. (eds.) Proceedings of the 2020 Symposium on Algorithm Engineering and Experiments (ALENEX 2020), Salt Lake City, UT, USA (2020). https:\/\/doi.org\/10.1137\/1.9781611976007.1","DOI":"10.1137\/1.9781611976007.1"},{"key":"18_CR50","unstructured":"Soos, M.: Cryptominisat 5.7.1 (2020). https:\/\/github.com\/msoos\/cryptominisat"},{"key":"18_CR51","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-08587-6_28","volume-title":"Automated Reasoning","author":"A Stump","year":"2014","unstructured":"Stump, A., Sutcliffe, G., Tinelli, C.: StarExec: a cross-community infrastructure for logic solving. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 367\u2013373. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_28. Held as Part of the Vienna Summer of Logic, VSL 2014"},{"key":"18_CR52","unstructured":"Torvalds, L.: kernel.org: transparent hugepage support, May 2017. https:\/\/www.kernel.org\/doc\/Documentation\/vm\/transhuge.txt"},{"key":"18_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-319-08867-9_46","volume-title":"Computer Aided Verification","author":"A Voronkov","year":"2014","unstructured":"Voronkov, A.: AVATAR: the architecture for first-order theorem provers. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 696\u2013710. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_46. Held as Part of the Vienna Summer of Logic (VSL)"},{"key":"18_CR54","unstructured":"Wikichip, C.: Skylake (client) - Microarchitectures - Intel (2020). https:\/\/en.wikichip.org\/wiki\/intel\/microarchitectures\/skylake_(client)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T14:47:50Z","timestamp":1619189270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.13","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.47","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}