{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:30:08Z","timestamp":1743064208561,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030150921"},{"type":"electronic","value":"9783030150938"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-15093-8_2","type":"book-chapter","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T13:07:46Z","timestamp":1552568866000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Malware Detection Using Logic Signature of Basic Block Sequence"],"prefix":"10.1007","author":[{"given":"Dawei","family":"Shi","sequence":"first","affiliation":[]},{"given":"Qiang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,15]]},"reference":[{"key":"2_CR1","unstructured":"Idika, N., Mathur, A.P.: A survey of malware detection techniques. Purdue University (2007)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-04342-0_6","volume-title":"Recent Advances in Intrusion Detection","author":"K Griffin","year":"2009","unstructured":"Griffin, K., Schneider, S., Hu, X., Chiueh, T.: Automatic generation of string signatures for malware detection. In: Kirda, E., Jha, S., Balzarotti, D. (eds.) RAID 2009. LNCS, vol. 5758, pp. 101\u2013120. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04342-0_6"},{"key":"2_CR3","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-48829-5_10","volume-title":"Intelligent Distributed Computing X","author":"A Mart\u00edn","year":"2017","unstructured":"Mart\u00edn, A., Men\u00e9ndez, H\u00e9ctor D., Camacho, D.: String-based malware detection for android environments. Intelligent Distributed Computing X. SCI, vol. 678, pp. 99\u2013108. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-48829-5_10"},{"issue":"9","key":"2_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ins.2011.08.020","volume":"231","author":"I Santos","year":"2013","unstructured":"Santos, I., et al.: Opcode sequences as representation of executables for data-mining-based unknown malware detection. Inf. Sci. 231(9), 64\u201382 (2013)","journal-title":"Inf. Sci."},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cose.2014.04.003","volume":"44","author":"Y Ding","year":"2014","unstructured":"Ding, Y., et al.: Control flow-based opcode behavior analysis for Malware detection. Comput. Secur. 44(2), 65\u201374 (2014)","journal-title":"Comput. Secur."},{"key":"2_CR6","unstructured":"Vinod, P., et al.: Static CFG analyzer for metamorphic Malware code. In: International Conference on Security of Information and Networks, Sin 2009, Gazimagusa, North Cyprus, October, pp. 225\u2013228. DBLP (2009)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Adkins, F., et al.: Heuristic malware detection via basic block comparison. In: International Conference on Malicious and Unwanted Software, pp. 11\u201318. The Americas IEEE (2014)","DOI":"10.1109\/MALWARE.2013.6703680"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Mehdi, B., et al.: Towards a theory of generalizing system call representation for in-execution malware detection. In: IEEE International Conference on Communications, pp. 1\u20135. IEEE (2010)","DOI":"10.1109\/ICC.2010.5501969"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.3844\/ajassp.2012.283.288","volume":"9","author":"AAE Elhadi","year":"2012","unstructured":"Elhadi, A.A.E., Maarof, M.A., Osman, A.H.: Malware detection based on hybrid signature behaviour application programming interface call graph. Am. J. Appl. Sci. 9(3), 283\u2013288 (2012)","journal-title":"Am. J. Appl. Sci."},{"key":"2_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-40576-1_37","volume-title":"Security in Computing and Communications","author":"P Natani","year":"2013","unstructured":"Natani, P., Vidyarthi, D.: Malware detection using API function frequency with ensemble based classifier. In: Thampi, S.M., Atrey, P.K., Fan, C.-I., Perez, G.M. (eds.) SSCC 2013. CCIS, vol. 377, pp. 378\u2013388. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40576-1_37"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Chandramohan, M., Tan, H.B.K., Shar, L.K.: Scalable malware clustering through coarse-grained behavior modeling. In: ACM SIGSOFT, International Symposium on the Foundations of Software Engineering, p. 27. ACM (2012)","DOI":"10.1145\/2393596.2393627"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"You, I., Yim, K.: Malware obfuscation techniques: a brief survey. In: International Conference on Broadband, Wireless Computing, Communication and Applications, pp. 297\u2013300. IEEE (2010)","DOI":"10.1109\/BWCCA.2010.85"},{"issue":"1","key":"2_CR13","first-page":"97","volume":"50","author":"FV Jensen","year":"2007","unstructured":"Jensen, F.V., Nielsen, T.D.: Bayesian networks and decision graphs. Technometrics 50(1), 97 (2007)","journal-title":"Technometrics"},{"key":"2_CR14","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-540-44792-4_29","volume-title":"Classic Works of the Dempster-Shafer Theory of Belief Functions","author":"T Den\u0153ux","year":"2008","unstructured":"Den\u0153ux, T.: A k-nearest neighbor classification rule based on dempster-shafer theory. In: Yager, R.R., Liu, L. (eds.) Classic Works of the Dempster-Shafer Theory of Belief Functions. STUDFUZZ, vol. 219, pp. 737\u2013760. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-44792-4_29"},{"issue":"3","key":"2_CR15","first-page":"660","volume":"21","author":"D Landgrebe","year":"2002","unstructured":"Landgrebe, D.: A survey of decision tree classifier methodology. IEEE Trans. Syst. Man Cybern. 21(3), 660\u2013674 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1018628609742","volume":"9","author":"JAK Suykens","year":"1999","unstructured":"Suykens, J.A.K., Vandewalle, J.: least squares support vector machine classifiers. Neural Process. Lett. 9(3), 293\u2013300 (1999)","journal-title":"Neural Process. Lett."},{"key":"2_CR17","unstructured":"Van Emmerik, M.: Static single assignment for decompilation. UQ Theses (RHD) - UQ staff and students only (2007)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-36577-X_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Khurshid","year":"2003","unstructured":"Khurshid, S., P\u0102s\u0102reanu, C.S., Visser, W.: Generalized symbolic execution for model checking and testing. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 553\u2013568. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-36577-X_40"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Mira, F., Huang, W., Brown, A.: Improving malware detection time by using RLE and N-gram. In: International Conference on Automation and Computing, pp. 1\u20135 (2017)","DOI":"10.23919\/IConAC.2017.8082001"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Shoshitaishvili, Y., et al.: SOK: (state of) the art of war: offensive techniques in binary analysis. In: Security and Privacy, pp. 138\u2013157. IEEE (2016)","DOI":"10.1109\/SP.2016.17"}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15093-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:33:36Z","timestamp":1558341216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15093-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030150921","9783030150938"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15093-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Green, Pervasive, and Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gpc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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"}},{"value":"2.50","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.51","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}