Pith. sign in

REVIEW 2 cited by

An Empirical Study on Capability of Large Language Models in Understanding Code Semantics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.03611 v1 pith:MOA2XKQL submitted 2024-07-04 cs.SE cs.AI

classification cs.SEcs.AI
keywords codellmsmodelstaskssemanticsemanticstransformationsunderstanding
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large Language Models for Code (code LLMs) have demonstrated remarkable performance across various software engineering (SE) tasks, increasing the application of code LLMs in software development. Despite the success of code LLMs, there remain significant concerns about the actual capabilities and reliability of these models, "whether these models really learn the semantics of code from the training data and leverage the learned knowledge to perform the SE tasks". In this paper, we introduce EMPICA, a comprehensive framework designed to systematically and empirically evaluate the capabilities of code LLMs in understanding code semantics. Specifically, EMPICA systematically introduces controlled modifications/transformations into the input code and examines the models' responses. Generally, code LLMs must be robust to semantically equivalent code inputs and be sensitive to non-equivalent ones for all SE tasks. Specifically, for every SE task, given an input code snippet c and its semantic equivalent variants, code LLMs must robustly produce consistent/equivalent outputs while they are expected to generate different outputs for c and its semantic non-equivalent variants. Our experimental results on three representative code understanding tasks, including code summarization, method name prediction, and output prediction, reveal that the robustness and sensitivity of the state-of-the-art code LLMs to code transformations vary significantly across tasks and transformation operators. In addition, the code LLMs exhibit better robustness to the semantic preserving transformations than their sensitivity to the semantic non-preserving transformations. These results highlight a need to enhance the model's capabilities of understanding code semantics, especially the sensitivity property.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Correctness Assessment of Code Generated by Large Language Models Using Internal Representations

    cs.SE 2025-01 conditional novelty 6.0 of 10

    Internal hidden states of code LLMs carry a usable signal about whether the generated code is correct, and a lightweight probing classifier on those states predicts test-passing with F1 around 0.7 to 0.8 across benchmarks.

  2. Secret Breach Detection in Source Code with Large Language Models

    cs.SE 2025-04 conditional novelty 5.0 of 10

    Fine-tuned open-source LLMs classify regex-extracted secret candidates with 0.985 binary F1 and 0.982 multiclass F1 on the SecretBench benchmark.

Pith tools