The DOI matches its Crossref record; 94 of the 94 references it cites were found in a registry or an index.
WYSINWYX: What you see is not what you eXecute
Open accessAbstract
Over the last seven years, we have developed static-analysis methods to recover a good approximation to the variables and dynamically allocated memory objects of a stripped executable, and to track the flow of values through them. The article presents the algorithms that we developed, explains how they are used to recover Intermediate Representations (IRs) from executables that are similar to the IRs that would be available if one started from source code, and describes their application in the context of program understanding and automated bug hunting. Unlike algorithms for analyzing executables that existed prior to our work, the ones presented in this article provide useful information about memory accesses, even in the absence of debugging information. The ideas described in the article are incorporated in a tool for analyzing Intel x86 executables, called CodeSurfer/x86. CodeSurfer/x86 builds a system dependence graph for the program, and provides a GUI for exploring the graph by (i) navigating its edges, and (ii) invoking operations, such as forward slicing, backward slicing, and chopping, to discover how parts of the program can impact other parts. To assess the usefulness of the IRs recovered by CodeSurfer/x86 in the context of automated bug hunting, we built a tool on top of CodeSurfer/x86, called Device-Driver Analyzer for x86 (DDA/x86), which analyzes device-driver executables for bugs. Without the benefit of either source code or symbol-table/debugging information, DDA/x86 was able to find known bugs (that had been discovered previously by source-code analysis tools), along with useful error traces, while having a low false-positive rate. DDA/x86 is the first known application of program analysis/verification techniques to industrial executables.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
The worst-case execution-time problem—overview of methods and survey of tools
Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., et al. (2008) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1347375.1347389 · Cited by 1,871
Counterexample-Guided Abstraction Refinement
Clarke, E., Grumberg, O., Jha, S., Lu, Y., & Veith, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722167_15 · Cited by 1,702
Systematic design of program analysis frameworks
Cousot, P., & Cousot, R. (1979) · Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79 · doi:10.1145/567752.567778 · Cited by 1,621
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Patterns in property specifications for finite-state verification
Dwyer, M. B., Avrunin, G. S., & Corbett, J. C. (1999) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/302405.302672 · Cited by 1,463
Construction of abstract state graphs with PVS
Graf, S., & Saidi, H. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63166-6_10 · Cited by 1,454
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503279 · Cited by 1,155
Points-to analysis in almost linear time
Steensgaard, B. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237727 · Cited by 1,088
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
ATOM: a system for building customized program analysis tools
Srivastava, A., & Eustace, A. (1994) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/178243.178260 · Cited by 981
Model checking JAVA programs using JAVA PathFinder
Havelund, K., & Pressburger, T. (2000) · International Journal on Software Tools for Technology Transfer (STTT) · doi:10.1007/s100090050043 · Cited by 800
Computer-aided verification of coordinating processes: The automata-theoretic approach
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90267-8 · Cited by 786
Parametric shape analysis via 3-valued logic
Sagiv, M., Reps, T., & Wilhelm, R. (2002) · ACM Transactions on Programming Languages and Systems · doi:10.1145/514188.514190 · Cited by 785
Self-citationThe Omega test: a fast and practical integer programming algorithm for dependence analysis
Pugh, W. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125848 · Cited by 750
An empirical study of operating systems errors
Chou, A., Yang, J., Chelf, B., Hallem, S., & Engler, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502042 · Cited by 713
Thompson, K. (1984) · Communications of the ACM · doi:10.1145/358198.358210 · Cited by 666
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
Dean, J., Grove, D., & Chambers, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-49538-x_5 · Cited by 610
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781153 · Cited by 573
ESP: path-sensitive program verification in polynomial time
Das, M., Lerner, S., & Seigle, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512538 · Cited by 552
Efficient context-sensitive pointer analysis for C programs
Wilson, R. P., & Lam, M. S. (1995) · ACM SIGPLAN Notices · doi:10.1145/223428.207111 · Cited by 539
Checking system rules using system-specific, programmer-written compiler extensions
Engler, D., Chelf, B., Chou, A., & Hallem, S. (2000) · doi:10.5555/1251229.1251230 · Cited by 535
Secure Execution Via Program Shepherding
Kiriansky, V., Bruening, D. L., & Amarasinghe, S. P. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 532
A static analyzer for finding dynamic programming errors
Bush, W. R., Pincus, J. D., & Sielaff, D. (2000) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(200006)30:7<775::aid-spe309>3.0.co;2-h · Cited by 512
Pnueli, A., Siegel, M., & Singerman, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054170 · Cited by 499
Translation validation for an optimizing compiler
Necula, G. C. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349314 · Cited by 488
Henzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641655 · Cited by 475
Static determination of dynamic properties of programs
Cousot, P. M., & Cousot, R. (1976) · Cited by 473
Efficient context-sensitive pointer analysis for C programs
Wilson, R. P., & Lam, M. S. (1995) · Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation · doi:10.1145/207110.207111 · Cited by 458
Computer-Aided Verification of Coordinating Processes
Kurshan, R. P. (1995) · Princeton University Press eBooks · doi:10.1515/9781400864041 · Cited by 440
Analysis of pointers and structures
Chase, D., Wegman, M., & Zadeck, F. K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989429 · Cited by 433
Analyzing Memory Accesses in x86 Executables
Balakrishnan, G., & Reps, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24723-4_2 · Cited by 379
Self-citationBebop: A Symbolic Model Checker for Boolean Programs
Ball, T., & Rajamani, S. K. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722468_7 · Cited by 372
Thorough static analysis of device drivers
Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S. K., & Ustuner, A. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217943 · Cited by 371
Improving the reliability of commodity operating systems
Swift, M. M., Bershad, B. N., & Levy, H. M. (2005) · ACM Transactions on Computer Systems · doi:10.1145/1047915.1047919 · Cited by 338
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781153 · Cited by 330 · cited 3×
“Recent work that discusses efficient representations of data structures for program analysis includes [18, 78].”
Solving shape-analysis problems in languages with destructive updating
Sagiv, M., Reps, T., & Wilhelm, R. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271517 · Cited by 322
Self-citationHenzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964021 · Cited by 307
Swift, M. M., Annamalai, M., Bershad, B. N., & Levy, H. M. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1189256.1189257 · Cited by 299
Ball, T., & Rajamani, S. K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44585-4_25 · Cited by 288
Reliable and Precise WCET Determination for a Real-Life Processor
Ferdinand, C., Heckmann, R., Langenbach, M., Martin, F., Schmidt, M., Theiling, H., Thesing, S., & Wilhelm, R. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45449-7_32 · Cited by 278
Efficient chaotic iteration strategies with widenings
Bourdoncle, F. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0039704 · Cited by 275
Verification of Real-Time Systems using Linear Relation Analysis
Halbwachs, N., Proy, Y. E., & Roumanoff, P. (1997) · Formal Methods in System Design · doi:10.1023/a:1008678014487 · Cited by 262
Proceedings of the European Conference on Object-Oriented Programming
Gjessing, S., & Nygaard, K. (1988) · Cited by 246
(2013) · Choice Reviews Online · doi:10.5860/choice.50-5043 · Cited by 245
Dependence analysis for pointer variables
Horwitz, S., Pfeiffer, P., & Reps, T. (1989) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/73141.74821 · Cited by 233
Self-citationTrace Partitioning in Abstract Interpretation Based Static Analyzers
Mauborgne, L., & Rival, X. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31987-0_2 · Cited by 225
Detecting conflicts between structure accesses
Larus, J. R., & Hilfinger, P. N. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.53993 · Cited by 213
Jones, N. D., & Muchnick, S. S. (1982) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/582153.582161 · Cited by 213
Automating mimicry attacks using static binary analysis
Kruegel, C., Kirda, E., Mutz, D., Robertson, W., & Vigna, G. (2005) · USENIX Security Symposium · Cited by 202
A direct symbolic approach to model checking pushdown systems
Finkel, A., Willems, B., Wolper, P., & Moller, F. (1997) · ORBi (University of Liège) · Cited by 178
Static Detection of Malicious Code in Executable Programs
Bergeron, J., Debbabi, M., Desharnais, J., Erhioui, M., Lavoie, Y., & Tawbi, N. (2000) · Cited by 175
Symbolic Debugging of Optimized Code
Hennessy, J. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357173 · Cited by 169
Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation
Cheng, B.-C., & Hwu, W.-M. W. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349311 · Cited by 165
A framework for numeric analysis of array operations
Gopan, D., Reps, T., & Sagiv, M. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040333 · Cited by 162
Self-citationVulcan Binary transformation in a distributed environment
Srivastava, A., Edwards, A. J., & Vo, H. (2001) · Cited by 161
WYSINWYX: What You See Is Not What You eXecute
Balakrishnan, G., Reps, T., Melski, D., & Teitelbaum, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69149-5_22 · Cited by 157
Self-citationA generic approach to the static analysis of concurrent programs with procedures
Bouajjani, A., Esparza, J., & Touili, T. (2003) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/604131.604137 · Cited by 149
Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics
Miné, A. (2006) · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · doi:10.1145/1134650.1134659 · Cited by 138
Alias analysis of executable code
Debray, S., Muth, R., & Weippert, M. (1998) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/268946.268948 · Cited by 131
Certified assembly programming with embedded code pointers
Ni, Z., & Shao, Z. (2006) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1111037.1111066 · Cited by 113
DIVINE: DIscovering Variables IN Executables
Balakrishnan, G., & Reps, T. (2007) · Springer eBooks · doi:10.1007/978-3-540-69738-1_1 · Cited by 110
Self-citationProceedings of International Conference on Software Maintenance
(1996) · IEEE International Conference on Software Maintenance (ICSM) · doi:10.1109/icsm.1996.564982 · Cited by 108
Static Single Assignment for Decompilation
Emmerik, M. V. (2007) · The University of Queensland · doi:10.14264/158682 · Cited by 103
Cai, H., Shao, Z., & Vaynberg, A. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250743 · Cited by 98
Numeric Domains with Summarized Dimensions
Gopan, D., DiMaio, F., Dor, N., Reps, T., & Sagiv, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_38 · Cited by 95
Self-citationGopan, D., & Reps, T. (2006) · Lecture notes in computer science · doi:10.1007/11817963_41 · Cited by 94
Self-citationEliminating stack overflow by abstract interpretation
Regehr, J. D., Reid, A., & Webb, K. (2005) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1113830.1113833 · Cited by 88
Multics security evaluation: vulnerability analysis
Karger, P. A., & Schell, R. R. (2003) · Annual Computer Security Applications Conference · doi:10.1109/csac.2002.1176286 · Cited by 84
Safety checking of machine code
Xu, Z., Miller, B. P., & Reps, T. (2000) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/349299.349313 · Cited by 73
Self-citationProceedings of the European Symposium on Programming
Robinet, B. J., & Wilhelm, R. (1986) · Cited by 72
Improved Memory-Access Analysis for x86 Executables
Reps, T., & Balakrishnan, G. (2008) · Springer eBooks · doi:10.1007/978-3-540-78791-4_2 · Cited by 70
Self-citationSymbolic bounds analysis of pointers, array indices, and accessed memory regions
Rugina, R., & Rinard, M. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1057387.1057388 · Cited by 70
Intermediate-representation recovery from low-level code
Reps, T., Balakrishnan, G., & Lim, J. (2006) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/1111542.1111560 · Cited by 66
Self-citationJoining dataflow with predicates
Fischer, J. S., Jhala, R., & Majumdar, R. (2005) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1081706.1081742 · Cited by 63
Modular verification of assembly code with stack-based control abstractions
Feng, X., Shao, Z., Vaynberg, A., et al. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134028 · Cited by 62
Chandra, S., & Reps, T. (1999) · ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) · doi:10.1145/316158.316183 · Cited by 61
Self-citationType-Based Decompilation (or Program Reconstruction via Type Reconstruction)
Mycroft, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49099-x_14 · Cited by 58
DOC: a practical approach to source-level debugging of globally optimized code
Coutant, D. S., Meloy, S., & Ruscetta, M. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54003 · Cited by 51
Eidorff, P. H., Henglein, F., Mossin, C., Niss, H., Sørensen, M. H., & Tofte, M. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292543 · Cited by 50
Binding-time analysis and the taming of C pointers
Andersen, L. O. (1993) · doi:10.1145/154630.154636 · Cited by 49
Low-Level Library Analysis and Summarization
Gopan, D., & Reps, T. (2007) · Springer eBooks · doi:10.1007/978-3-540-73368-3_10 · Cited by 43
Self-citationA Next-Generation Platform for Analyzing Executables
Reps, T., Balakrishnan, G., Lim, J., & Teitelbaum, T. (2005) · Lecture notes in computer science · doi:10.1007/11575467_15 · Cited by 37
Self-citationAnalyzing Stripped Device-Driver Executables
Balakrishnan, G., & Reps, T. (2008) · Springer eBooks · doi:10.1007/978-3-540-78800-3_10 · Cited by 30
Self-citationAbstract Interpretation-Based Certification of Assembly Code
Rival, X. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36384-x_7 · Cited by 29
Compactly Representing First-Order Structures for Static Analysis
Manevich, R., Ramalingam, G., Field, J., Goyal, D., & Sagiv, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_16 · Cited by 28
Typestate Checking of Machine Code
Xu, Z., Reps, T., & Miller, B. P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_22 · Cited by 27
Self-citationAnalysis of Low-Level Code Using Cooperating Decompilers
Chang, B.-Y. E., Harren, M., & Necula, G. C. (2006) · Lecture notes in computer science · doi:10.1007/11823230_21 · Cited by 19
A theory of platform-dependent low-level software
Nita, M., Grossman, D., & Chambers, C. (2008) · Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1328438.1328465 · Cited by 16
Cited by
BitBlaze: A New Approach to Computer Security via Binary Analysis
Song, D., Brumley, D., Yin, H., Caballero, J., Jager, I., Kang, M. G., Liang, Z., Newsome, J., Poosankam, P., & Saxena, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89862-7_1 · Cited by 718
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021) · 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1109/cgo51591.2021.9370308 · Cited by 541
BAP: A Binary Analysis Platform
Brumley, D., Jager, I., Avgerinos, T., & Schwartz, E. J. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_37 · Cited by 433
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635900 · Cited by 220
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2017) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2655046 · Cited by 144
Metadata
- Authors
- Balakrishnan, G., & Reps, T.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 2010-08
- Volume
- 32
- Issue
- 6
- Pages
- 1-84
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2030906223
- Cited by
- 286
- References
- 94
- FWCI
- 70.62
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.