{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T01:13:52Z","timestamp":1726276432671},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319723587"},{"type":"electronic","value":"9783319723594"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-72359-4_48","type":"book-chapter","created":{"date-parts":[[2017,12,7]],"date-time":"2017-12-07T11:19:11Z","timestamp":1512645551000},"page":"770-779","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matching Function-Call Graph of Binary Codes and Its Applications (Short Paper)"],"prefix":"10.1007","author":[{"given":"Yong","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ShuNing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,8]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Hu, X., Chiueh, T., Shin, K.G.: Large-scale malware indexing using function-call graphs. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, pp. 611\u2013620. ACM (2009)","DOI":"10.1145\/1653662.1653736"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Koutra, D., Tong, H., Lubensky, D.: Big-align: fast bipartite graph alignment. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 389\u2013398. IEEE (2013)","DOI":"10.1109\/ICDM.2013.152"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the VF graph matching algorithm. In: Proceedings of International Conference on Image Analysis and Processing, pp. 1172\u20131177. IEEE (1999)","DOI":"10.1109\/ICIAP.1999.797762"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-04697-1_9","volume-title":"Advanced Concepts for Intelligent Vision Systems","author":"S Jouili","year":"2009","unstructured":"Jouili, S., Mili, I., Tabbone, S.: Attributed graph matching using local descriptions. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds.) ACIVS 2009. LNCS, vol. 5807, pp. 89\u201399. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04697-1_9"},{"key":"48_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-02124-4_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S Jouili","year":"2009","unstructured":"Jouili, S., Tabbone, S.: Graph matching based on node signatures. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 154\u2013163. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02124-4_16"},{"issue":"1\u20132","key":"48_CR6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"issue":"5\u20136","key":"48_CR7","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1007\/s10618-014-0367-9","volume":"28","author":"O Kostakis","year":"2014","unstructured":"Kostakis, O.: Classy: fast clustering streams of call-graphs. Data Min. Knowl. Discov. 28(5\u20136), 1554\u20131585 (2014)","journal-title":"Data Min. Knowl. Discov."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Sartipi, K., Kontogiannis, K.: On modeling software architecture recovery as graph matching. In: Proceedings of International Conference on Software Maintenance, ICSM 2003, pp. 224\u2013234. IEEE (2003)","DOI":"10.1109\/ICSM.2003.1235425"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Bernardi, M.L., Cimitile, M., Di Lucca, G.A.: A model-driven graph-matching approach for design pattern detection. In: 2013 20th Working Conference on Reverse Engineering (WCRE), pp. 172\u2013181. IEEE (2013)","DOI":"10.1109\/WCRE.2013.6671292"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Nagarajan, V., Gupta, R., Zhang, X., Madou, M., De Sutter, B.: Matching control flow of program versions. In: IEEE International Conference on Software Maintenance, ICSM 2007, pp. 84\u201393. IEEE (2007)","DOI":"10.1109\/ICSM.2007.4362621"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Krinke, J.: Identifying similar code with program dependence graphs. In: Proceedings of Eighth Working Conference on Reverse Engineering, pp. 301\u2013309. IEEE (2001)","DOI":"10.1109\/WCRE.2001.957835"},{"key":"48_CR12","unstructured":"Silvio C, Yang X.: Simseer and bugwise: web services for binary-level software similarity and defect detection. In: Proceedings of the 11th Australasian Symposium on Parallel and Distributed Computing, pp. 21\u201329 (2013)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Chen, K., Liu, P., Zhang, Y.: Achieving accuracy and scalability simultaneously in detecting application clones on Android markets. In: Proceedings of the International Conference on Software Engineering, pp. 175\u2013186. ACM (2014)","DOI":"10.1145\/2568225.2568286"},{"issue":"4","key":"48_CR14","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/TC.2010.130","volume":"60","author":"Y Tang","year":"2011","unstructured":"Tang, Y., Xiao, B., Lu, X.: Signature tree generation for polymorphic worms. IEEE Trans. Comput. 60(4), 565\u2013579 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Junod, P., Rinaldini, J., Wehrli, J., Michielin, J.: Obfuscator-LLVM - software protection for the masses. In: International Workshop on Software Protection, pp. 3\u20139. IEEE (2015)","DOI":"10.1109\/SPRO.2015.10"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72359-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,7]],"date-time":"2017-12-07T11:39:55Z","timestamp":1512646795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72359-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319723587","9783319723594"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72359-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}