More Web Proxy on the site http://driver.im/

research-article

Algorithm recognition by static analysis and its application in students' submissions assessment

Authors:

Ahmad Taherkhani,

Ari KorhonenAuthors Info & Claims

Koli '08: Proceedings of the 8th International Conference on Computing Education Research

Pages 88 - 91

https://doi.org/10.1145/1595356.1595372

Published: 13 November 2008 Publication History

Abstract

Automatic program comprehension (PC) has been extensively studied for decades. It has been studied mainly from two different points of view: understanding the functionality of a program and understanding program structure. In this paper, we address the problem of automatic algorithm recognition and introduce a method based on static analysis to recognize algorithms. We discuss the applications of the method in the context of automatic assessment to widen the scope of programming assignments that can be checked automatically.

References

[1]

K. Ala-Mutka and H.-M. J&#228;rvinen. Assessment process for programming assignments. Advanced Learning Technologies, 2004. Proceedings. IEEE International Conference on, pages 181--185, 30 Aug.--1 Sept. 2004.

Digital Library

[2]

H. A. Basit and S. Jarzabek. Detecting higher-level similarity patterns in programs. In Proceedings of the 10th European Software Engineering Conference, pages 156--165. ACM, 2005.

Digital Library

[3]

I. Burnstein and F. Saner. An application of fuzzy reasoning to support automated program comprehension. In Proceedings of Seventh International Workshop on Program Comprehension, 1999., pages 66--73. IEEE, 1999.

Digital Library

[4]

S. Edwards. Improving student performance by evaluating how well students test their own programs. Journal on Educational Resources in Computing, 3(3):1--24, 2003.

Digital Library

[5]

B. S. Elenbogen and N. Seliya. Detecting outsourced student programming assignments. In Journal of Computing Sciences in Colleges, pages 50--57. ACM, 2007.

Digital Library

[6]

A. Erdem, W. L. Johnson, and S. Marsella. Task oriented software understanding. In Proceedings of the 13th IEEE International Conference on Automated Software Engineering, pages 230--239. IEEE, 1998.

Digital Library

[7]

M. Halstead. Elements of Software Science. North Holland, New York. Elsevier, 1977.

Digital Library

[8]

M. Harandi and J. Ning. Knowledge-based program analysis. Software IEEE, 7(4):74--81, January 1990.

Digital Library

[9]

C. Higgins, P. Symeonidis, and A. Tsintsifas. The marking system for CourseMaster. In Proceedings of the 7th annual conference on Innovation and Technology in Computer Science Education, pages 46--50. ACM Press, 2002.

Digital Library

[10]

W. Johnson and S. E. Proust: Knowledge-based program understanding. In IEEE Transactions on Software Engineering, volume SE-11, Issue 3, March 1985, pages 267--275. IEEE, 1984.

Digital Library

[11]

J. Joiner, W. Tsai, X. Chen, S. Subramanian, J. Sun, and H. Gandamaneni. Data-centered program understanding. In Proceedings of International Conference on Software Maintenance, pages 272--281. IEEE, 1994.

Digital Library

[12]

M. Joy, N. Griffiths, and R. Boyatt. The BOSS online submission and assessment system. In ACM Journal on Educational Resources in Computing, volume 5, number 3, September 2005. Article 2. ACM, 2005.

Digital Library

[13]

T. J. McCabe. A complexity measure. In IEEE Transactions on Software Engineering, volume SE-2, number 4, December 1976, pages 308--320, 1976.

Digital Library

[14]

D. Ourston. Program recognition. In IEEE Expert, volume: 4, Issue: 4, Winter 1989, pages 36--49. IEEE, 1989.

Digital Library

[15]

A. Quilici. A memory-based approach to recognizing programming plans. In Communications of the ACM, volume 37, Issue 5, pages 84--93. ACM, 1994.

Digital Library

[16]

A. Quilici. Reverse engineering of legacy systems: a path toward success. In Proceedings of the 17th international conference on Software engineering, pages 333--336. ACM, 1995.

Digital Library

[17]

M. J. Rees. Automatic assessment aids for Pascal programs. SIGPLAN Notices, 17(10):33--42, 1982.

Digital Library

[18]

S. S. Robinson and M. L. Soffa. An instructional aid for student programs. In Proceedings of the eleventh SIGCSE technical symposium on Computer science education, pages 118--129. ACM, 1980.

Digital Library

[19]

R. Saikkonen, L. Malmi, and A. Korhonen. Fully automatic assessment of programming exercises. In Proceedings of the 6th Annual SIGCSE/SIGCUE Conference on Innovation and Technology in Computer Science Education, ITiCSE'01, pages 133--136, Canterbury, UK, 2001. ACM Press, New York.

Digital Library

[20]

J. Sajaniemi. An empirical analysis of roles of variables in novice-level procedural programs. In Proceedings of IEEE 2002 Symposia on Human Centric Computing Languages and Environments, pages 37--39. IEEE Computer Society, 2002.

Digital Library

[21]

S. Woods and Q. Yang. The program understanding problem: analysis and a heuristic approach. In 18th International Conference on Software Engineering (ICSE'96), pages 6--15. IEEE, 1996.

Digital Library

Cited By

Gorchakov ADemidova LSovietov P(2024)A Rule-Based Algorithm and Its Specializations for Measuring the Complexity of Software in Educational Digital EnvironmentsComputers10.3390/computers1303007513:3(75)Online publication date: 11-Mar-2024
https://doi.org/10.3390/computers13030075
Gorchakov ADemidova LSovietov P(2023)Analysis of Program Representations Based on Abstract Syntax Trees and Higher-Order Markov Chains for Source Code Classification TaskFuture Internet10.3390/fi1509031415:9(314)Online publication date: 18-Sep-2023
https://doi.org/10.3390/fi15090314
Hamouda SEdwards SElmongui HErnst JShaffer C(2020)BTRecurTutor: a tutorial for practicing recursion in binary treesComputer Science Education10.1080/08993408.2020.1714533(1-33)Online publication date: 20-Jan-2020
https://doi.org/10.1080/08993408.2020.1714533

Index Terms

Recommendations

Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
PMAF: an algebraic framework for static analysis of probabilistic programs
PLDI '18

Automatically establishing that a probabilistic program satisfies some property ϕ is a challenging problem. While a sampling-based approach—which involves running the program repeatedly—can suggest that ϕ holds, to establish that the program satisfies ϕ,...
PMAF: an algebraic framework for static analysis of probabilistic programs
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation

Automatically establishing that a probabilistic program satisfies some property ϕ is a challenging problem. While a sampling-based approach—which involves running the program repeatedly—can suggest that ϕ holds, to establish that the program satisfies ϕ,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

Koli '08: Proceedings of the 8th International Conference on Computing Education Research

November 2008

127 pages

ISBN:9781605583853

DOI:10.1145/1595356

Conference Chairs:
Lauri Malmi,
Arnold Pears

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 November 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

Koli '08

Koli '08: 8th Koli Calling Int. Conference on Computing Education Research

November 13 - 16, 2008

Koli, Finland

Acceptance Rates

Overall Acceptance Rate 80 of 182 submissions, 44%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
159
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)3

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gorchakov ADemidova LSovietov P(2024)A Rule-Based Algorithm and Its Specializations for Measuring the Complexity of Software in Educational Digital EnvironmentsComputers10.3390/computers1303007513:3(75)Online publication date: 11-Mar-2024
https://doi.org/10.3390/computers13030075
Gorchakov ADemidova LSovietov P(2023)Analysis of Program Representations Based on Abstract Syntax Trees and Higher-Order Markov Chains for Source Code Classification TaskFuture Internet10.3390/fi1509031415:9(314)Online publication date: 18-Sep-2023
https://doi.org/10.3390/fi15090314
Hamouda SEdwards SElmongui HErnst JShaffer C(2020)BTRecurTutor: a tutorial for practicing recursion in binary treesComputer Science Education10.1080/08993408.2020.1714533(1-33)Online publication date: 20-Jan-2020
https://doi.org/10.1080/08993408.2020.1714533

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten