{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:09:21Z","timestamp":1770286161283,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319457406","type":"print"},{"value":"9783319457413","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45741-3_3","type":"book-chapter","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T04:50:25Z","timestamp":1473828625000},"page":"39-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Manufacturing Resilient Opaque Constructs Against Static Analysis"],"prefix":"10.1007","author":[{"given":"Brendan","family":"Sheridan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micah","family":"Sherr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"3_CR1","first-page":"781","volume":"2","author":"M Agrawal","year":"2002","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 2, 781\u2013793 (2002)","journal-title":"Ann. Math."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012)","journal-title":"J. ACM"},{"key":"3_CR3","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","author":"A Biere","year":"2009","unstructured":"Biere, A., Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Swansea (2009)"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11416-008-0084-2","volume":"4","author":"J-M Borello","year":"2008","unstructured":"Borello, J.-M., M\u00e9, L.: Code obfuscation techniques for metamorphic viruses. J. Comput. Virol. 4(3), 211\u2013220 (2008)","journal-title":"J. Comput. Virol."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1145\/48014.48016","volume":"35","author":"V Chv\u00e1tal","year":"1988","unstructured":"Chv\u00e1tal, V., Szemer\u00e9di, E.: Many hard examples for resolution. J. ACM 35(4), 759\u2013768 (1988)","journal-title":"J. ACM"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Krivelevich, M., Vilenchik, D.: Why almost all satisfiable k-CNF formulas are easy. In: 2007 Conference on Analysis of Algorithms, AofA 2007, pp. 95\u2013108. Discrete Mathematics and Theoretical Computer Science (2007)","DOI":"10.46298\/dmtcs.3538"},{"issue":"8","key":"3_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/TSE.2002.1027797","volume":"28","author":"C Collberg","year":"2002","unstructured":"Collberg, C., Thomborson, C.: Watermarking, tamper-proofing, and obfuscation - tools for software protection. Trans. Softw. Eng. 28(8), 735\u2013746 (2002)","journal-title":"Trans. Softw. Eng."},{"key":"3_CR8","unstructured":"Collberg, C., Thomborson, C., Low, D.: A taxonomy of obfuscating transformations (1997)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Collberg, C., Thomborson, C., Low, D.: Manufacturing cheap, resilient, and stealthy opaque constructs. In: ACM POPL. ACM (1998)","DOI":"10.1145\/268946.268962"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: a survey, pp. 1\u201317. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"issue":"1\u20132","key":"3_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","volume":"81","author":"JM Crawford","year":"1996","unstructured":"Crawford, J.M., Auton, L.D.: Experimental results on the crossover point in random 3-SAT. Artif. Intell. 81(1\u20132), 31\u201357 (1996)","journal-title":"Artif. Intell."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11784180_9","volume-title":"Algebraic Methodology and Software Technology","author":"MD Preda","year":"2006","unstructured":"Preda, M.D., Madou, M., De Bosschere, K., Giacobazzi, R.: Opaque predicates detection by abstract interpretation. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 81\u201395. Springer, Heidelberg (2006)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Darwish, S., Guirguis, S., Zalat, M.: Stealthy code obfuscation technique for software security. In: International Conference on Computer Engineering and Systems (ICCES), pp. 93\u201399 (2010)","DOI":"10.1109\/ICCES.2010.5674830"},{"key":"3_CR14","unstructured":"Goldwasser, S., Bellare, M.: Lecture notes on cryptography (2001)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/239912.239913","volume":"19","author":"S Horwitz","year":"1997","unstructured":"Horwitz, S.: Precise flow-insensitive may-alias analysis is NP-hard. ACM Trans. Program. Lang. Syst. 19(1), 1\u20136 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. In: FOCS (1994)","DOI":"10.1002\/rsa.3240070105"},{"key":"3_CR17","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, New York (1972)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Ming, J., Xu, D., Wang, L., Wu, D.: Loop: Logic-oriented opaque predicate detection in obfuscated binary code. In: CCS (2015)","DOI":"10.1145\/2810103.2813617"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Moser, A., Kruegel, C., Kirda, E.: Limits of static analysis for malware detection. In: Computer Security Applications Conference (ACSAC), pp. 421\u2013430 (2007)","DOI":"10.1109\/ACSAC.2007.4413008"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10660-006-6955-z","volume":"6","author":"G Myles","year":"2006","unstructured":"Myles, G., Collberg, C.: Software watermarking via opaque predicates: Implementation, analysis, and attacks. Electron. Commer. Res. 6(2), 155\u2013171 (2006)","journal-title":"Electron. Commer. Res."},{"issue":"1","key":"3_CR21","first-page":"176","volume":"86","author":"T Ogiso","year":"2003","unstructured":"Ogiso, T., Sakabe, Y., Soshi, M., Miyaji, A.: Software obfuscation on a theoretical basis and its implementation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(1), 176\u2013186 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Preda, M., Giacobazzi, R.: Control code obfuscation by abstract interpretation. In: Software Engineering and Formal Methods (SEFM), pp. 301\u2013310 (2005)","DOI":"10.1109\/SEFM.2005.13"},{"issue":"5","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1145\/186025.186041","volume":"16","author":"G Ramalingam","year":"1994","unstructured":"Ramalingam, G.: The undecidability of aliasing. ACM Trans. Program. Lang. Syst. 16(5), 1467\u20131471 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1\u20132","key":"3_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","volume":"81","author":"B Selman","year":"1996","unstructured":"Selman, B., Mitchell, D.G., Levesque, H.J.: Generating hard satisfiability problems. Artif. Intell. 81(1\u20132), 17\u201329 (1996)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2016"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45741-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:36:54Z","timestamp":1749580614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-45741-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319457406","9783319457413"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45741-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"15 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heraklion","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}