System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow
Proceedings of the 21st international conference on Software engineering
An optimal algorithm for the construction of the system dependence graph
Information Sciences—Applications: An International Journal
Transformation-Based Diagnosis of Student Programs for Programming Tutoring Systems
IEEE Transactions on Software Engineering
Construction of the System Dependence Graph for Web Application Slicing
SCAM '02 Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation
Displaying dependence graphs: a hierarchical approach
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Software verification and graph similarity for automated evaluation of students' assignments
Information and Software Technology
Hi-index | 0.00 |
With the development of education and computer, it has become an urgent demand for scoring programming questions automatically. This paper puts forward a semantic matching based automatic scoring method for C programming questions. The said method standardizes student programs and template programs, and then calculates their semantic similarity, so as to score student programs. Main idea: Firstly, convert student programs and template programs into an intermediate representation of programs (i.e. system dependence graph); secondly, carry out semantic equivalence conversion for the generated system dependence graph according to a series of standardization rules, so as to eliminate the diversification of program expression; thirdly, calculate the matching degree of the standardized system dependence graph, and score student programs according to the matching result and scoring rule.