More Like this

1. Reusing Just-in-Time Compiled Code

   https://doi.org/10.1145/3622839  

   Mehta, Meetesh Kalpesh; Krynski, Sebastián; Gualandi, Hugo Musso; Thakur, Manas; Vitek, Jan (October 2023, Proceedings of the ACM on Programming Languages)

   Most code is executed more than once. If not entire programs then libraries remain unchanged from one run to the next. Just-in-time compilers expend considerable effort gathering insights about code they compiled many times, and often end up generating the same binary over and over again. We explore how to reuse compiled code across runs of different programs to reduce warm-up costs of dynamic languages. We propose to usespeculative contextual dispatchto select versions of functions from anoff-line curated code repository. That repository is a persistent database of previously compiled functions indexed by the context under which they were compiled. The repository is curated to remove redundant code and to optimize dispatch. We assess practicality by extending Ř, a compiler for the R language, and evaluating its performance. Our results suggest that the approach improves warmup times while preserving peak performance. 

   more » « less
2. Compiled, Extensible, Multi-language DSLs (Functional Pearl)

   https://doi.org/10.1145/3674627  

   Ballantyne, Michael; Gamburg, Mitch; Hemann, Jason (August 2024, Proceedings of the ACM on Programming Languages)

   Implementations of domain-specific languages should offer both extensibility and performance optimizations. With the new syntax-spec metalanguage in Racket, programmers can easily create DSL implementations that are both automatically macro-extensible and subject to conventional compiler optimizations. This pearl illustrates this approach through a new implementation of miniKanren, a widely used relational programming DSL. The miniKanren community has explored, in separate implementations, optimization techniques and a wide range of extensions. We demonstrate how our new miniKanren implementation with syntax-spec reconciles these features in a single implementation that comes with both an optimizing compiler and an extension mechanism. Furthermore, programmers using the new implementation benefit from the same seamless integration between Racket and miniKanren as in existing shallow embeddings. 

   more » « less
3. Ixodes Scapularis monitoring data compiled from 6 studies

   https://doi.org/10.5281/zenodo.6540831  

   Christie, Rowan; Stack, Kaitlin Whitney; Perrone, Julia; Bahlai, Christie (January 2022, Zenodo)

   {"Abstract":["This dataset lists 289 blacklegged tick population datasets from 6 studies that record abundance. These datasets were found by inputing keywords Ixodes Scapularis<\/em> and tick <\/em>in data repositories including Long Term Ecological Research data portal, National Ecological Observatory Network data portal, Google Datasets, Data Dryad, and Data One. The types of tick data recorded from these studies include density (number per square meter for example), proportion of ticks, count of ticks found on people. The locations of the datasets range from New York, New Jersey, Iowa, Massachusetts, and Connecticut, and range from 9 to 24 years in length. These datasets vary in that some record different life stages, geographic scope (county/town/plot), sampling technique (dragging/surveying), and different study length. The impact of these study factors on study results is analyzed in our research.<\/p>\n\nFunding:<\/p>\n\nRMC is supported by the National Institute of General Medical Sciences of the National Institutes of the Health under Award Number R25GM122672. CAB, JP, and KSW are supported by the Office of Advanced Cyberinfrastructure in the National Science Foundation under Award Number #1838807. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health or the National Science Foundation.<\/p>"],"Other":["{"references": ["Ellison A. 2017. Incidence of Ticks and Tick Bites at Harvard Forest since 2006. Environmental Data Initiative. https://doi.org/10.6073/pasta/71f12a4ffb7658e71a010866d1805a84. Dataset accessed 6/25/2019", "New York State Department of Health Office of Public Health. 2019. Deer Tick Surveillance: Adults (Oct to Dec) excluding Powassan virus: Beginning 2008. https://health.data.ny.gov/Health/Deer-Tick-Surveillance-Nymphs-May-to-Sept-excludin/kibp-u2ip", "New York State Department of Health Office of Public Health. 2019. Access Nymph Deer Tick Collection Data by County (Excluding Powassan Virus). https://health.data.ny.gov/Health/Deer-Tick-Surveillance-Nymphs-May-to-Sept-excludin/kibp-u2ip", "Ostfeld RS, Levi T, Keesing F, Oggenfuss K, Canham CD (2018) Data from: Tick-borne disease risk in a forest food web. Dryad Digital Repository. https://doi.org/10.5061/dryad.d1c8046", "Oliver JD, Bennett SW, Beati L, Bartholomay LC (2017) Range Expansion and Increasing Borrelia burgdorferi Infection of the Tick Ixodes scapularis (Acari: Ixodidae) in Iowa, 1990\\u20132013. Journal of Medical Entomology 54(6): 1727-1734. https://doi.org/10.1093/jme/tjx121", "The Connecticut Agricultural Experiment Station. (n.d.). Summaries of tick testing. CT.gov. Retrieved May 12, 2022, from https://portal.ct.gov/CAES/Fact-Sheets/Tick-Summary/Summaries-of-Tick-Testing", "Jordan, R. A., & Egizi, A. (2019). The growing importance of lone star ticks in a Lyme disease endemic county: Passive tick surveillance in Monmouth County, NJ, 2006 - 2016. PloS one, 14(2), e0211778. https://doi.org/10.1371/journal.pone.0211778"]}"]} 

   more » « less
4. Доверя́й, но проверя́й: SFI safety for native-compiled Wasm

   https://doi.org/10.14722/ndss.2021.24078  

   Johnson, Evan; Thien, David; Alhessi, Yousef; Narayan, Shravan; Brown, Fraser; Lerner, Sorin; McMullen, Tyler; Savage, Stefan; Stefan, Deian (February 2021, Network and Distributed Systems Security (NDSS) Symposium)

   null (Ed.)

   WebAssembly (Wasm) is a platform-independent bytecode that offers both good performance and runtime isolation. To implement isolation, the compiler inserts safety checks when it compiles Wasm to native machine code. While this approach is cheap, it also requires trust in the compiler's correctness---trust that the compiler has inserted each necessary check, correctly formed, in each proper place. Unfortunately, subtle bugs in the Wasm compiler can break---and have broken---isolation guarantees. To address this problem, we propose verifying memory isolation of Wasm binaries post-compilation. We implement this approach in VeriWasm, a static offline verifier for native x86-64 binaries compiled from Wasm; we prove the verifier's soundness, and find that it can detect bugs with no false positives. Finally, we describe our deployment of VeriWasm at Fastly. 

   more » « less
5. Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal Games

   https://doi.org/10.1109/FOCS61266.2024.00078  

   Metger, Tony; Natarajan, Anand; Zhang, Tina (October 2024, IEEE)

   We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work of Mahadev (FOCS '18), Bartusek et al. (CRYPTo ‘22) also constructed a succinct classical argument system for Q M A. However, their construction relied on post-quantumly secure indistinguishability obfuscation, a very strong primitive which is not known from standard cryptographic assumptions. In contrast, the primitives we use (namely, collapsing hash functions and a mild version of quantum homomorphic encryption) are much weaker and are implied by standard assumptions such as LWE. Our protocol is constructed using a general transformation which was designed by Kalai et al. (STOC '23) as a candidate method to compile any quantum nonlocal game into an argument system. Our main technical contribution is to analyze the soundness of this transformation when it is applied to a succinct self-test for Pauli measurements on maximally entangled states, the latter of which is a key component in the proof of MIP * = R E in Quantum complexity. 

   more » « less