Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 537

The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.

Bringing the web up to speed with WebAssembly

Open access
Haas, Andreas, Rossberg, Andreas, Schuff, Derek L., Titzer, Ben L., Holman, Michael, Gohman, Dan, Wagner, Luke, Zakai, Alon, Bastien, JF·2017·Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation

Abstract

The maturation of the Web platform has given rise to sophisticated and demanding Web applications such as interactive 3D visualization, audio and video software, and games. With that, efficiency and security of code on the Web has become more important than ever. Yet JavaScript as the only built-in language of the Web is not well-equipped to meet these requirements, especially as a compilation target.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3062341.3062363

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 24 references

Research works printed but not linked: 15

  1. P. Akritidis , M. Costa , M. Castro , and S. Hand . Baggy bounds checking: An efficient and backwards-compatible defense against out-of-bounds errors . In Proceedings of the 18th Conference on USENIX Security Symposium, SSYM’09 , pages 51– 66 , Berkeley, CA, USA , 2009 . USENIX Association. P. Akritidis, M. Costa, M. Castro, and S. Hand. Baggy bounds checking: An efficient and backwards-compatible defense against out-of-bounds errors. In Proceedings of the 18th Conference on USENIX Security Symposium, SSYM’09, pages 51–66, Berkeley, CA, USA, 2009. USENIX Association.
  2. 10.1145/202530.202534 · doi:10.1145/202530.202534
  3. 10.5555/1947337.1947364 · doi:10.5555/1947337.1947364
  4. 10.1145/2786558.2786565 · doi:10.1145/2786558.2786565
  5. 10.1145/143103.143114 · doi:10.1145/143103.143114
  6. 10.5555/977395.977673 · doi:10.5555/977395.977673
  7. X. Leroy , D. Doligez , A. Frisch , J. Garrigue , D. Rémy , and J. Vouillon . The OCaml system . INRIA , 2016 . X. Leroy, D. Doligez, A. Frisch, J. Garrigue, D. Rémy, and J. Vouillon. The OCaml system. INRIA, 2016.
  8. G. Morrisett , D. Tarditi , P. Cheng , C. Stone , P. Cheng , P. Lee , C. Stone , R. Harper , and P. Lee . The TIL/ML compiler: Performance and safety through types . In In Workshop on Compiler Support for Systems Software , 1996 . G. Morrisett, D. Tarditi, P. Cheng, C. Stone, P. Cheng, P. Lee, C. Stone, R. Harper, and P. Lee. The TIL/ML compiler: Performance and safety through types. In In Workshop on Compiler Support for Systems Software, 1996.
  9. 10.5555/647478.727796 · doi:10.5555/647478.727796
  10. 10.1145/565816.503286 · doi:10.1145/565816.503286
  11. Z. Shao . An overview of the FLINT/ML compiler . In Proc. 1997 ACM SIGPLAN Workshop on Types in Compilation (TIC’97) , Amsterdam, The Netherlands , June 1997 . Z. Shao. An overview of the FLINT/ML compiler. In Proc. 1997 ACM SIGPLAN Workshop on Types in Compilation (TIC’97), Amsterdam, The Netherlands, June 1997.
  12. 10.1145/1328195.1328197 · doi:10.1145/1328195.1328197
  13. R. F. Strk and J. Schmid . Java bytecode verification is not possible (extended abstract) . In Formal Methods and Tools for Computer Science (Proceedings of Eurocast 2001 , pages 232– 234 , 2001 . R. F. Strk and J. Schmid. Java bytecode verification is not possible (extended abstract). In Formal Methods and Tools for Computer Science (Proceedings of Eurocast 2001, pages 232–234, 2001.
  14. K. Wang , Y. Lin , S. M. Blackburn , M. Norrish , and A. L. Hosking . Draining the Swamp: Micro virtual machines as a solid foundation for language development . In 1st Summit on Advances in Programming Languages , volume 32 of SNAPL ’15 , pages 321– 336 , Dagstuhl , Germany , 2015 . K. Wang, Y. Lin, S. M. Blackburn, M. Norrish, and A. L. Hosking. Draining the Swamp: Micro virtual machines as a solid foundation for language development. In 1st Summit on Advances in Programming Languages, volume 32 of SNAPL ’15, pages 321–336, Dagstuhl, Germany, 2015.
  15. 10.1145/2048147.2048224 · doi:10.1145/2048147.2048224

Cited by

See all 537

Metadata

Authors
Haas, A., Rossberg, A., Schuff, D. L., Titzer, B. L., Holman, M., Gohman, D., Wagner, L., Zakai, A., & Bastien, J.
Venue
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher
ACM
Published
2017-06-14
Pages
185-200
ISSN
1531-7102 (ISSN-L)
OpenAlex
W2625141509
Cited by
537
References
24
FWCI
29.65
Type
conference paper
Language
en
Open access
hybrid

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Bringing the web up to speed with WebAssembly. https://app.cochat.ai/papers/10.1145/3062341.3062363
The paper
Haas, A., Rossberg, A., Schuff, D. L., Titzer, B. L., Holman, M., Gohman, D., Wagner, L., Zakai, A., & Bastien, J. (2017). Bringing the web up to speed with WebAssembly. Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/3062341.3062363

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.