Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2022
DOI: 10.1109/tse.2020.2979701
|View full text |Cite
|
Sign up to set email alerts
|

Reinforcement-Learning-Guided Source Code Summarization Using Hierarchical Attention

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 75 publications
(38 citation statements)
references
References 67 publications
0
36
0
Order By: Relevance
“…Our proposed technique is a deep model based on RNN and comprised of pyramids in which the outcome of the lower pyramids turns into the inputs to the higher pyramids. HANet [39] focuses on the document level classification that a document has K sentences, and each sentence contains T i words, where wit with t integral [1, T ] represents the words in the ith sentence. HANet structural design is explained in Fig.…”
Section: Classificationmentioning
confidence: 99%
“…Our proposed technique is a deep model based on RNN and comprised of pyramids in which the outcome of the lower pyramids turns into the inputs to the higher pyramids. HANet [39] focuses on the document level classification that a document has K sentences, and each sentence contains T i words, where wit with t integral [1, T ] represents the words in the ith sentence. HANet structural design is explained in Fig.…”
Section: Classificationmentioning
confidence: 99%
“…Scanner sc = new Scanner (System.in); int A = sc.nextInt(); int B = sc.nextInt(); int C = sc.nextInt(); if( C <= A + B ) System.out.println (" Yes "); else System.out.println (" No "); Syntax n = int (input ()) if n == 12 : print ( 1 ) else : print (n + 1) Reference A , B , C = map (int ,input ().split ()) if A + B < C : print (" No ") else : print (" Yes ") Generated A , B = map (int ,input ().split ()) if A == B : print (" YES ") else : print (" NO ") et al., 2018;Wang et al, 2020b;Wan et al, 2019;Hua et al, 2021) propose to integrate the semantics of code from different views (e.g., the tokens, AST and control-flow graph) into a hybrid feature space, and put forward a hybrid representation approach, for the task of code summarization, code search and code clone detection. As for graph-based representations several works resort to parse the program into a graph (e.g., augmented AST, controlflow graph, and data-flow graph) (Li et al, 2015;LeClair et al, 2020;Wan et al, 2019;Sui et al, 2020;.…”
Section: Semanticmentioning
confidence: 99%
“…They input an AST structure and sequential content of code segments into a deep reinforcement learning framework (i.e., actor-critic network). Then, Wang et al [20] extended the method Hybrid-DRL. They used a hierarchical attention network by considering multiple code features, such as type-augmented ASTs and program control flows.…”
Section: Related Workmentioning
confidence: 99%
“…In our empirical study, we choose code corpus 5 gathered by Hu et al [18] as our empirical subjects, since this code corpus have been widely used in previous studies for code comment generation [18] [11][19] [20][21] [22].…”
Section: A Code Corpusmentioning
confidence: 99%
See 1 more Smart Citation