{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:29:44Z","timestamp":1762867784031,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T00:00:00Z","timestamp":1552953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00ecfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["400609\/2015-0"],"award-info":[{"award-number":["400609\/2015-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Pronametro","award":["52600.017257\/2013"],"award-info":[{"award-number":["52600.017257\/2013"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00ecfico e Tecnol\u00f3gico","award":["487061\/2013-6","309234\/2015-8"],"award-info":[{"award-number":["487061\/2013-6","309234\/2015-8"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00ecfico e Tecnol\u00f3gico","award":["421007\/2016-8"],"award-info":[{"award-number":["421007\/2016-8"]}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"crossref","award":["JCNE-203889"],"award-info":[{"award-number":["JCNE-203889"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Funda\u00e7\u00a0ao Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","award":["TECNOVA-143360"],"award-info":[{"award-number":["TECNOVA-143360"]}]},{"DOI":"10.13039\/501100004809","name":"Financiadora de Estudos e Projetos","doi-asserted-by":"publisher","award":["TI-MAIOR-SBV936"],"award-info":[{"award-number":["TI-MAIOR-SBV936"]}],"id":[{"id":"10.13039\/501100004809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00453-019-00557-w","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T13:38:29Z","timestamp":1555508309000},"page":"2899-2916","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Full Characterization of a Class of Graphs Tailored for Software Watermarking"],"prefix":"10.1007","volume":"81","author":[{"given":"Lucila M. S.","family":"Bento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davidson R.","family":"Boccardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael C. S.","family":"Machado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4925-9609","authenticated-orcid":false,"given":"Vin\u00edcius G.","family":"Pereira de S\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,19]]},"reference":[{"key":"557_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/390013.808479","volume":"5","author":"FE Allen","year":"1970","unstructured":"Allen, F.E.: Control flow analysis. SIGPLAN Not. 5, 1\u201319 (1970)","journal-title":"SIGPLAN Not."},{"key":"557_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.dam.2016.09.038","volume":"234","author":"LMS Bento","year":"2018","unstructured":"Bento, L.M.S., Boccardo, D., Machado, R.C.S., Pereira de S\u00e1, V.G., Szwarcfiter, J.L.: On the resilience of canonical reducible permutation graphs. Discrete Appl. Math. 234, 32\u201346 (2018)","journal-title":"Discrete Appl. Math."},{"key":"557_CR3","unstructured":"Business Software Alliance.: Shadow Market: 2011 BSA Global Software Piracy Study. http:\/\/globalstudy.bsa.org (2012)"},{"key":"557_CR4","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: Efficient encoding of watermark numbers as reducible permutation graphs, arXiv:1110.1194v1 [cs.DS] (2011)","DOI":"10.1145\/2383276.2383295"},{"key":"557_CR5","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: Encoding watermark numbers as cographs using self-inverting permutations. In: Proceeding of 12th International Conference on Computer Systems and Technologies, CompSysTech\u201911, ACM ICPS, vol. 578, pp. 142\u2013148 (2011) (Best Paper Award)","DOI":"10.1145\/2023607.2023632"},{"key":"557_CR6","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: An efficient graph codec system for software watermarking. In: IEEE Proceedings of 36th IEEE Conference on Computers, Software and Applications, COMPSAC\u201912, pp. 595\u2013600 (2012)","DOI":"10.1109\/COMPSACW.2012.116"},{"key":"557_CR7","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: Multiple encoding of a watermark number into reducible permutation graphs using cotrees. In: ACM ICPS Proceedings of 13th International Conference on Computer Systems and Technologies, CompSysTech\u201912, pp. 118\u2013125 (2012)","DOI":"10.1145\/2383276.2383295"},{"key":"557_CR8","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: An embedding graph-based model for software watermarking. In: IEEE Proceedings 8th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP\u201912, pp. 261\u2013264 (2012)","DOI":"10.1109\/IIH-MSP.2012.69"},{"key":"557_CR9","doi-asserted-by":"crossref","unstructured":"Collberg, C., Thomborson, C.: Software watermarking: models and dynamic embeddings. In: Proceedings 26th ACM SIGPLAN-SIGACT on Principles of Programming Languages, POPL\u201999, pp. 311\u2013324 (1999)","DOI":"10.1145\/292540.292569"},{"key":"557_CR10","doi-asserted-by":"crossref","unstructured":"Collberg, C., Kobourov, S., Carter, E., Thomborson, C.: Error-correcting graphs for software watermarking. In: Proceedings 29th Workshop on Graph-Theoretic Concepts in Computer Science, WG\u201903, vol. 2880, pp. 156\u2013167. LNCS (2003)","DOI":"10.1007\/978-3-540-39890-5_14"},{"key":"557_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1286821.1286826","volume":"29","author":"C Collberg","year":"2007","unstructured":"Collberg, C., Thomborson, C., Townsend, G.: Dynamic graph-based software fingerprinting. ACM Trans. Program. Lang. Syst. 29, 1\u201367 (2007)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"557_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.infsof.2008.09.016","volume":"51","author":"C Collberg","year":"2009","unstructured":"Collberg, C., Huntwork, A., Carter, E., Townsend, G., Stepp, M.: More on graph theoretic software watermarks: implementation, analysis and attacks. Inf. Softw. Technol. 51, 56\u201367 (2009)","journal-title":"Inf. Softw. Technol."},{"key":"557_CR13","unstructured":"Collberg, C.: SandMark: A Tool for the Study of Software Protection Algorithms. http:\/\/sandmark.cs.arizona.edu\/index.html (2013) Accessed 25 Nov 2013"},{"key":"557_CR14","unstructured":"Davidson, R.L., Myhrvold, N.: Method and system for generating and auditing a signature for a computer program, US Patent 5.559.884, Microsoft Corporation (1996)"},{"key":"557_CR15","doi-asserted-by":"crossref","unstructured":"Hamilton, J., Danicic, S.: A survey of static software watermarking. In: Proceedings World Congress on Internet Security, WorldCIS\u201911, pp. 100\u2013107 (2011)","DOI":"10.1109\/WorldCIS17046.2011.5749891"},{"key":"557_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"MS Hecht","year":"1972","unstructured":"Hecht, M.S., Ullman, J.D.: Flow graph reducibility. SIAM J. Comput. 1, 188\u2013202 (1972)","journal-title":"SIAM J. Comput."},{"key":"557_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"MS Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible flow graphs. J. ACM 21, 367\u2013375 (1974)","journal-title":"J. ACM"},{"key":"557_CR18","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"2004","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Berlin (2004)"},{"key":"557_CR19","unstructured":"Raghavan, V., Spinrad, J.: Robust Algorithms for Restricted Domains. In: Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201901, pp. 460\u2013467 (2001)"},{"key":"557_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10009-012-0253-y","volume":"14","author":"I Schaefer","year":"2012","unstructured":"Schaefer, I., Rabiser, R., Clarke, D., Bettini, L., Benavides, D., Botterweck, G., Pathak, A., Trujillo, S., Villela, K.: Software diversity: state of the art and perspectives. Int. J. Softw. Tools Technol. Transf. 14, 477\u2013495 (2012)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"557_CR21","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-35795-4_42","volume-title":"Hiding Signatures in Variable Names","author":"Y Su","year":"2013","unstructured":"Su, Y., Liu, J., Li, D.: Hiding Signatures in Variable Names. Communications in Computer and Information Science, pp. 333\u2013340. Springer, Berlin (2013)"},{"key":"557_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0022-0000(74)80049-8","volume":"9","author":"RE Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Testing flow graph reducibiliy. J. Comput. Syst. Sci. 9, 355\u2013365 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"557_CR23","doi-asserted-by":"crossref","unstructured":"Venkatesan, R., Vazirani, V., Sinha, S.: A graph theoretic approach to software watermarking. In: Proceedings 4th International Information Hiding Workshop, pp. 157\u2013168 (2001)","DOI":"10.1007\/3-540-45496-9_12"},{"key":"557_CR24","unstructured":"Venkatesan, R., Vazirani, V.: Technique for producing through watermarking highly tamper-resistant executable code and resulting watermarked code so formed, Microsoft Corporation, US Patent: 7051208 (2006)"},{"key":"557_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1049\/sej.1995.0010","volume":"10","author":"BA Wichmann","year":"1995","unstructured":"Wichmann, B.A., Canning, A.A., Clutterbuck, D.L., Winsborrow, L.A., Ward, N.J., Marsh, D.W.R.: Industrial perspective on static analysis. Softw. Eng. J. 10, 69\u201375 (1995)","journal-title":"Softw. Eng. J."},{"key":"557_CR26","doi-asserted-by":"crossref","unstructured":"Zhu, J., Liu, Y., Yin, K.: A novel dynamic graph software watermark scheme. In: Proceedings of 1st International Workshop on Education Technology and Computer Science, vol. 3, pp. 775\u2013780 (2009)","DOI":"10.1109\/ETCS.2009.709"},{"key":"557_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, W., Thomborson, C., Wang, F-Y.: A survey of software watermarking. In: Proceedings IEEE International Conference on Intelligence and Security Informatics, ISI\u201905, pp. 454\u2013458 (2005)","DOI":"10.1007\/11427995_42"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00557-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00557-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00557-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T17:04:52Z","timestamp":1607274292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00557-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,19]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["557"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00557-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,3,19]]},"assertion":[{"value":"8 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}