{"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":"/task/code-completion/papers/ran/1","list_of":"/task/code-completion","task":"Code Completion","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,42],"of":42,"counts":{"archive_papers_tagged":212,"with_a_code_link":108,"where_syntology_ran_a_sample":42,"not_listed_spam_title":0,"listed":212,"listed_where_code_ran":42,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/code-completion/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/plan-for-speed-dilated-scheduling-for-masked","slug":"plan-for-speed-dilated-scheduling-for-masked","title":"Plan for Speed -- Dilated Scheduling for Masked Diffusion Language Models","date":"2025-06-23","arxiv_id":"2506.19037","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/plan-for-speed-dilated-scheduling-for-masked#ran","syntology_url":"https://syntology.ai/paper/2506.19037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.19037"}},"official":null}},{"url":"/paper/swe-dev-evaluating-and-training-autonomous","slug":"swe-dev-evaluating-and-training-autonomous","title":"SWE-Dev: Evaluating and Training Autonomous Feature-Driven Software Development","date":"2025-05-22","arxiv_id":"2505.16975","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/swe-dev-evaluating-and-training-autonomous#ran","syntology_url":"https://syntology.ai/paper/2505.16975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16975"}},"official":{"repos":["dorothyduuu/swe-dev"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/noesis-differentially-private-knowledge","slug":"noesis-differentially-private-knowledge","title":"NoEsis: Differentially Private Knowledge Transfer in Modular LLM Adaptation","date":"2025-04-25","arxiv_id":"2504.18147","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/noesis-differentially-private-knowledge#ran","syntology_url":"https://syntology.ai/paper/2504.18147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.18147"}},"official":null}},{"url":"/paper/fea-bench-a-benchmark-for-evaluating","slug":"fea-bench-a-benchmark-for-evaluating","title":"FEA-Bench: A Benchmark for Evaluating Repository-Level Code Generation for Feature Implementation","date":"2025-03-09","arxiv_id":"2503.06680","repositories_listed":0,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/fea-bench-a-benchmark-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2503.06680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.06680"}},"official":null}},{"url":"/paper/longspec-long-context-speculative-decoding","slug":"longspec-long-context-speculative-decoding","title":"LongSpec: Long-Context Speculative Decoding with Efficient Drafting and Verification","date":"2025-02-24","arxiv_id":"2502.17421","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/longspec-long-context-speculative-decoding#ran","syntology_url":"https://syntology.ai/paper/2502.17421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17421"}},"official":{"repos":["sail-sg/longspec"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/aixcoder-7b-a-lightweight-and-effective-large","slug":"aixcoder-7b-a-lightweight-and-effective-large","title":"aiXcoder-7B: A Lightweight and Effective Large Language Model for Code Processing","date":"2024-10-17","arxiv_id":"2410.13187","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/aixcoder-7b-a-lightweight-and-effective-large#ran","syntology_url":"https://syntology.ai/paper/2410.13187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13187"}},"official":{"repos":["aixcoder-plugin/aixcoder-7b"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cursorcore-assist-programming-through","slug":"cursorcore-assist-programming-through","title":"CursorCore: Assist Programming through Aligning Anything","date":"2024-10-09","arxiv_id":"2410.07002","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cursorcore-assist-programming-through#ran","syntology_url":"https://syntology.ai/paper/2410.07002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07002"}},"official":{"repos":["TechxGenus/CursorCore"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codev-bench-how-do-llms-understand-developer","slug":"codev-bench-how-do-llms-understand-developer","title":"Codev-Bench: How Do LLMs Understand Developer-Centric Code Completion?","date":"2024-10-02","arxiv_id":"2410.01353","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/codev-bench-how-do-llms-understand-developer#ran","syntology_url":"https://syntology.ai/paper/2410.01353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01353"}},"official":{"repos":["LingmaTongyi/Codev-Bench"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-verilogeval-newer-llms-in-context","slug":"revisiting-verilogeval-newer-llms-in-context","title":"Revisiting VerilogEval: A Year of Improvements in Large-Language Models for Hardware Code Generation","date":"2024-08-20","arxiv_id":"2408.11053","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-verilogeval-newer-llms-in-context#ran","syntology_url":"https://syntology.ai/paper/2408.11053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11053"}},"official":{"repos":["nvlabs/verilog-eval"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/long-code-arena-a-set-of-benchmarks-for-long","slug":"long-code-arena-a-set-of-benchmarks-for-long","title":"Long Code Arena: a Set of Benchmarks for Long-Context Code Models","date":"2024-06-17","arxiv_id":"2406.11612","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/long-code-arena-a-set-of-benchmarks-for-long#ran","syntology_url":"https://syntology.ai/paper/2406.11612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11612"}},"official":{"repos":["jetbrains-research/lca-baselines"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-llm-assisted-easy-to-trigger-backdoor","slug":"an-llm-assisted-easy-to-trigger-backdoor","title":"An LLM-Assisted Easy-to-Trigger Backdoor Attack on Code Completion Models: Injecting Disguised Vulnerabilities against Strong Detection","date":"2024-06-10","arxiv_id":"2406.06822","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-llm-assisted-easy-to-trigger-backdoor#ran","syntology_url":"https://syntology.ai/paper/2406.06822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06822"}},"official":{"repos":["datasec-lab/codebreaker"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semcoder-training-code-language-models-with","slug":"semcoder-training-code-language-models-with","title":"SemCoder: Training Code Language Models with Comprehensive Semantics Reasoning","date":"2024-06-03","arxiv_id":"2406.01006","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/semcoder-training-code-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2406.01006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01006"}},"official":{"repos":["arise-lab/semcoder"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dataflow-guided-retrieval-augmentation-for","slug":"dataflow-guided-retrieval-augmentation-for","title":"Dataflow-Guided Retrieval Augmentation for Repository-Level Code Completion","date":"2024-05-30","arxiv_id":"2405.19782","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/dataflow-guided-retrieval-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2405.19782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19782"}},"official":{"repos":["nju-websoft/DraCo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/superposed-decoding-multiple-generations-from","slug":"superposed-decoding-multiple-generations-from","title":"Superposed Decoding: Multiple Generations from a Single Autoregressive Inference Pass","date":"2024-05-28","arxiv_id":"2405.18400","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":1,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":11,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/superposed-decoding-multiple-generations-from#ran","syntology_url":"https://syntology.ai/paper/2405.18400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18400"}},"official":{"repos":["raivnlab/superposeddecoding"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":1,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-safety-generalization-challenges-of","slug":"exploring-safety-generalization-challenges-of","title":"CodeAttack: Revealing Safety Generalization Challenges of Large Language Models via Code Completion","date":"2024-03-12","arxiv_id":"2403.07865","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-safety-generalization-challenges-of#ran","syntology_url":"https://syntology.ai/paper/2403.07865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07865"}},"official":{"repos":["renqibing/CodeAttack"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/repohyper-better-context-retrieval-is-all-you","slug":"repohyper-better-context-retrieval-is-all-you","title":"RepoHyper: Search-Expand-Refine on Semantic Graphs for Repository-Level Code Completion","date":"2024-03-10","arxiv_id":"2403.06095","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/repohyper-better-context-retrieval-is-all-you#ran","syntology_url":"https://syntology.ai/paper/2403.06095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06095"}},"official":{"repos":["fsoft-ai4code/repohyper"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluation-of-llms-on-syntax-aware-code-fill","slug":"evaluation-of-llms-on-syntax-aware-code-fill","title":"Evaluation of LLMs on Syntax-Aware Code Fill-in-the-Middle Tasks","date":"2024-03-07","arxiv_id":"2403.04814","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluation-of-llms-on-syntax-aware-code-fill#ran","syntology_url":"https://syntology.ai/paper/2403.04814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04814"}},"official":{"repos":["gonglinyuan/safim"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codechameleon-personalized-encryption","slug":"codechameleon-personalized-encryption","title":"CodeChameleon: Personalized Encryption Framework for Jailbreaking Large Language Models","date":"2024-02-26","arxiv_id":"2402.16717","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/codechameleon-personalized-encryption#ran","syntology_url":"https://syntology.ai/paper/2402.16717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16717"}},"official":{"repos":["huizhang-l/codechameleon"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/effibench-benchmarking-the-efficiency-of","slug":"effibench-benchmarking-the-efficiency-of","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","date":"2024-02-03","arxiv_id":"2402.02037","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/effibench-benchmarking-the-efficiency-of#ran","syntology_url":"https://syntology.ai/paper/2402.02037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02037"}},"official":{"repos":["huangd1999/EffiBench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-large-language-models-write-parallel-code","slug":"can-large-language-models-write-parallel-code","title":"Can Large Language Models Write Parallel Code?","date":"2024-01-23","arxiv_id":"2401.12554","repositories_listed":1,"syntology":{"n":19,"n_ran":18,"n_constructed":0,"n_ran_checked":18,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/can-large-language-models-write-parallel-code#ran","syntology_url":"https://syntology.ai/paper/2401.12554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.12554"}},"official":{"repos":["parallelcodefoundry/ParEval"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/langbridge-multilingual-reasoning-without","slug":"langbridge-multilingual-reasoning-without","title":"LangBridge: Multilingual Reasoning Without Multilingual Supervision","date":"2024-01-19","arxiv_id":"2401.10695","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":12,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/langbridge-multilingual-reasoning-without#ran","syntology_url":"https://syntology.ai/paper/2401.10695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10695"}},"official":{"repos":["kaistAI/LangBridge"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/crosscodeeval-a-diverse-and-multilingual","slug":"crosscodeeval-a-diverse-and-multilingual","title":"CrossCodeEval: A Diverse and Multilingual Benchmark for Cross-File Code Completion","date":"2023-10-17","arxiv_id":"2310.11248","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/crosscodeeval-a-diverse-and-multilingual#ran","syntology_url":"https://syntology.ai/paper/2310.11248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11248"}},"official":null}},{"url":"/paper/bamboo-a-comprehensive-benchmark-for","slug":"bamboo-a-comprehensive-benchmark-for","title":"BAMBOO: A Comprehensive Benchmark for Evaluating Long Text Modeling Capacities of Large Language Models","date":"2023-09-23","arxiv_id":"2309.13345","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bamboo-a-comprehensive-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2309.13345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.13345"}},"official":{"repos":["rucaibox/bamboo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/longbench-a-bilingual-multitask-benchmark-for","slug":"longbench-a-bilingual-multitask-benchmark-for","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","date":"2023-08-28","arxiv_id":"2308.14508","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/longbench-a-bilingual-multitask-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2308.14508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14508"}},"official":{"repos":["thudm/longbench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/longcoder-a-long-range-pre-trained-language","slug":"longcoder-a-long-range-pre-trained-language","title":"LongCoder: A Long-Range Pre-trained Language Model for Code Completion","date":"2023-06-26","arxiv_id":"2306.14893","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/longcoder-a-long-range-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2306.14893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.14893"}},"official":{"repos":["microsoft/CodeBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/guiding-language-models-of-code-with-global","slug":"guiding-language-models-of-code-with-global","title":"Guiding Language Models of Code with Global Context using Monitors","date":"2023-06-19","arxiv_id":"2306.10763","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/guiding-language-models-of-code-with-global#ran","syntology_url":"https://syntology.ai/paper/2306.10763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10763"}},"official":{"repos":["microsoft/monitors4codegen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-of-code-fail-at","slug":"large-language-models-of-code-fail-at","title":"Large Language Models of Code Fail at Completing Code with Potential Bugs","date":"2023-06-06","arxiv_id":"2306.03438","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-of-code-fail-at#ran","syntology_url":"https://syntology.ai/paper/2306.03438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03438"}},"official":{"repos":["amazon-science/buggy-code-completion"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-static-evaluation-of-code-completion-by","slug":"a-static-evaluation-of-code-completion-by","title":"A Static Evaluation of Code Completion by Large Language Models","date":"2023-06-05","arxiv_id":"2306.03203","repositories_listed":0,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-static-evaluation-of-code-completion-by#ran","syntology_url":"https://syntology.ai/paper/2306.03203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03203"}},"official":null}},{"url":"/paper/how-effective-are-neural-networks-for-fixing","slug":"how-effective-are-neural-networks-for-fixing","title":"How Effective Are Neural Networks for Fixing Security Vulnerabilities","date":"2023-05-29","arxiv_id":"2305.18607","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-effective-are-neural-networks-for-fixing#ran","syntology_url":"https://syntology.ai/paper/2305.18607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18607"}},"official":{"repos":["lin-tan/llm-vul"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codet5-open-code-large-language-models-for","slug":"codet5-open-code-large-language-models-for","title":"CodeT5+: Open Code Large Language Models for Code Understanding and Generation","date":"2023-05-13","arxiv_id":"2305.07922","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/codet5-open-code-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2305.07922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07922"}},"official":{"repos":["salesforce/codet5"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/codekgc-code-language-model-for-generative","slug":"codekgc-code-language-model-for-generative","title":"CodeKGC: Code Language Model for Generative Knowledge Graph Construction","date":"2023-04-18","arxiv_id":"2304.09048","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/codekgc-code-language-model-for-generative#ran","syntology_url":"https://syntology.ai/paper/2304.09048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09048"}},"official":{"repos":["zjunlp/deepke"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/repocoder-repository-level-code-completion","slug":"repocoder-repository-level-code-completion","title":"RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation","date":"2023-03-22","arxiv_id":"2303.12570","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/repocoder-repository-level-code-completion#ran","syntology_url":"https://syntology.ai/paper/2303.12570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12570"}},"official":{"repos":["microsoft/codet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/more-than-you-ve-asked-for-a-comprehensive","slug":"more-than-you-ve-asked-for-a-comprehensive","title":"Not what you've signed up for: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection","date":"2023-02-23","arxiv_id":"2302.12173","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/more-than-you-ve-asked-for-a-comprehensive#ran","syntology_url":"https://syntology.ai/paper/2302.12173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12173"}},"official":{"repos":["greshake/llm-security","greshake/lm-safety"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/execution-based-code-generation-using-deep","slug":"execution-based-code-generation-using-deep","title":"Execution-based Code Generation using Deep Reinforcement Learning","date":"2023-01-31","arxiv_id":"2301.13816","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/execution-based-code-generation-using-deep#ran","syntology_url":"https://syntology.ai/paper/2301.13816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13816"}},"official":{"repos":["reddy-lab-code-research/PPOCoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cocomic-code-completion-by-jointly-modeling","slug":"cocomic-code-completion-by-jointly-modeling","title":"CoCoMIC: Code Completion By Jointly Modeling In-file and Cross-file Context","date":"2022-12-20","arxiv_id":"2212.10007","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cocomic-code-completion-by-jointly-modeling#ran","syntology_url":"https://syntology.ai/paper/2212.10007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10007"}},"official":{"repos":["amazon-science/cocomic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-lingual-evaluation-of-code-generation","slug":"multi-lingual-evaluation-of-code-generation","title":"Multi-lingual Evaluation of Code Generation Models","date":"2022-10-26","arxiv_id":"2210.14868","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multi-lingual-evaluation-of-code-generation#ran","syntology_url":"https://syntology.ai/paper/2210.14868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.14868"}},"official":{"repos":["amazon-research/mbxp-exec-eval"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unixcoder-unified-cross-modal-pre-training","slug":"unixcoder-unified-cross-modal-pre-training","title":"UniXcoder: Unified Cross-Modal Pre-training for Code Representation","date":"2022-03-08","arxiv_id":"2203.03850","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/unixcoder-unified-cross-modal-pre-training#ran","syntology_url":"https://syntology.ai/paper/2203.03850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03850"}},"official":{"repos":["microsoft/CodeBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-syntax-guided-edit-decoder-for-neural","slug":"a-syntax-guided-edit-decoder-for-neural","title":"A Syntax-Guided Edit Decoder for Neural Program Repair","date":"2021-06-15","arxiv_id":"2106.08253","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":1,"n_ran_checked":9,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-syntax-guided-edit-decoder-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.08253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08253"}},"official":null}},{"url":"/paper/codexglue-a-machine-learning-benchmark","slug":"codexglue-a-machine-learning-benchmark","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","date":"2021-02-09","arxiv_id":"2102.04664","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/codexglue-a-machine-learning-benchmark#ran","syntology_url":"https://syntology.ai/paper/2102.04664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04664"}},"official":{"repos":["microsoft/CodeXGLUE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-for-code","slug":"adversarial-robustness-for-code","title":"Adversarial Robustness for Code","date":"2020-02-11","arxiv_id":"2002.04694","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-for-code#ran","syntology_url":"https://syntology.ai/paper/2002.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04694"}},"official":null}},{"url":"/paper/pythia-ai-assisted-code-completion-system","slug":"pythia-ai-assisted-code-completion-system","title":"Pythia: AI-assisted Code Completion System","date":"2019-11-29","arxiv_id":"1912.00742","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pythia-ai-assisted-code-completion-system#ran","syntology_url":"https://syntology.ai/paper/1912.00742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00742"}},"official":{"repos":["Microsoft/PTVS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-language-models-for-any-code","slug":"structural-language-models-for-any-code","title":"Structural Language Models of Code","date":"2019-09-30","arxiv_id":"1910.00577","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structural-language-models-for-any-code#ran","syntology_url":"https://syntology.ai/paper/1910.00577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00577"}},"official":{"repos":["tech-srl/slm-code-generation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}],"record_sha256":"2dfc596ed980ab5cc29f2df25d7d9ab771c96ad905dc7cd3506c9edf1340590f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}