{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":33,"tagged_in_all":91,"items":[{"url":"/paper/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":48,"n_unverified":38,"n_pointer_only":15}},{"url":"/paper/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","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","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","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","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","title":"Structural Language Models of Code","date":"2019-09-30","arxiv_id":"1910.00577","repositories_listed":2,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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":0,"n_unverified":11,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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","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","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","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","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":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/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_unverified":1,"n_pointer_only":2}},{"url":"/paper/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":0,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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}],"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}