{"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/c-code","name":"C++ code","slug":"c-code","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":91,"papers_with_code":33,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":91,"of":91,"of_with_code":33,"tagged_in_all":91,"counts":{"archive_papers_tagged":91,"with_a_code_link":33,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":91,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/segformer-simple-and-efficient-design-for","slug":"segformer-simple-and-efficient-design-for","title":"SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers","date":"2021-05-31","arxiv_id":"2105.15203","repositories_listed":28,"syntology":{"n":86,"n_ran":66,"n_constructed":22,"n_ran_checked":52,"n_instrument":14,"n_unverified":20,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":20,"phrase":"66 ran (of which 22 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 14 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/segformer-simple-and-efficient-design-for#ran","syntology_url":"https://syntology.ai/paper/2105.15203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.15203"}},"official":{"repos":["NVlabs/SegFormer"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","unlocated"]}}},{"url":"/paper/opengm-a-c-library-for-discrete-graphical","slug":"opengm-a-c-library-for-discrete-graphical","title":"OpenGM: A C++ Library for Discrete Graphical Models","date":"2012-06-01","arxiv_id":"1206.0111","repositories_listed":4,"syntology":null},{"url":"/paper/m-nca-texture-generation-with-ultra-compact","slug":"m-nca-texture-generation-with-ultra-compact","title":"$μ$NCA: Texture Generation with Ultra-Compact Neural Cellular Automata","date":"2021-11-26","arxiv_id":"2111.13545","repositories_listed":3,"syntology":null},{"url":"/paper/neural-transfer-learning-for-repairing","slug":"neural-transfer-learning-for-repairing","title":"Neural Transfer Learning for Repairing Security Vulnerabilities in C Code","date":"2021-04-16","arxiv_id":"2104.08308","repositories_listed":3,"syntology":null},{"url":"/paper/fpgadnn-co-design-an-efficient-design","slug":"fpgadnn-co-design-an-efficient-design","title":"FPGA/DNN Co-Design: An Efficient Design Methodology for IoT Intelligence on the Edge","date":"2019-04-09","arxiv_id":"1904.04421","repositories_listed":3,"syntology":null},{"url":"/paper/pl-slam-a-stereo-slam-system-through-the","slug":"pl-slam-a-stereo-slam-system-through-the","title":"PL-SLAM: a Stereo SLAM System through the Combination of Points and Line Segments","date":"2017-05-26","arxiv_id":"1705.09479","repositories_listed":3,"syntology":null},{"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"]}}},{"url":"/paper/program-semantic-inequivalence-game-with","slug":"program-semantic-inequivalence-game-with","title":"Program Semantic Inequivalence Game with Large Language Models","date":"2025-05-02","arxiv_id":"2505.03818","repositories_listed":1,"syntology":null},{"url":"/paper/gprat-gaussian-process-regression-with","slug":"gprat-gaussian-process-regression-with","title":"GPRat: Gaussian Process Regression with Asynchronous Tasks","date":"2025-04-30","arxiv_id":"2505.00136","repositories_listed":1,"syntology":null},{"url":"/paper/eiqp-execution-time-certified-and","slug":"eiqp-execution-time-certified-and","title":"EIQP: Execution-time-certified and Infeasibility-detecting QP Solver","date":"2025-02-11","arxiv_id":"2502.07738","repositories_listed":1,"syntology":null},{"url":"/paper/c-code-generation-considered-unnecessary-go","slug":"c-code-generation-considered-unnecessary-go","title":"C codegen considered unnecessary: go directly to binary, do not pass C. Compilation of Julia code for deployment in model-based engineering","date":"2025-02-03","arxiv_id":"2502.01128","repositories_listed":1,"syntology":null},{"url":"/paper/fortran2cpp-automating-fortran-to-c-migration","slug":"fortran2cpp-automating-fortran-to-c-migration","title":"Fortran2CPP: Automating Fortran-to-C++ Translation using LLMs via Multi-Turn Dialogue and Dual-Agent Integration","date":"2024-12-27","arxiv_id":"2412.19770","repositories_listed":1,"syntology":null},{"url":"/paper/scenegenagent-precise-industrial-scene","slug":"scenegenagent-precise-industrial-scene","title":"SceneGenAgent: Precise Industrial Scene Generation with Coding Agent","date":"2024-10-29","arxiv_id":"2410.21909","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":3,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 3 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scenegenagent-precise-industrial-scene#ran","syntology_url":"https://syntology.ai/paper/2410.21909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21909"}},"official":{"repos":["thudm/scenegenagent"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/chatdbg-an-ai-powered-debugging-assistant","slug":"chatdbg-an-ai-powered-debugging-assistant","title":"ChatDBG: Augmenting Debugging with Large Language Models","date":"2024-03-25","arxiv_id":"2403.16354","repositories_listed":1,"syntology":null},{"url":"/paper/creating-a-dataset-supporting-translation","slug":"creating-a-dataset-supporting-translation","title":"Creating a Dataset for High-Performance Computing Code Translation using LLMs: A Bridge Between OpenMP Fortran and C++","date":"2023-07-15","arxiv_id":"2307.07686","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-decision-tree-ensembles-for-energy","slug":"dynamic-decision-tree-ensembles-for-energy","title":"Dynamic Decision Tree Ensembles for Energy-Efficient Inference on IoT Edge Nodes","date":"2023-06-16","arxiv_id":"2306.09789","repositories_listed":1,"syntology":null},{"url":"/paper/repobench-benchmarking-repository-level-code","slug":"repobench-benchmarking-repository-level-code","title":"RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems","date":"2023-06-05","arxiv_id":"2306.03091","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-era-in-software-security-towards-self","slug":"a-new-era-in-software-security-towards-self","title":"A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification","date":"2023-05-24","arxiv_id":"2305.14752","repositories_listed":1,"syntology":null},{"url":"/paper/hdcc-a-hyperdimensional-computing-compiler","slug":"hdcc-a-hyperdimensional-computing-compiler","title":"HDCC: A Hyperdimensional Computing compiler for classification on embedded systems and high-performance computing","date":"2023-04-24","arxiv_id":"2304.12398","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-cnn-training-with-transfer","slug":"privacy-preserving-cnn-training-with-transfer","title":"Privacy-Preserving CNN Training with Transfer Learning: Multiclass Logistic Regression","date":"2023-04-07","arxiv_id":"2304.03807","repositories_listed":1,"syntology":null},{"url":"/paper/open-source-skull-reconstruction-with-monai","slug":"open-source-skull-reconstruction-with-monai","title":"Open-Source Skull Reconstruction with MONAI","date":"2022-11-25","arxiv_id":"2211.14051","repositories_listed":1,"syntology":null},{"url":"/paper/cryptopt-verified-compilation-with-random","slug":"cryptopt-verified-compilation-with-random","title":"CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives (full version)","date":"2022-11-19","arxiv_id":"2211.10665","repositories_listed":1,"syntology":null},{"url":"/paper/learning-c-to-x86-translation-an-experiment","slug":"learning-c-to-x86-translation-an-experiment","title":"Learning C to x86 Translation: An Experiment in Neural Compilation","date":"2021-08-17","arxiv_id":"2108.07639","repositories_listed":1,"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/learning-c-to-x86-translation-an-experiment#ran","syntology_url":"https://syntology.ai/paper/2108.07639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07639"}},"official":{"repos":["jordiae/neural-compilers"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-execution-for-neural-program-synthesis","slug":"latent-execution-for-neural-program-synthesis","title":"Latent Execution for Neural Program Synthesis","date":"2021-06-29","arxiv_id":"2107.00101","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":2,"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/latent-execution-for-neural-program-synthesis#ran","syntology_url":"https://syntology.ai/paper/2107.00101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00101"}},"official":{"repos":["jungyhuk/latent-execution"],"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/break-it-fix-it-unsupervised-learning-for","slug":"break-it-fix-it-unsupervised-learning-for","title":"Break-It-Fix-It: Unsupervised Learning for Program Repair","date":"2021-06-11","arxiv_id":"2106.06600","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/break-it-fix-it-unsupervised-learning-for#ran","syntology_url":"https://syntology.ai/paper/2106.06600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06600"}},"official":{"repos":["michiyasunaga/bifi"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hybrid-deep-neural-networks-to-infer-state","slug":"hybrid-deep-neural-networks-to-infer-state","title":"Hybrid Deep Neural Networks to Infer State Models of Black-Box Systems","date":"2020-08-26","arxiv_id":"2008.11856","repositories_listed":1,"syntology":null},{"url":"/paper/dory-automatic-end-to-end-deployment-of-real","slug":"dory-automatic-end-to-end-deployment-of-real","title":"DORY: Automatic End-to-End Deployment of Real-World DNNs on Low-Cost IoT MCUs","date":"2020-08-17","arxiv_id":"2008.07127","repositories_listed":1,"syntology":null},{"url":"/paper/cpl-slam-efficient-and-certifiably-correct","slug":"cpl-slam-efficient-and-certifiably-correct","title":"CPL-SLAM: Efficient and Certifiably Correct Planar Graph-Based SLAM Using the Complex Number Representation","date":"2020-06-25","arxiv_id":"2007.06708","repositories_listed":1,"syntology":null},{"url":"/paper/simulated-annealing-algorithm-for-the","slug":"simulated-annealing-algorithm-for-the","title":"Simulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-c-code-generator-for-fast-inference-and","slug":"a-c-code-generator-for-fast-inference-and","title":"A C Code Generator for Fast Inference and Simple Deployment of Convolutional Neural Networks on Resource Constrained Systems","date":"2020-01-14","arxiv_id":"2001.05572","repositories_listed":1,"syntology":null},{"url":"/paper/genetic-algorithm-for-the-01-multidimensional","slug":"genetic-algorithm-for-the-01-multidimensional","title":"Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem","date":"2019-07-20","arxiv_id":"1908.08022","repositories_listed":1,"syntology":null},{"url":"/paper/cross-language-learning-for-program","slug":"cross-language-learning-for-program","title":"Cross-Language Learning for Program Classification using Bilateral Tree-Based Convolutional Neural Networks","date":"2017-10-17","arxiv_id":"1710.06159","repositories_listed":1,"syntology":null},{"url":"/paper/the-limits-of-mathematics-in-c","slug":"the-limits-of-mathematics-in-c","title":"The Limits of Mathematics (in C)","date":"1994-04-27","arxiv_id":"chao-dyn/9404003","repositories_listed":1,"syntology":null},{"url":null,"slug":"pr2-peephole-raw-pointer-rewriting-with-llms","title":"PR2: Peephole Raw Pointer Rewriting with LLMs for Translating C to Safer Rust","date":"2025-05-07","arxiv_id":"2505.04852","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-assisted-translation-of-legacy-fortran","title":"LLM-Assisted Translation of Legacy FORTRAN Codes to C++: A Cross-Platform Study","date":"2025-04-21","arxiv_id":"2504.15424","repositories_listed":0,"syntology":null},{"url":null,"slug":"classical-planning-with-llm-generated","title":"Classical Planning with LLM-Generated Heuristics: Challenging the State of the Art with Python Code","date":"2025-03-24","arxiv_id":"2503.18809","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-practical-first-order-model-counting","title":"Towards Practical First-Order Model Counting","date":"2025-02-17","arxiv_id":"2502.12278","repositories_listed":0,"syntology":null},{"url":null,"slug":"skeleton-guided-translation-a-benchmarking","title":"Skeleton-Guided-Translation: A Benchmarking Framework for Code Repository Translation with Fine-Grained Quality Evaluation","date":"2025-01-27","arxiv_id":"2501.16050","repositories_listed":0,"syntology":null},{"url":null,"slug":"keras-sig-efficient-path-signature","title":"Keras Sig: Efficient Path Signature Computation on GPU in Keras 3","date":"2025-01-14","arxiv_id":"2501.08455","repositories_listed":0,"syntology":null},{"url":null,"slug":"helping-llms-improve-code-generation-using","title":"Helping LLMs Improve Code Generation Using Feedback from Testing and Static Analysis","date":"2024-12-19","arxiv_id":"2412.14841","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-complex-word-embeddings-in-classical","title":"Learning Complex Word Embeddings in Classical and Quantum Spaces","date":"2024-12-18","arxiv_id":"2412.13745","repositories_listed":0,"syntology":null},{"url":null,"slug":"pattern-matching-in-ai-compilers-and-its","title":"Pattern Matching in AI Compilers and its Formalization (Extended Version)","date":"2024-12-18","arxiv_id":"2412.13398","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnn-based-code-annotation-logic-for","title":"GNN-Based Code Annotation Logic for Establishing Security Boundaries in C Code","date":"2024-11-18","arxiv_id":"2411.11567","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-efficient-bayesian-analysis-of","title":"Fast and Efficient Bayesian Analysis of Structural Vector Autoregressions Using the R Package bsvars","date":"2024-10-19","arxiv_id":"2410.15090","repositories_listed":0,"syntology":null},{"url":null,"slug":"ompar-automatic-parallelization-with-ai","title":"OMPar: Automatic Parallelization with AI-Driven Source-to-Source Compilation","date":"2024-09-23","arxiv_id":"2409.14771","repositories_listed":0,"syntology":null},{"url":null,"slug":"vulnllmeval-a-framework-for-evaluating-large","title":"VulnLLMEval: A Framework for Evaluating Large Language Models in Software Vulnerability Detection and Patching","date":"2024-09-16","arxiv_id":"2409.10756","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-llms-any-good-for-high-level-synthesis","title":"Are LLMs Any Good for High-Level Synthesis?","date":"2024-08-19","arxiv_id":"2408.10428","repositories_listed":0,"syntology":null},{"url":null,"slug":"deeploy-enabling-energy-efficient-deployment","title":"Deeploy: Enabling Energy-Efficient Deployment of Small Language Models On Heterogeneous Microcontrollers","date":"2024-08-08","arxiv_id":"2408.04413","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-c-c-program-repair-for-high-level","title":"Automated C/C++ Program Repair for High-Level Synthesis via Large Language Models","date":"2024-07-04","arxiv_id":"2407.03889","repositories_listed":0,"syntology":null},{"url":null,"slug":"transforming-software-development-evaluating","title":"Transforming Software Development: Evaluating the Efficiency and Challenges of GitHub Copilot in Real-World Projects","date":"2024-06-25","arxiv_id":"2406.17910","repositories_listed":0,"syntology":null},{"url":null,"slug":"vulnerability-detection-with-deep-learning","title":"Vulnerability Detection in C/C++ Code with Deep Learning","date":"2024-05-20","arxiv_id":"2405.12384","repositories_listed":0,"syntology":null},{"url":null,"slug":"python-based-reinforcement-learning-on","title":"Python-Based Reinforcement Learning on Simulink Models","date":"2024-05-14","arxiv_id":"2405.08567","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-creation-of-source-code-variants-of","title":"Automated Creation of Source Code Variants of a Cryptographic Hash Function Implementation Using Generative Pre-Trained Transformer Models","date":"2024-04-24","arxiv_id":"2404.15681","repositories_listed":0,"syntology":null},{"url":null,"slug":"register-your-forests-decision-tree-ensemble","title":"Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation","date":"2024-04-10","arxiv_id":"2404.06846","repositories_listed":0,"syntology":null},{"url":null,"slug":"smart-structural-health-monitoring-shm-system","title":"Smart structural health monitoring (SHM) system for on-board localization of defects in pipes using torsional ultrasonic guided waves","date":"2024-03-17","arxiv_id":"2403.11110","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-to-generate-system","title":"Large Language Models to Generate System-Level Test Programs Targeting Non-functional Properties","date":"2024-03-15","arxiv_id":"2403.10086","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-automated-code-vulnerability-repair","title":"Enhanced Automated Code Vulnerability Repair using Large Language Models","date":"2024-01-08","arxiv_id":"2401.03741","repositories_listed":0,"syntology":null},{"url":null,"slug":"compcodevet-a-compiler-guided-validation-and","title":"CompCodeVet: A Compiler-guided Validation and Enhancement Approach for Code Dataset","date":"2023-11-11","arxiv_id":"2311.06505","repositories_listed":0,"syntology":null},{"url":null,"slug":"safurai-csharp-harnessing-synthetic-data-to","title":"Safurai-Csharp: Harnessing Synthetic Data to improve language-specific Code LLM","date":"2023-11-06","arxiv_id":"2311.03243","repositories_listed":0,"syntology":null},{"url":null,"slug":"securefalcon-the-next-cyber-reasoning-system","title":"SecureFalcon: Are We There Yet in Automated Software Vulnerability Detection with LLMs?","date":"2023-07-13","arxiv_id":"2307.06616","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-toolbox-for-fast-interval-arithmetic-in","title":"A Toolbox for Fast Interval Arithmetic in numpy with an Application to Formal Verification of Neural Network Controlled Systems","date":"2023-06-27","arxiv_id":"2306.15340","repositories_listed":0,"syntology":null},{"url":null,"slug":"locksynth-deriving-synchronization-code-for","title":"Locksynth: Deriving Synchronization Code for Concurrent Data Structures with ASP","date":"2023-05-20","arxiv_id":"2305.18225","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-zero-shot-code-cloning-with","title":"Neuro-symbolic Zero-Shot Code Cloning with Cross-Language Intermediate Representation","date":"2023-04-26","arxiv_id":"2304.13350","repositories_listed":0,"syntology":null},{"url":null,"slug":"pigeon-optimizing-cuda-code-generator-for-end","title":"Hector: An Efficient Programming and Compilation Framework for Implementing Relational Graph Neural Networks in GPU Architectures","date":"2023-01-16","arxiv_id":"2301.06284","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-c-retargetable-decompilation-using","title":"Beyond the C: Retargetable Decompilation using Neural Machine Translation","date":"2022-12-17","arxiv_id":"2212.08950","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interpretative-and-adaptive-mpc-for","title":"An interpretative and adaptive MPC for nonlinear systems","date":"2022-09-04","arxiv_id":"2209.01513","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rapid-prototype-mpc-tool-based-on-gproms","title":"A rapid-prototype MPC tool based on gPROMS platform","date":"2022-08-31","arxiv_id":"2209.00092","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardware-in-the-loop-simulation-of-a-uav","title":"Hardware-in-the-loop simulation of a UAV autonomous landing algorithm implemented in SoC FPGA","date":"2022-07-25","arxiv_id":"2207.12198","repositories_listed":0,"syntology":null},{"url":null,"slug":"grapheye-a-novel-solution-for-detecting","title":"GraphEye: A Novel Solution for Detecting Vulnerable Functions Based on Graph Attention Network","date":"2022-02-05","arxiv_id":"2202.02501","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-nonlinear-mpc-strategy-with-full","title":"Real-time Nonlinear MPC Strategy with Full Vehicle Validation for Autonomous Driving","date":"2021-10-07","arxiv_id":"2110.03349","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-execution-for-neural-program-synthesis-1","title":"Latent Execution for Neural Program Synthesis Beyond Domain-Specific Languages","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"embedded-model-predictive-controller-on-low","title":"Embedded Model Predictive Controller on Low-Cost Low-End Microcontroller for Electrical Drives","date":"2021-05-18","arxiv_id":"2105.08623","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-context-attention-fusion-neural-network","title":"Multi-context Attention Fusion Neural Network for Software Vulnerability Identification","date":"2021-04-19","arxiv_id":"2104.09225","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-threaded-memory-efficient-crossover-in","title":"Multi-threaded Memory Efficient Crossover in C++ for Generational Genetic Programming","date":"2020-09-22","arxiv_id":"2009.10460","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-neural-networks-for-real-time","title":"Designing Neural Networks for Real-Time Systems","date":"2020-08-26","arxiv_id":"2008.11830","repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-type-safety-in-go-an-empirical-study","title":"Breaking Type Safety in Go: An Empirical Study on the Usage of the unsafe Package","date":"2020-06-17","arxiv_id":"2006.09973","repositories_listed":0,"syntology":null},{"url":null,"slug":"fp-stereo-hardware-efficient-stereo-vision","title":"FP-Stereo: Hardware-Efficient Stereo Vision for Embedded Applications","date":"2020-06-05","arxiv_id":"2006.03250","repositories_listed":0,"syntology":null},{"url":null,"slug":"gclique-an-open-source-genetic-algorithm-for","title":"GCLIQUE: An Open Source Genetic Algorithm for the Maximum Clique Problem","date":"2020-05-15","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-physics-derived-code-generation-for","title":"Automated Physics-Derived Code Generation for Sensor Fusion and State Estimation","date":"2020-04-28","arxiv_id":"2004.13873","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-for-semi-automatic-precision-and","title":"A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning","date":"2020-02-10","arxiv_id":"2002.03869","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-layer-optimizations-for-end-to-end-data","title":"Multi-layer Optimizations for End-to-End Data Analytics","date":"2020-01-10","arxiv_id":"2001.03541","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-research-to-production-and-back","title":"From Research to Production and Back: Ludicrously Fast Neural Machine Translation","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-language-models-for-any-code-1","title":"Structural Language Models for Any-Code Generation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-neural-decompilation","title":"Towards Neural Decompilation","date":"2019-05-20","arxiv_id":"1905.08325","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-the-complexity-and-accuracy-of","title":"A Study of the Complexity and Accuracy of Direction of Arrival Estimation Methods Based on GCC-PHAT for a Pair of Close Microphones","date":"2018-11-28","arxiv_id":"1811.11787","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-flexible-multi-cue","title":"A General Framework for Flexible Multi-Cue Photometric Point Cloud Registration","date":"2017-09-13","arxiv_id":"1709.05945","repositories_listed":0,"syntology":null},{"url":null,"slug":"siminf-an-r-package-for-data-driven","title":"SimInf: An R package for Data-driven Stochastic Disease Spread Simulations","date":"2016-05-04","arxiv_id":"1605.01421","repositories_listed":0,"syntology":null},{"url":null,"slug":"compilation-as-a-typed-edsl-to-edsl","title":"Compilation as a Typed EDSL-to-EDSL Transformation","date":"2016-03-29","arxiv_id":"1603.08865","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-pose-estimation-piggybacked-on","title":"Real-Time Pose Estimation Piggybacked on Object Detection","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"high-performance-computing-of-gene-regulatory","title":"High Performance Computing of Gene Regulatory Networks using a Message-Passing Model","date":"2015-07-24","arxiv_id":"1507.07039","repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-static-analysis-and-code-generation","title":"Utilizing Static Analysis and Code Generation to Accelerate Neural Networks","date":"2012-06-27","arxiv_id":"1206.6466","repositories_listed":0,"syntology":null}],"syntology_records":6,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/task/c-code/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/c-code/papers/ran/1","json":"/task/c-code/papers/ran/1.json","rows":6}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"14540fd49642941c06b3d44dff0077d990c481c3900fc4b3d73403eaa41607dd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}