default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBen Hardekopf
Person information
- affiliation: University of California, Santa Barbara, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Mehmet Emre
, Peter Boyland, Aesha Parekh, Ryan Schroeder, Kyle Dewey, Ben Hardekopf:
Aliasing Limits on Translating C to Safe Rust. Proc. ACM Program. Lang. 7(OOPSLA1): 551-579 (2023)- [j4]Zachary D. Sisco, Jonathan Balkind, Timothy Sherwood, Ben Hardekopf:
Loop Rerolling for Hardware Decompilation. Proc. ACM Program. Lang. 7(PLDI): 420-442 (2023) - 2021
- [j3]Mehmet Emre, Ryan Schroeder, Kyle Dewey, Ben Hardekopf:
Translating C to safer Rust. Proc. ACM Program. Lang. 5(OOPSLA): 1-29 (2021) - [j2]Michael Christensen, Joseph McMahan, Lawton Nichols, Jared Roesch, Timothy Sherwood, Ben Hardekopf:
Safe functional systems through integrity types and verified assembly. Theor. Comput. Sci. 851: 39-61 (2021) - 2018
- [j1]Joseph McMahan, Michael Christensen, Lawton Nichols, Jared Roesch, Sung-Yee Guo, Ben Hardekopf, Timothy Sherwood:
An Architecture for Analysis. IEEE Micro 38(3): 107-115 (2018)
Conference and Workshop Papers
- 2022
- [c32]Michael Christensen, Georgios Tzimpragos, Harlan Kringen, Jennifer Volk, Timothy Sherwood, Ben Hardekopf:
PyLSE: a pulse-transfer level language for superconductor electronics. PLDI 2022: 671-686 - 2021
- [c31]Michael Christensen, Timothy Sherwood, Jonathan Balkind, Ben Hardekopf:
Wire sorts: a language abstraction for safe hardware composition. PLDI 2021: 175-189 - 2020
- [c30]Miroslav Gavrilov, Kyle Dewey, Alex Groce, Davina Zamanzadeh, Ben Hardekopf:
A Practical, Principled Measure of Fuzzer Appeal: A Preliminary Study. QRS 2020: 510-517 - 2019
- [c29]Lawton Nichols, Mehmet Emre, Ben Hardekopf:
Structural and Nominal Cross-Language Clone Detection. FASE 2019: 247-263 - [c28]Joseph McMahan, Michael Christensen, Kyle Dewey, Ben Hardekopf, Timothy Sherwood:
Bouncer: static program analysis in hardware. ISCA 2019: 711-722 - [c27]Lawton Nichols, Kyle Dewey, Mehmet Emre, Sitao Chen, Ben Hardekopf:
Syntax-based Improvements to Plagiarism Detectors and their Evaluations. ITiCSE 2019: 555-561 - [c26]Lawton Nichols, Mehmet Emre, Ben Hardekopf:
Fixpoint reuse for incremental JavaScript analysis. SOAP@PLDI 2019: 2-7 - 2017
- [c25]Joseph McMahan, Michael Christensen, Lawton Nichols, Jared Roesch, Sung-Yee Guo, Ben Hardekopf, Timothy Sherwood:
An Architecture Supporting Formal and Compositional Binary Analysis. ASPLOS 2017: 177-191 - 2015
- [c24]Kyle Dewey, Vineeth Kashyap, Ben Hardekopf:
A parallel abstract interpreter for JavaScript. CGO 2015: 34-45 - [c23]Madhukar N. Kedlaya, Behnam Robatmili, Ben Hardekopf:
Server-side type profiling for optimizing client-side JavaScript engines. DLS 2015: 140-153 - [c22]Kyle Dewey, Lawton Nichols, Ben Hardekopf:
Automated Data Structure Generation: Refuting Common Wisdom. ICSE (1) 2015: 32-43 - [c21]Kyle Dewey, Jared Roesch, Ben Hardekopf:
Fuzzing the Rust Typechecker Using CLP (T). ASE 2015: 482-493 - 2014
- [c20]Xun Li, Vineeth Kashyap, Jason K. Oberg, Mohit Tiwari, Vasanth Ram Rajarathinam, Ryan Kastner, Timothy Sherwood, Ben Hardekopf, Frederic T. Chong:
Sapper: a language for hardware-level security policy enforcement. ASPLOS 2014: 97-112 - [c19]Vineeth Kashyap, Ben Hardekopf:
Security Signature Inference for JavaScript-based Browser Addons. CGO 2014: 219 - [c18]Kyle Dewey, Jared Roesch, Ben Hardekopf:
Language fuzzing using constraint logic programming. ASE 2014: 725-730 - [c17]Vineeth Kashyap, Kyle Dewey, Ethan A. Kuefner, John Wagner, Kevin Gibbons, John Sarracino, Ben Wiedermann, Ben Hardekopf:
JSAI: a static analysis platform for JavaScript. SIGSOFT FSE 2014: 121-132 - [c16]Behnam Robatmili, Calin Cascaval, Mehrdad Reshadi, Madhukar N. Kedlaya, Seth Fowler, Vrajesh Bhavsar, Michael Weber, Ben Hardekopf:
MuscalietJS: rethinking layered dynamic web runtimes. VEE 2014: 77-88 - [c15]Madhukar N. Kedlaya, Behnam Robatmili, Calin Cascaval, Ben Hardekopf:
Deoptimization for dynamic language JITs on typed, stack-based virtual machines. VEE 2014: 103-114 - [c14]Ben Hardekopf, Ben Wiedermann, Berkeley R. Churchill, Vineeth Kashyap:
Widening for Control-Flow. VMCAI 2014: 472-491 - 2013
- [c13]Vineeth Kashyap, John Sarracino, John Wagner, Ben Wiedermann, Ben Hardekopf:
Type refinement for static analysis of JavaScript. DLS 2013: 17-26 - [c12]Madhukar N. Kedlaya, Jared Roesch, Behnam Robatmili, Mehrdad Reshadi, Ben Hardekopf:
Improved type specialization for dynamic scripting languages. DLS 2013: 37-48 - [c11]Xun Li, Vineeth Kashyap, Jason K. Oberg, Mohit Tiwari, Vasanth Ram Rajarathinam, Ryan Kastner, Timothy Sherwood, Ben Hardekopf, Frederic T. Chong:
Position paper: Sapper - a language for provable hardware policy enforcement. PLAS 2013: 39-44 - 2011
- [c10]Ben Hardekopf, Calvin Lin:
Flow-sensitive pointer analysis for millions of lines of code. CGO 2011: 289-298 - [c9]Mohit Tiwari, Jason Oberg, Xun Li, Jonathan Valamehr, Timothy E. Levin, Ben Hardekopf, Ryan Kastner, Frederic T. Chong, Timothy Sherwood:
Crafting a usable microkernel, processor, and I/O system with strict and provable information flow security. ISCA 2011: 189-200 - [c8]Xun Li, Mohit Tiwari, Jason Oberg, Vineeth Kashyap, Frederic T. Chong, Timothy Sherwood, Ben Hardekopf:
Caisson: a hardware description language for secure information flow. PLDI 2011: 109-120 - [c7]Vineeth Kashyap, Ben Wiedermann, Ben Hardekopf:
Timing- and Termination-Sensitive Secure Information Flow: Exploring a New Approach. IEEE Symposium on Security and Privacy 2011: 413-428 - [c6]Fang Yu, Tevfik Bultan, Ben Hardekopf:
String Abstractions for String Verification. SPIN 2011: 20-37 - 2010
- [c5]Xun Li, Mohit Tiwari, Ben Hardekopf, Timothy Sherwood, Frederic T. Chong:
Secure information flow analysis for hardware design: using the right abstraction for the job. PLAS 2010: 8 - 2009
- [c4]Ben Hardekopf, Calvin Lin:
Semi-sparse flow-sensitive pointer analysis. POPL 2009: 226-238 - 2007
- [c3]Ben Hardekopf, Calvin Lin:
The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. PLDI 2007: 290-299 - [c2]Ben Hardekopf, Calvin Lin:
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis. SAS 2007: 265-280 - 2000
- [c1]Ben Hardekopf, Kevin A. Kwiat:
Exploiting the Overlap of Security and Fault-Tolerance. AIWoRC 2000: 361-366
Editorship
- 2023
- [e1]Christophe Dubach, Derek Bruening, Ben Hardekopf:
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization, CGO 2023, Montréal, QC, Canada, 25 February 2023- 1 March 2023. ACM 2023, ISBN 979-8-4007-0101-6 [contents]
Informal and Other Publications
- 2014
- [i1]Vineeth Kashyap, Kyle Dewey, Ethan A. Kuefner, John Wagner, Kevin Gibbons, John Sarracino, Ben Wiedermann, Ben Hardekopf:
JSAI: Designing a Sound, Configurable, and Efficient Static Analyzer for JavaScript. CoRR abs/1403.3996 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
