Communicating StateCharts (CSC)
Bibliographic record
Abstract
Concurrency is increasingly gaining importance due to the rapid development of networked applications. However, concurrency comes with some complexities, including handling race conditions or deadlocks. Therefore, learning this concept and understanding its correct implementation is challenging, even for experienced programmers. This problem arises from the current practices of teaching concurrency because of the focus on confusing details instead of necessary concepts. We propose a new concurrency paradigm called Communicating StateCharts (CSC) to simplify the teaching of concurrency to beginner programmers. CSC preserves five main principles, aiming to make concurrency easier to learn and use for novices: software visualization, Model-Driven Development (MDD), pure functions, separation of concerns, and raising abstraction levels. In this regard, CSC adapts features from existing concurrency models that aligned with our principles, namely process calculi, the actor model, and Harel’s statecharts. This synthesis led to CSC’s atomic statecharts, communicating through messages transmitted via channels. To make CSC accessible for beginners, a visual MDD tool called CSCDraw is designed and developed. The main requirements that guided the design of CSCDraw include enforcing CSC principles, considering beginner-friendly features, ensuring faithful code generation, supporting conditional branches, and channel cardinality. We also present the design of a pilot study that investigates the most effective way of teaching CSC to beginning programmers. This study serves as a prelude to a more rigorous experiment to compare the effectiveness of CSC with the existing paradigms.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".