AES: Automated Evaluation Systems for Computer Programing Course

  title={AES: Automated Evaluation Systems for Computer Programing Course},
  author={Shivam and Nilanjan Goswami and Veeky Baths and Soumyadip Bandyopadhyay},
Evaluation of descriptive type questions automatically is an important problem. In this paper, we have concentrated on programing language course which is a core subject in CS discipline. In this paper, we have given a tool prototype which evaluates the descriptive type of questions in computer programing course using the notion of program equivalence. 

Figures from this paper

Discovering multiple design approaches in programming assignment submissions
A novel approach of automated evaluation of programming assignments (AEPA) is presented, which automatically identifies multiple solution approaches to the programming question from the set of submitted solutions so as to not require the instructor to foresee all the possible solution approaches.


Automata Tutor and what we learned from building an online teaching tool
The algorithms that are used to produce personalized feedback are described, and the tool and its features are evaluated through extensive user studies involving hundreds of participants.
Translation Validation for Synchronous Languages
In order to be a practical alternative to compiler verification, a key feature of this validation is its full automation.
Safety Verification and Refutation by k-Invariants and k-Induction
This paper presents a single, unified algorithm kIkI, which strictly generalises abstract interpretation, bounded model checking and k-induction, and allows them to interact and reinforce each other, giving a `single-tool' approach to verification.
An End-to-end Formal Verifier for Parallel Programs
An end-to-end fully automated equivalence checker for validating optimizing and parallelizing transformations of PRES+ models from high-level language programs to validate the transformations using a state-of-the-art FSMD equivalenceChecker.
Translation validation for an optimizing compiler
A practical translation validation infrastructure, able to check the correctness of many of the transformations performed by a realistic compiler, can be implemented with about the effort typically required to implement one compiler pass.
Validating High-Level Synthesis
This paper presents an approach to validate the result of HLS against the initial high-level program using insights from translation validation, automated theorem proving and relational approaches to reasoning about programs.
Equivalence checking of Petri net models of programs using static and dynamic cut-points
A path based equivalence checking method for CPN models with rigorous treatment of the complexity and correctness issues have been presented and Experimental results show the effectiveness of the approach.
A path-based equivalence checking method for Petri net based models of programs
A path based equivalence checking method for PRES+ models is presented and is likely to be more convenient as the intermediate representations (IRs) of both the source and the transformed codes for translation validation than strictly sequential variable-based IRs like Finite State Machines with Datapath (FSMDs).
Translation Validation for PRES+ Models of Parallel Behaviours via an FSMD Equivalence Checker
This work has satisfactorily performed equivalence checking of some high level synthesis benchmarks represented by untimed PRES+ models by first translating them into FSMD models using the proposed algorithm and subsequently feeding them to one such F SMD equivalence checker.
Formal verification of code motion techniques using data-flow-driven equivalence checking
A formal verification method for checking correctness of code motion techniques is presented, which automatically identifies the situations where such properties are needed to be checked during equivalence checking, generates the appropriate properties, and invokes the model checking tool NuSMV to verify them.