MétaCan
Menu
Back to cohort
Record W2023753091 · doi:10.5555/2486788.2486887

Efficient construction of approximate call graphs for JavaScript IDE services

2013· article· en· W2023753091 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Malware Detection Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceJavaScriptCall graphJavaScalabilityProgramming languageStatic analysisField (mathematics)Theoretical computer scienceSoftware engineeringOperating system

Abstract

fetched live from OpenAlex

The rapid rise of JavaScript as one of the most<br/>popular programming languages of the present day has led<br/>to a demand for sophisticated IDE support similar to what is<br/>available for Java or C#. However, advanced tooling is hampered<br/>by the dynamic nature of the language, which makes any form<br/>of static analysis very difficult. We single out efficient call graph<br/>construction as a key problem to be solved in order to improve<br/>development tools for JavaScript. To address this problem, we<br/>present a scalable field-based flow analysis for constructing call<br/>graphs. Our evaluation on large real-world programs shows that<br/>the analysis, while in principle unsound, produces highly accurate<br/>call graphs in practice. Previous analyses do not scale to these<br/>programs, but our analysis handles them in a matter of seconds,<br/>thus proving its suitability for use in an interactive setting<br/>

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.528
Threshold uncertainty score0.334

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.007
GPT teacher head0.224
Teacher spread0.218 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations81
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Malware Detection TechniquesFrench-language works237,207