Browse State-of-the-Art › Variable misuse
Variable misuse
11 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 15 · with a code link: 11 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 15 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 15 of 15, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
1 Dec 2021 2 repositories listedThe fusion between a graph representation like Abstract Syntax Tree (AST) and a source code sequence makes the use of current approaches computationally intractable for large input sequence lengths.
-
16 Jun 2021 2 repositories listedThe goal of this paper is to evaluate and compare the extent of memorization and generalization in neural code intelligence models.
-
7 Jun 2021 2 repositories listedOur approach, SIVAND, uses simplification techniques that reduce the size of input programs of a CI model while preserving the predictions of the model.
-
21 Dec 2019 2 repositories listedWe fine-tune CuBERT on our benchmark tasks, and compare the resulting models to different variants of Word2Vec token embeddings, BiLSTM and Transformer models, as well as published state-of-the-art models, showing that…
-
3 Apr 2019 2 repositories listed Syntology 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 8 harvested samples)We show that it is beneficial to train a model that jointly and directly localizes and repairs variable-misuse bugs.
-
22 Nov 2024 1 repository listedProblem: However, prior studies overlook this aspect during the training and testing of neural bug detectors for dynamically typed languages.
-
17 Jun 2024 1 repository listedSome studies argue that code-LLMs perform well on coding tasks because they use self-attention and hidden representations to encode relations among input tokens.
-
16 Feb 2022 1 repository listedDeep learning models are widely used for solving challenging code processing tasks, such as code generation or code summarization.
-
29 Sep 2021 1 repository listedDesigning a suitable representation for code-reasoning tasks is challenging in aspects such as the kinds of program information to model, how to combine them, and how much context to consider.
-
9 Jul 2020 1 repository listedIn practice, edges are used both to represent intrinsic structure (e. g., abstract syntax trees of programs) and more abstract relations that aid reasoning for a downstream task (e. g., results of relevant program…
-
1 May 2020 1 repository listedBy studying a popular, non-trivial program repair task, variable-misuse identification, we explore the relative merits of traditional and hybrid model families for code representation.
-
Neuro-Symbolic Execution of Generic Source Code23 Mar 2023 0 repositories listedCan a Python program be executed statement-by-statement by neural networks composed according to the source code?
-
What does Transformer learn about source code?18 Jul 2022 0 repositories listedIn the field of source code processing, the transformer-based representation models have shown great powerfulness and have achieved state-of-the-art (SOTA) performance in many tasks.
-
Learning to Extend Program Graphs to Work-in-Progress Code28 May 2021 0 repositories listedSource code spends most of its time in a broken or incomplete state during software development.
-
Learning Semantic Program Embeddings with Graph Interval Neural Network18 May 2020 0 repositories listedLearning distributed representations of source code has been a challenging task for machine learning models.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections