{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:36Z","timestamp":1775054436258,"version":"3.50.1"},"reference-count":24,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"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":[[2018,9]]},"DOI":"10.1134\/s0361768818050080","type":"journal-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T06:29:23Z","timestamp":1537511363000},"page":"363-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fine-Grained Address Space Layout Randomization on Program Load"],"prefix":"10.1134","volume":"44","author":[{"given":"A. R.","family":"Nurmukhametov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. A.","family":"Zhabotinskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sh. F.","family":"Kurmangaleev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Gaissaryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Vishnyakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2018,9,21]]},"reference":[{"key":"7019_CR1","unstructured":"CVE Details website: Vulnerabilities by date. http:\/\/ www.cvedetails.com\/browse-by-date.php"},{"key":"7019_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2133375.2133377","volume":"15","author":"R. Roemer","year":"2012","unstructured":"Roemer, R., Bbuchanan, E., Shacham, H., and Savage, S., \u201cReturn-oriented programming: Systems, languages, and applications,\u201d ACM Trans. Inf. Syst. Secur. 2012, vol. 15, no. 1, pp. 2\u201334. https:\/\/doi.acm.org\/ 10.1145\/2133375.2133377","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"7019_CR3","doi-asserted-by":"crossref","unstructured":"Sadeghi, A., Niksefat, S., and Rostamipour, M., \u201cPure-Call oriented programming (PCOP): Chaining the gadgets using call instructions,\u201d J. Comput. Virology Hacking Techniques, 2017, no. 434, pp. 1\u201318. https:\/\/ doi.org\/ doi 10.1007\/s11416-017-0299-1","DOI":"10.1007\/s11416-017-0299-1"},{"key":"7019_CR4","volume-title":"\u201cJump-oriented programming: A new class of code-reuse attack,\u201d Proc. of the 6th ACM Symposium on Information","author":"T. Bletsch","year":"2011","unstructured":"Bletsch, T., Jiang, X., Freeh, V., Liang, W., and Liang, Zh., \u201cJump-oriented programming: A new class of code-reuse attack,\u201d Proc. of the 6th ACM Symposium on Information,\n                           Computer and Communications Security,\u201d 2011, pp. 30\u201340. https:\/\/doi.acm.org\/10.1145\/1966913. 1966919"},{"key":"7019_CR5","doi-asserted-by":"crossref","unstructured":"Hu, H., Shinde, Sh., Adrian, S., Chua, Z.L., Saxena, P., and Liang, Zh., \u201cData-Oriented programming: On the expressiveness of non-control data attacks,\u201d IEEE Symposium on Security and Privacy (SP), 2016,pp. 969\u2013986. https:\/\/doi.org\/ doi 10.1109\/SP.2016.6210.1109\/ SP.2016.62","DOI":"10.1109\/SP.2016.62"},{"key":"7019_CR6","doi-asserted-by":"crossref","unstructured":"Shacham, H., \u201cThe geometry of innocent flesh on the bone: Return-into-libc without function calls (on the x86),\u201d in Proc. of the 14th ACM Conf. on Computer and communications security, 2007, pp. 552\u2013561. https:\/\/ doi.org\/doi10.1145\/1315245.131531310.1145\/1315245. 1315313","DOI":"10.1145\/1315245.1315313"},{"key":"7019_CR7","doi-asserted-by":"crossref","unstructured":"Bittau, A., Belay, A., Mashtizadeh, A., et al., \u201cHacking blind,\u201d in Proc. of the 2014 IEEE Symposium on Security and Privacy, 2014, pp. 227\u2013242. https:\/\/dx.doi.org\/ doi 10.1109\/SP.2014.2210.1109\/SP.2014.22","DOI":"10.1109\/SP.2014.22"},{"key":"7019_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1609956.1609960","volume":"13","author":"M. Abadi","year":"2009","unstructured":"Abadi, M., Budiu, M., Erlingsson, U., and Ligatti, J., \u201cControl-flow integrity principles, implementations, and applications,\u201d ACM Trans. Inf. Syst. Secur., 2009, vol. 13, no. 1, pp. 4\u201340. https:\/\/doi.acm.org\/10.1145\/ 1609956.1609960","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"7019_CR9","doi-asserted-by":"crossref","unstructured":"Mashtizadeh, A.J., Bittau, A., Boneh, D., and Mazieres, D., \u201cCcfi: Cryptographically enforced control flow integrity,\u201d in Proc. of the Sixth ACM SIGSAC Conference on Computer and Communications Security, 2015, pp. 941\u2013951. https:\/\/doi.acm.org\/10.1145\/ 2810103. 2813676","DOI":"10.1145\/2810103.2813676"},{"key":"7019_CR10","doi-asserted-by":"crossref","unstructured":"Christoulakis, N., Christou, G., Athanasopoulos, E., Ioannidis, S., \u201cHcfi: Hardware-enforced control-flow integrity,\u201d in Proc. of the Sixth ACM Conference on Data and Application Security and Privacy, 2016, pp. 38\u201349. https:\/\/doi.acm.org\/10.1145\/2857705.2857722","DOI":"10.1145\/2857705.2857722"},{"key":"7019_CR11","unstructured":"Carlini, N., Barresi, A., Payer, M., et al., \u201cControl-flow bending: On the effectiveness of control-flow integrity,\u201d in Proc. of the 24th USENIX Conference on Security Symposium,\n                           2015, pp. 161\u2013176. http:\/\/dl.acm. org\/citation.cfm?id(31143.2831154"},{"key":"7019_CR12","doi-asserted-by":"crossref","unstructured":"Lu, K., N\u00fcrnberger, S., Backes, M., and Lee, W., \u201cHow to make ASLR win the clone wars: Runtime re-randomization,\u201d 23nd Annual Network and Distributed System Security Symposium, 2016.","DOI":"10.14722\/ndss.2016.23173"},{"key":"7019_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1134\/S0361768815040052","volume":"41","author":"A. Nurmukhametov","year":"2015","unstructured":"Nurmukhametov, A., Kurmangaleev, Sh., Kaushan, V., and Gaissaryan, S., \u201cApplication of compiler transformations against software vulnerabilities exploitation,\u201d Program. Comput. Software, 2015, vol. 41, no. 4, pp. 231\u2013236. https:\/\/doi.org\/ doi 10.1134\/ S0361768815040052","journal-title":"Program. Comput. Software"},{"key":"7019_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, S., Kerr, M., Kirkpatrick, E., and Bertino, E., \u201cMarlin: A fine grained randomization approach to defend against ROP attacks,\u201d in Proc. of the 7th Int. Conf. on Network and System Security, 2013.","DOI":"10.1007\/978-3-642-38631-2_22"},{"key":"7019_CR15","doi-asserted-by":"crossref","unstructured":"Conti, M., Crane, S., Frassetto, T., et al., \u201cSelfrando: Securing the Tor browser against de-anonymization exploits,\u201d PoPETs, 2016, no. 4, pp. 454\u2013469. http:\/\/dx. doi.org\/. doi 10.1515\/popets-2016-0050","DOI":"10.1515\/popets-2016-0050"},{"key":"7019_CR16","doi-asserted-by":"crossref","unstructured":"Davi, L., Dmitrienko, A., N\u00fcrnberger, S., and Sadeghi, A., \u201cGadge me if you can: Secure and efficient ad-hoc instruction-level randomization for x86 and AR,\u201d in Proc. of the 8th ACM Symposium on Information, Computer and Communications Security, 2013.","DOI":"10.1145\/2484313.2484351"},{"key":"7019_CR17","unstructured":"Backes, M. and Nurberger, S., \u201cOxymoron: Making fine-grained memory randomization practical by allowing code sharing,\u201d in Proc. of the 23rd USENIX Security Symposium, 2014, pp. 433\u2013447."},{"key":"7019_CR18","volume-title":"\u201cCode randomization: Haven\u2019t we solved this problem yet?\u201d Cybersecurity Development (SecDev)","author":"S. Crane","year":"2016","unstructured":"Crane, S., and Homescu, A., and Larsen, P., \u201cCode randomization: Haven\u2019t we solved this problem yet?\u201d Cybersecurity Development (SecDev), IEEE, 2016."},{"key":"7019_CR19","doi-asserted-by":"crossref","unstructured":"Bigelow, D., Hobson, T., Rudd, R., et al. \u201cTimely rerandomization for mitigating memory disclosures,\u201d in Proc. of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015, pp. 268\u2013279. http:\/\/doi.acm.org\/10.1145\/2810103.2813691.","DOI":"10.1145\/2810103.2813691"},{"key":"7019_CR20","unstructured":"Williams-King, D., Gobieski, G., Williams-King, K., et al. \u201cShuffler: Fast and deployable continuous code re-randomization,\u201d in Proc. of the 12th USENIX Conference on Operating Systems Design and Implementation, 2016, pp. 367\u2013382. http:\/\/dl.acm.org\/citation. cfm?id026877.3026906."},{"key":"7019_CR21","unstructured":"Payer, M., \u201cToo much PIE is bad for performance,\u201d Technical report. http:\/\/dx.doi.org\/ doi 10.3929\/ethz-a-007316742"},{"key":"7019_CR22","doi-asserted-by":"crossref","unstructured":"Coffman, J., Wellons, C., and Christopher, C., \u201cROP gadget prevalence and survival under compiler-based binary diversification schemes,\u201d in Proc. of the 2016 ACM Workshop on Software Protection, 2016, pp. 15\u201326.","DOI":"10.1145\/2995306.2995309"},{"key":"7019_CR23","doi-asserted-by":"crossref","unstructured":"Vishnyakov, A.V., \u201cClassification of ROP gadgets,\u201d Trudy ISP RAN, 2016, vol. 28, no. 6, pp. 27\u201336. http:\/\/ doi.acm.org\/10.1145\/2995306.2995309","DOI":"10.15514\/ISPRAS-2016-28(6)-2"},{"key":"7019_CR24","unstructured":"ROPgadget. https:\/\/github.com\/JonathanSalwan\/ROPgadget"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768818050080.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768818050080","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768818050080.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:35:34Z","timestamp":1775010934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768818050080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["7019"],"URL":"https:\/\/doi.org\/10.1134\/s0361768818050080","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"20 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}