A Static Analysis Tool in CS1: Student Usage and Perceptions of PythonTA
Bibliographic record
Abstract
Static analysis tools help programmers write better code. In computer science education, such tools can help students identify common style and coding errors, and lead students to fixing them. However, static analysis tools should be deployed in the classroom with care, so that all students—especially novice programmers—are empowered to act on the feedback they receive from these tools. For the past several years, our department has been integrating PythonTA, an educational static analysis tool, into a large CS1 course to provide students regular formative feedback and as part of the grading of programming assignments. This paper reports on a study of over 800 students conducted in the September 2022 offering of this course. Using both quantitative and qualitative methods, we investigate how students used PythonTA and their perceptions of its helpfulness. Overall, students across all levels of prior programming experience report that this static analysis tool was helpful. Though students with prior experience reported being more confident using the tool than novice programmers, this gap in confidence shrank over the semester. A thematic analysis of student comments on PythonTA found that many students appreciated the tool for improving the quality of their code and their own programming habits, but others responded more negatively, including mentioning frustration or confusion caused by PythonTA’s error messages. We discuss our findings and provide recommendations for educators considering the adoption of static analysis tools in their classrooms.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.009 | 0.034 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".