{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:12:47Z","timestamp":1775016767369,"version":"3.50.1"},"reference-count":12,"publisher":"Pleiades Publishing Ltd","issue":"7","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1134\/s0361768819070028","type":"journal-article","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T11:02:45Z","timestamp":1576494165000},"page":"365-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Detection of Use-After-Free Bugs"],"prefix":"10.1134","volume":"45","author":[{"given":"S. A.","family":"Asryan","sequence":"first","affiliation":[]},{"given":"S. S.","family":"Gaissaryan","sequence":"additional","affiliation":[]},{"given":"Sh. F.","family":"Kurmangaleev","sequence":"additional","affiliation":[]},{"given":"A. M.","family":"Aghabalyan","sequence":"additional","affiliation":[]},{"given":"N. G.","family":"Hovsepyan","sequence":"additional","affiliation":[]},{"given":"S. S.","family":"Sargsyan","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2019,12,16]]},"reference":[{"key":"7081_CR1","doi-asserted-by":"crossref","unstructured":"Dewey, D., Reaves, B., and Trainor, P., Uncovering use-after-free conditions in compiled code, in Proc. of the 10th International Conference on Availability, Reliability and Security (ARES), 2015, pp. 90\u201399.","DOI":"10.1109\/ARES.2015.61"},{"key":"7081_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11416-014-0203-1","volume":"10","author":"J. Feist","year":"2014","unstructured":"Feist, J., Mounier, L., and Potet, M.-L., Statically detecting use after free on binary code, J. Comput. Virology Hacking Techniques, 2014, vol. 10, no. 3, pp. 211\u2013217.","journal-title":"J. Comput. Virology Hacking Techniques"},{"key":"7081_CR3","first-page":"55","volume":"21","author":"I.K. Isaev","year":"2011","unstructured":"Isaev, I.K., Sidorov, D.V., Gerasimov, A.Yu., and Ermakov, M.K., Avalanche: Application of dynamic analysis for the automatic detection of bugs in programs that use network sockets, Trudy Inst. Sist. Program. Russ. Akad Sci., 2011, vol. 21, pp. 55\u201370.","journal-title":"Trudy Inst. Sist. Program. Russ. Akad Sci."},{"key":"7081_CR4","doi-asserted-by":"crossref","unstructured":"Lee, B., Song, Ch., Jang, Y., and Wang, T., Preventing use-after-free with dangling pointers nullification, in Proc. of the Network and Distributed System Security Symposium, 2015.\nhttps:\/\/www.ndss-symposium.org\/ndss2015\/ndss-2015-programme\/preventing-use-after-free-dangling-pointers-nullification\/","DOI":"10.14722\/ndss.2015.23238"},{"key":"7081_CR5","doi-asserted-by":"crossref","unstructured":"Younan, Y., FreeSentry: Protecting against use-after-free vulnerabilities due to dangling pointers, in Proc. of the Network and Distributed System Security Symposium, 2015.\nhttps:\/\/www.ndss-symposium.org\/ndss2015\/ndss-2015-programme\/freesentry-protecting-against-use-after-free-vulnerabilities-due-dangling-pointers\/","DOI":"10.14722\/ndss.2015.23190"},{"key":"7081_CR6","doi-asserted-by":"crossref","unstructured":"Caballero, J., Grieco, G., Marron, M., and Nappa, A., Undangle: Early detection of dangling pointers in use-after-free and double-free vulnerabilities, in Proc. of the 2012 International Symposium on Software Testing and Analysis, 2012, pp. 133\u2013143.","DOI":"10.1145\/2338965.2336769"},{"key":"7081_CR7","doi-asserted-by":"crossref","unstructured":"Sang Kil Cha, Thanassis Avgerinos, Alexandre Rebert, A., and Brumley, D., Unleashing MAYHEM on binary code, in Proc. of the 2012 IEEE Symposium on Security and Privacy, 2012, pp. 380\u2013394.","DOI":"10.1109\/SP.2012.31"},{"key":"7081_CR8","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A. Aho","year":"2006","unstructured":"Aho, A., Ullman, J., Sethi, R., and Lam, M. S., Compilers: Principles, Techniques, and Tools, Boston: Addison Wesley, 2006, 2nd ed."},{"key":"7081_CR9","unstructured":"Pin \u2013 A Dynamic Binary Instrumentation Tool. https:\/\/software.intel.com\/en-us\/articles\/pin-a-dynamic-binary-instrumentation-tool"},{"key":"7081_CR10","unstructured":"Triton \u2013 Dynamic Binary Analysis Framework. https:\/\/triton.quarkslab.com\/"},{"key":"7081_CR11","unstructured":"Godefroid, P., Levin, M. Y., and Molnar, D. Automated whitebox fuzz testing, in Proc. of the Conference on Network and Distributed Systems Security (NDSS'2008), 2008, pp. 151\u2013166."},{"key":"7081_CR12","doi-asserted-by":"crossref","unstructured":"de Moura, L. and Bj\u00f8rner, N., Z3: An efficient SMT solver, in Proc. of the 14th International conference on Tools and Algorithms for the Construction and Analysis of Systems, 2008, pp. 337\u2013340.","DOI":"10.1007\/978-3-540-78800-3_24"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768819070028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768819070028","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768819070028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:39:21Z","timestamp":1775011161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768819070028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["7081"],"URL":"https:\/\/doi.org\/10.1134\/s0361768819070028","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"15 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}