Skip to content
← Back to explorer

CONCUR: Benchmarking LLMs for Concurrent Code Generation

Jue Huang, Tarek Mahmud, Corina Pasareanu, Guowei Yang · Mar 4, 2026 · Citations: 0

Data freshness

Extraction: Fresh

Check recency before relying on this page for active eval decisions. Use stale pages as context and verify against current hub results.

Metadata refreshed

Mar 4, 2026, 3:22 AM

Recent

Extraction refreshed

Mar 9, 2026, 5:23 PM

Fresh

Extraction source

Runtime deterministic fallback

Confidence 0.15

Abstract

Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering. Relevant benchmarks have been established to evaluate the code generation capabilities of LLMs. However, existing benchmarks focus primarily on sequential code, lacking the ability to effectively evaluate LLMs on concurrent code generation. Compared to sequential code, concurrent code exhibits greater complexity and possesses unique types of bugs, such as deadlocks and race conditions, that do not occur in sequential code. Therefore, a benchmark for evaluating sequential code generation cannot be useful for evaluating concurrent code generation with LLMs. To address this gap, we designed a benchmark CONCUR specifically aimed at evaluating the capability of LLMs to generate concurrent code. CONCUR consists of a base set of 43 concurrency problems derived from a standard concurrency textbook, together with 72 validated mutant variants, resulting in 115 total problems. The base problems serve as the semantic core of the benchmark, while the mutants expand linguistic and structural diversity. We conducted an evaluation of a range of LLMs on CONCUR, highlighting limitations of current models. Overall, our work provides a novel direction for evaluating the capability of LLMs to generate code with focus on concurrency.

Low-signal caution for protocol decisions

Use this page for context, then validate protocol choices against stronger HFEPX references before implementation decisions.

  • Extraction flags indicate low-signal or possible false-positive protocol mapping.
  • Extraction confidence is 0.15 (below strong-reference threshold).
  • No explicit evaluation mode was extracted from available metadata.
  • No benchmark/dataset or metric anchors were extracted.

HFEPX Relevance Assessment

This paper is adjacent to HFEPX scope and is best used for background context, not as a primary protocol reference.

Best use

Background context only

Use if you need

Background context only.

Main weakness

Extraction flags indicate low-signal or possible false-positive protocol mapping.

Trust level

Low

Eval-Fit Score

0/100 • Low

Treat as adjacent context, not a core eval-method reference.

Human Feedback Signal

Not explicit in abstract metadata

Evaluation Signal

Weak / implicit signal

HFEPX Fit

Adjacent candidate

Extraction confidence: Low

Field Provenance & Confidence

Each key protocol field shows extraction state, confidence band, and data source so you can decide whether to trust it directly or validate from full text.

Human Feedback Types

missing

None explicit

Confidence: Low Source: Runtime deterministic fallback missing

No explicit feedback protocol extracted.

Evidence snippet: Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering.

Evaluation Modes

missing

None explicit

Confidence: Low Source: Runtime deterministic fallback missing

Validate eval design from full paper text.

Evidence snippet: Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering.

Quality Controls

missing

Not reported

Confidence: Low Source: Runtime deterministic fallback missing

No explicit QC controls found.

Evidence snippet: Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering.

Benchmarks / Datasets

missing

Not extracted

Confidence: Low Source: Runtime deterministic fallback missing

No benchmark anchors detected.

Evidence snippet: Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering.

Reported Metrics

missing

Not extracted

Confidence: Low Source: Runtime deterministic fallback missing

No metric anchors detected.

Evidence snippet: Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering.

Rater Population

missing

Unknown

Confidence: Low Source: Runtime deterministic fallback missing

Rater source not explicitly reported.

Evidence snippet: Leveraging Large Language Models (LLMs) for code generation has increasingly emerged as a common practice in the domain of software engineering.

Human Data Lens

  • Uses human feedback: No
  • Feedback types: None
  • Rater population: Unknown
  • Unit of annotation: Unknown
  • Expertise required: Coding
  • Extraction source: Runtime deterministic fallback

Evaluation Lens

  • Evaluation modes:
  • Agentic eval: None
  • Quality controls: Not reported
  • Confidence: 0.15
  • Flags: low_signal, possible_false_positive, runtime_fallback_extraction

Protocol And Measurement Signals

Benchmarks / Datasets

No benchmark or dataset names were extracted from the available abstract.

Reported Metrics

No metric terms were extracted from the available abstract.

Research Brief

Deterministic synthesis

Relevant benchmarks have been established to evaluate the code generation capabilities of LLMs. HFEPX protocol signal is limited in abstract-level metadata, so treat it as adjacent context. Updated from current HFEPX corpus.

Generated Mar 9, 2026, 5:23 PM · Grounded in abstract + metadata only

Key Takeaways

  • Relevant benchmarks have been established to evaluate the code generation capabilities of LLMs.
  • However, existing benchmarks focus primarily on sequential code, lacking the ability to effectively evaluate LLMs on concurrent code generation.

Researcher Actions

  • Treat this as method context, then pivot to protocol-specific HFEPX hubs.
  • Identify benchmark choices from full text before operationalizing conclusions.
  • Verify metric definitions before comparing against your eval pipeline.

Caveats

  • Generated from title, abstract, and extracted metadata only; full-paper implementation details are not parsed.
  • Low-signal flag detected: protocol relevance may be indirect.

Research Summary

Contribution Summary

  • Relevant benchmarks have been established to evaluate the code generation capabilities of LLMs.
  • However, existing benchmarks focus primarily on sequential code, lacking the ability to effectively evaluate LLMs on concurrent code generation.
  • Therefore, a benchmark for evaluating sequential code generation cannot be useful for evaluating concurrent code generation with LLMs.

Why It Matters For Eval

  • Relevant benchmarks have been established to evaluate the code generation capabilities of LLMs.
  • However, existing benchmarks focus primarily on sequential code, lacking the ability to effectively evaluate LLMs on concurrent code generation.

Researcher Checklist

  • Gap: Human feedback protocol is explicit

    No explicit human feedback protocol detected.

  • Gap: Evaluation mode is explicit

    No clear evaluation mode extracted.

  • Gap: Quality control reporting appears

    No calibration/adjudication/IAA control explicitly detected.

  • Gap: Benchmark or dataset anchors are present

    No benchmark/dataset anchor extracted from abstract.

  • Gap: Metric reporting is present

    No metric terms extracted.

Category-Adjacent Papers (Broader Context)

These papers are nearby in arXiv category and useful for broader context, but not necessarily protocol-matched to this paper.

Need human evaluators for your AI research? Scale annotation with expert AI Trainers.