{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/generative-code-modeling-with-graphs","title":"Generative Code Modeling with Graphs","arxiv_id":"1805.08490","date":"2018-05-22","proceeding":"ICLR 2019 5","authors":["Marc Brockschmidt","Miltiadis Allamanis","Alexander L. Gaunt","Oleksandr Polozov"],"abstract":"Generative models for source code are an interesting structured prediction\nproblem, requiring to reason about both hard syntactic and semantic constraints\nas well as about natural, likely programs. We present a novel model for this\nproblem that uses a graph to represent the intermediate state of the generated\noutput. The generative procedure interleaves grammar-driven expansion steps\nwith graph augmentation and neural message passing steps. An experimental\nevaluation shows that our new model can generate semantically meaningful\nexpressions, outperforming a range of strong baselines.","url_abs":"http://arxiv.org/abs/1805.08490v2","url_pdf":"http://arxiv.org/pdf/1805.08490v2.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":"generative-code-modeling-with-graphs","repo_url":"https://github.com/Microsoft/graph-based-code-modelling","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"structured-prediction","task_name":"Structured Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=1805.08490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08490"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Microsoft/graph-based-code-modelling","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":6},"by_repo_kind":{"official":{"samples":6,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"41126062eff8d5a5","entry":"clone_expansion_info","repo":"Microsoft/graph-based-code-modelling","repo_kind":"official","path":"Models/exprsynth/nagdecoder.py","file_url":"https://github.com/Microsoft/graph-based-code-modelling/blob/HEAD/Models/exprsynth/nagdecoder.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"41126062eff8d5a5"}},{"code_sha256_prefix":"20ec57b1c2cad6d8","entry":"clone_list_defaultdict","repo":"Microsoft/graph-based-code-modelling","repo_kind":"official","path":"Models/exprsynth/nagdecoder.py","file_url":"https://github.com/Microsoft/graph-based-code-modelling/blob/HEAD/Models/exprsynth/nagdecoder.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"20ec57b1c2cad6d8"}},{"code_sha256_prefix":"6faccfb8d143e208","entry":"get_fold","repo":"Microsoft/graph-based-code-modelling","repo_kind":"official","path":"Models/utils/dataset_split.py","file_url":"https://github.com/Microsoft/graph-based-code-modelling/blob/HEAD/Models/utils/dataset_split.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6faccfb8d143e208"}},{"code_sha256_prefix":"84443f6001f1c8bf","entry":"get_tokens_from_expansion","repo":"Microsoft/graph-based-code-modelling","repo_kind":"official","path":"Models/exprsynth/nagdecoder.py","file_url":"https://github.com/Microsoft/graph-based-code-modelling/blob/HEAD/Models/exprsynth/nagdecoder.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"84443f6001f1c8bf"}},{"code_sha256_prefix":"fe8f4e19856fbf84","entry":"make_rnn_cell","repo":"Microsoft/graph-based-code-modelling","repo_kind":"official","path":"Models/exprsynth/seqdecoder.py","file_url":"https://github.com/Microsoft/graph-based-code-modelling/blob/HEAD/Models/exprsynth/seqdecoder.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fe8f4e19856fbf84"}},{"code_sha256_prefix":"47603c9ebfb9ea85","entry":"predictable_shuffle","repo":"Microsoft/graph-based-code-modelling","repo_kind":"official","path":"Models/exprsynth/utils.py","file_url":"https://github.com/Microsoft/graph-based-code-modelling/blob/HEAD/Models/exprsynth/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"47603c9ebfb9ea85"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}