{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T15:16:41Z","timestamp":1791299801177,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212973","type":"print"},{"value":"9783540247234","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24723-4_2","type":"book-chapter","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T20:14:24Z","timestamp":1280261664000},"page":"5-23","source":"Crossref","is-referenced-by-count":181,"title":["Analyzing Memory Accesses in x86 Executables"],"prefix":"10.1007","author":[{"given":"Gogul","family":"Balakrishnan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Bergeron, J., Debbabi, M., Desharnais, J., Erhioui, M.M., Lavoie, Y., Tawbi, N.: Static detection of malicious code in executable programs. Int. J. of Req. Eng. (2001)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bergeron, J., Debbabi, M., Erhioui, M.M., Ktari, B.: Static analysis of binary code to isolate malicious behaviors. In: WETICE, pp. 184\u2013189 (1999)","DOI":"10.1109\/ENABL.1999.805197"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039704","volume-title":"Formal Methods in Programming and Their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Pottosin, I.V., Bjorner, D., Broy, M. (eds.) FMP&TA 1993. LNCS, vol.\u00a0735. Springer, Heidelberg (1993)"},{"key":"2_CR4","unstructured":"Cifuentes, C., Fraboulet, A.: Interprocedural data flow recovery of high-level language code from assembly. Technical Report 421, Univ. Queensland (1997)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cifuentes, C., Fraboulet, A.: Intraprocedural static slicing of binary executables. In: Int. Conf. on Softw. Maint., pp. 188\u2013195 (1997)","DOI":"10.1109\/ICSM.1997.624245"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cifuentes, C., Simon, D., Fraboulet, A.: Assembly to high-level language translation. In: Int. Conf. on Softw. Maint., pp. 228\u2013237 (1998)","DOI":"10.1109\/ICSM.1998.738514"},{"key":"2_CR7","unstructured":"CodeSurfer, GrammaTech, Inc., http:\/\/www.grammatech.com\/products\/codesurfer\/"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proc. 2nd Int. Symp. on Programming, Dunod, Paris, France, pp. 106\u2013130 (1976)","DOI":"10.1145\/390018.808314"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Princ. of Prog. Lang. (1977)","DOI":"10.1145\/512950.512973"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Automatic discovery of linear restraints among variables of a program. Princ. of Prog. Lang., 84\u201397 (1978)","DOI":"10.1145\/512760.512770"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Debray, S.K., Muth, R., Weippert, M.: Alias analysis of executable code. Princ. of Prog. Lang., 12\u201324 (1998)","DOI":"10.1145\/268946.268948"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. Prog. Lang. Design and Impl., 155\u2013167 (2003)","DOI":"10.1145\/780822.781149"},{"key":"2_CR13","unstructured":"Fast library identification and recognition technology, DataRescue sa\/nv, Li\u00e8ge, Belgium, http:\/\/www.datarescue.com\/idabase\/flirt.htm"},{"key":"2_CR14","unstructured":"Granger, P.: Static analysis of arithmetic congruences. Int. J. of Comp. Math. (1989)"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1008678014487","volume":"11","author":"N. Halbwachs","year":"1997","unstructured":"Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design\u00a011(2), 157\u2013185 (1997)","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. Horwitz","year":"1990","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. Trans. on Prog. Lang. and Syst.\u00a012(1), 26\u201360 (1990)","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"2_CR17","unstructured":"IDAPro disassembler, http:\/\/www.datarescue.com\/idabase\/"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Larus, J.R., Schnarr, E.: EEL: Machine-independent executable editing. Prog. Lang. Design and Impl., 291\u2013300 (1995)","DOI":"10.1145\/223428.207163"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. Princ. of Prog. Lang. (2004)","DOI":"10.1145\/964001.964029"},{"key":"2_CR20","unstructured":"Mycroft. Type-based decompilation. In: European Symp. on Programming (1999)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Myers, E.W.: Efficient applicative data types. Princ. of Prog. Lang., 66\u201375 (1984)","DOI":"10.1145\/800017.800517"},{"key":"2_CR22","unstructured":"Pioli, A., Hind, M.: Combining interprocedural pointer analysis and conditional constant propagation. Tech. Rep. RC 21532(96749), IBM T.J.Watson Research Center (March 1999)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Pugh, W.: The Omega test:A fast and practical integer programming algorithm for dependence analysis. In: Supercomputing, pp. 4\u201313 (1991)","DOI":"10.1145\/125826.125848"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Field, J., Tip, F.: Aggregate structure identification and its application to program analysis. Princ. of Prog. Lang., 119\u2013132 (1999)","DOI":"10.1145\/292540.292553"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Reps, T., Rosay, G.: Precise interprocedural chopping. In: Found. of Softw. Eng. (1995)","DOI":"10.1145\/222124.222138"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/2166.357218","volume":"5","author":"T. Reps","year":"1983","unstructured":"Reps, T., Teitelbaum, T., Demers, A.: Incremental context-dependent analysis for languagebased editors. Trans. on Prog. Lang. and Syst.\u00a05(3), 449\u2013477 (1983)","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Rival, X.: Abstract interpretation based certification of assembly code. In: Int. Conf. on Verif., Model Checking, and Abs. Int. (2003)","DOI":"10.1007\/3-540-36384-X_7"},{"key":"2_CR28","unstructured":"Rugina, R., Rinard, M.C.: Symbolic bounds analysis of pointers, array indices, and accessed memory regions. ACM Press, New York"},{"key":"2_CR29","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications, ch.\u00a07","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, ch.\u00a07, pp. 189\u2013234. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Suzuki, N., Ishihata, K.: Implementation of an array bound checker. Princ. of Prog. Lang., 132\u2013143 (1977)","DOI":"10.21236\/ADA038191"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Xu, Z., Miller, B., Reps, T.: Safety checking of machine code. Prog. Lang. Design and Impl., 70\u201382 (2000)","DOI":"10.1145\/358438.349313"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24723-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T16:06:46Z","timestamp":1635782806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24723-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212973","9783540247234"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24723-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}