MétaCan
Menu
Retour à la cohorte
Enregistrement W4408374128 · doi:10.1002/smr.70006

Guest Editorial for the Special Issue on Source Code Analysis and Manipulation, SCAM 2022

2025· editorial· en· W4408374128 sur OpenAlex

Pourquoi ce travail est dans la base

Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.

affAu moins un auteur déclare une institution canadienne dans l'instantané OpenAlex épinglé.

Notice bibliographique

RevueJournal of Software Evolution and Process · 2025
Typeeditorial
Langueen
DomaineComputer Science
ThématiqueAdvanced Malware Detection Techniques
Établissements canadiensUniversity of Saskatchewan
Organismes subventionnairesnon disponible
Mots-clésComputer scienceSource codeCode (set theory)Open sourceProgramming languageSoftware engineeringSoftware

Résumé

récupéré en direct d'OpenAlex

This issue of the Journal of Software:Evolution and Process focuses on the foundation of software engineering—the source code itself. While much of the software engineering community properly emphasizes aspects like specification, design, and requirements engineering, the source code provides the only precise description of a system's behavior. Therefore, the analysis and manipulation of source code remain critical concerns. This issue contains, among others, the extended version of the best papers presented at the 22nd IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2022) held in Limassol Cyprus, in October 2022. The SCAM Conference aims to bring together researchers and practitioners working on theory, techniques, and applications that concern analysis and/or manipulation of the source code of software systems. The term “source code” refers to any fully executable description of a software system, such as machine code, (very) high-level languages, and executable graphical representations of systems. The term “analysis” refers to any (semi)automated procedure that yields insight into source code, while “manipulation” refers to any automated or semi-automated procedure that takes and returns source code. While much attention in the wider software engineering community is directed towards other aspects of systems development and evolution, such as specification, design, and requirements engineering, it is the source code that contains the only precise description of the behavior of a system. Hence, the analysis and manipulation of source code remains a pressing concern for which SCAM 2022 solicited high-quality paper submissions. The SCAM 2022 conference received a total of 73 submissions. There were 45 submissions to the main research track, of which one was desk rejected for violation of the double-blind policy. The remaining 44 submissions went through a thorough review process. Every paper was fully reviewed by three or more program committee members for relevance, soundness and originality and discussed before final decisions were made. The program committee decided to accept 17 papers (acceptance rate 39%). The Engineering track has received 11 submissions, desk rejected one and accepted 5, the NIER track has received 16 submissions and accepted 10, and finally, the RENE track has received 4 submissions and accepted 1. A public open call was published to invite outstanding papers by other authors on source code analysis and manipulation. In total, 10 papers were submitted to this special issue. Each of the submissions was reviewed by a minimum of three expert referees. Following the first round of review, the authors were asked to revise their papers in response to the referees' comments, and the revised drafts were then reviewed for conformance to the referees' comments. Among those, only five papers were selected for publication in this special issue. The selected papers represent some of the very best work that has appeared at SCAM and cover all of its main areas of interest, namely, refactoring by Yang Zhang and Shuai Hong and by Richárd Szalay and Zoltán Porkoláb; design pattern detection by Hugo Andrade, João Bispo and Filipe F. Correia; string analysis by Luca Negrini, Vincenzo Arceri, Agostino Cortesi and Pietro Ferrara; and regression testing by Francesco Altiero, Anna Corazza, Sergio Di Martino, Adriano Peron, and Luigi Libero Lucio Starace. In the first paper “ReInstancer: An Automatic Refactoring Approach for Instanceof Pattern Matching”, Zhang et al. present ReInstancer, a tool for automating the refactoring of instanceof pattern matching by optimizing multibranch statements into switch expressions, improving code quality and readability. It demonstrated effectiveness by refactoring over 7700 instances across 20 real-world projects. The paper by Szalay et al. “Refactoring to Standard C++20 Modules” presents a semi-automatic method for modularizing existing C++ projects using dependency analysis and clustering to organize elements into modules. The study reveals that upgrading to C++20 Modules is constrained by the project's existing architectural design. In the third paper “Multi-Language Detection of Design Pattern Instances”, Andrade et al. present DP-LARA which is a multilanguage pattern detection tool that leverages the LARA framework's virtual Abstract Syntax Tree (AST) to identify design patterns across object-oriented programming languages. It enables language-agnostic code analysis for improved software comprehension. The paper by Negrini et al. “Tarsis: an effective automata-based abstract domain for string analysis” presents a novel abstract domain for string values based on finite state automata that outperforms the baseline for string analysis, a typical task on source code analysis. In the last paper “Regression Test Prioritization Leveraging Source Code Similarity with Tree Kernels”, Altiero et al. introduce two novel Regression Test Prioritization (RTP) techniques that apply Tree Kernels to Abstract Syntax Trees of source code to measure structural changes and prioritize tests accordingly. Evaluated across five Java projects, the proposed methods achieve superior fault detection rates compared to traditional RTP approaches. We hope you find these papers engaging and encourage those interested to join us at future SCAM conferences.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,001
score de la tête « metaresearch » (Gemma)0,003
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Sans objet · Signal consensuel: Sans objet
GenreSignal candidat: Éditorial · Signal consensuel: aucune
Score de désaccord entre enseignants0,519
Score d'incertitude au seuil0,850

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0010,003
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0010,000
Bibliométrie0,0010,001
Études des sciences et des technologies0,0000,000
Communication savante0,0000,001
Science ouverte0,0010,000
Intégrité de la recherche0,0000,001
Charge utile insuffisante (le modèle a refusé de juger)0,0000,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,006
Tête enseignante GPT0,282
Écart entre enseignants0,276 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle