Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The Daikon system for dynamic detection of likely invariants
2007631 citationsMichael D. Ernst, Jeff Perkins et al.Science of Computer Programmingprofile →
Practical Control Flow Integrity and Randomization for Binary Executables
2013321 citationsChao Zhang, Tao Wei et al.profile →
A Symbolic Execution Framework for JavaScript
2010288 citationsStephen McCamant, Dawn Song et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Stephen McCamant
Since
Specialization
Citations
This map shows the geographic impact of Stephen McCamant's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stephen McCamant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephen McCamant more than expected).
Fields of papers citing papers by Stephen McCamant
This network shows the impact of papers produced by Stephen McCamant. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stephen McCamant. The network helps show where Stephen McCamant may publish in the future.
Co-authorship network of co-authors of Stephen McCamant
This figure shows the co-authorship network connecting the top 25 collaborators of Stephen McCamant.
A scholar is included among the top collaborators of Stephen McCamant based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Stephen McCamant. Stephen McCamant is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zhang, Chao, Tao Wei, Zhaofeng Chen, et al.. (2013). Practical Control Flow Integrity and Randomization for Binary Executables. 559–573.321 indexed citations breakdown →
9.
Martignoni, Lorenzo, Pongsin Poosankam, Matei Zaharia, et al.. (2012). Cloud terminal: secure access to sensitive applications from untrusted systems. USENIX Annual Technical Conference. 14–14.23 indexed citations
Kang, Min Gyung, Stephen McCamant, Pongsin Poosankam, & Dawn Song. (2011). DTA++: Dynamic Taint Analysis with Targeted Control-Flow Propagation.. Network and Distributed System Security Symposium.152 indexed citations
Ernst, Michael D., Jeff Perkins, Philip J. Guo, et al.. (2007). The Daikon system for dynamic detection of likely invariants. Science of Computer Programming. 69(1-3). 35–45.631 indexed citations breakdown →
18.
McCamant, Stephen & Greg Morrisett. (2006). Evaluating SFI for a CISC architecture. USENIX Security Symposium. 15.121 indexed citations
19.
McCamant, Stephen. (2006). A Machine-Checked Safety Proof for a CISC-Compatible SFI Technique. DSpace@MIT (Massachusetts Institute of Technology).4 indexed citations
20.
McCamant, Stephen & Michael D. Ernst. (2004). Formalizing Lightweight Verification of Software Component Composition.5 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.