{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/end-to-end-prediction-of-buffer-overruns-from","title":"End-to-End Prediction of Buffer Overruns from Raw Source Code via Neural Memory Networks","arxiv_id":"1703.02458","date":"2017-03-07","proceeding":null,"authors":["Min-Je Choi","Sehun Jeong","Hakjoo Oh","Jaegul Choo"],"abstract":"Detecting buffer overruns from a source code is one of the most common and\nyet challenging tasks in program analysis. Current approaches have mainly\nrelied on rigid rules and handcrafted features devised by a few experts,\nlimiting themselves in terms of flexible applicability and robustness due to\ndiverse bug patterns and characteristics existing in sophisticated real-world\nsoftware programs. In this paper, we propose a novel, data-driven approach that\nis completely end-to-end without requiring any hand-crafted features, thus free\nfrom any program language-specific structural limitations. In particular, our\napproach leverages a recently proposed neural network model called memory\nnetworks that have shown the state-of-the-art performances mainly in\nquestion-answering tasks. Our experimental results using source codes\ndemonstrate that our proposed model is capable of accurately detecting simple\nbuffer overruns. We also present in-depth analyses on how a memory network can\nlearn to understand the semantics in programming languages solely from raw\nsource codes, such as tracing variables of interest, identifying numerical\nvalues, and performing their quantitative comparisons.","url_abs":"http://arxiv.org/abs/1703.02458v1","url_pdf":"http://arxiv.org/pdf/1703.02458v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"end-to-end-prediction-of-buffer-overruns-from","repo_url":"https://github.com/mjc92/buffer_overrun_memory_networks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"question-answering","task_name":"Question Answering"}],"methods":[{"method_slug":"memory-network","method_name":"Memory Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"mjc92/buffer_overrun_memory_networks","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"42f54a05a56f49663100e64f43b39ce2772e565aeddc6f75d381222e3979b43b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}