Comparing Semantic Graph Representations of Source Code: The Case of Automatic Feedback on Programming Assignments

• Type: Article in International Scientific Journal
• Date: 2024

Authors

Paiva, JC (Author) Other; José Paulo Leal (Author) FCUP; Figueira, A (Author) FCUP

Journal

Title: Computer Science and Information Systems

Vol. 21

Pages: 117-142

ISSN: 1820-0214

Publisher: ComSIS Consortium

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 2 Citations

Other information

Authenticus ID: P-00Z-ZPV

DOI: 10.2298/csis230615004p

Abstract (EN): Static source code analysis techniques are gaining relevance in automated assessment of programming assignments as they can provide less rigorous evaluation and more comprehensive and formative feedback. These techniques focus on source code aspects rather than requiring effective code execution. To this end, syntactic and semantic information encoded in textual data is typically represented internally as graphs, after parsing and other preprocessing stages. Static automated assessment techniques, therefore, draw inferences from intermediate representations to determine the correctness of a solution and derive feedback. Consequently, achieving the most effective semantic graph representation of source code for the specific task is critical, impacting both techniques' accuracy, outcome, and execution time. This paper aims to provide a thorough comparison of the most widespread semantic graph representations for the automated assessment of programming assignments, including usage examples, facets, and costs for each of these representations. A benchmark has been conducted to assess their cost using the Abstract Syntax Tree (AST) as a baseline. The results demonstrate that the Code Property Graph (CPG) is the most feature -rich representation, but also the largest and most space -consuming (about 33% more than AST).

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 26