default search action
Jay A. McCarthy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j5]Matthew Flatt
, Taylor Allred
Rhombus: A New Spin on Macros without All the Parentheses. Proc. ACM Program. Lang. 7(OOPSLA2): 574-603 (2023)
2010 – 2019
- 2018
- [j4]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi
A programmable programming language. Commun. ACM 61(3): 62-71 (2018) - [j3]Jay A. McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler:
A Coq library for internal verification of running-times. Sci. Comput. Program. 164: 49-65 (2018) - 2017
- [j2]Max S. New, Burke Fetscher, Robert Bruce Findler, Jay A. McCarthy:
Fair enumeration combinators. J. Funct. Program. 27: e19 (2017) - 2016
- [c11]Jay A. McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler:
A Coq Library for Internal Verification of Running-Times. FLOPS 2016: 144-162 - 2015
- [c10]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi
The Racket Manifesto. SNAPL 2015: 113-128 - 2013
- [c9]Gregory H. Cooper, Arjun Guha, Shriram Krishnamurthi, Jay A. McCarthy, Robert Bruce Findler:
Teaching garbage collection without implementing compiler or interpreters. SIGCSE 2013: 385-390 - 2012
- [c8]Casey Klein, John Clements, Christos Dimoulas
Run your research: on the effectiveness of lightweight mechanization. POPL 2012: 285-296 - 2011
- [c7]Casey Klein, Jay A. McCarthy, Steven Jaconette, Robert Bruce Findler:
A Semantics for Context-Sensitive Reduction Semantics. APLAS 2011: 369-383 - 2010
- [c6]Jay A. McCarthy:
The two-state solution: native and serializable continuations accord. OOPSLA 2010: 567-582
2000 – 2009
- 2009
- [b1]Jay A. McCarthy:
"Static Analyses of Cryptographic Protocols. Brown University, USA, 2009 - [c5]Jay A. McCarthy:
Automatically RESTful web applications: marking modular serializable continuations. ICFP 2009: 299-310 - [c4]Jay A. McCarthy, Shriram Krishnamurthi
Trusted Multiplexing of Cryptographic Protocols. Formal Aspects in Security and Trust 2009: 217-232 - 2008
- [c3]Jay A. McCarthy, Shriram Krishnamurthi
Minimal backups of cryptographic protocol runs. FMSE 2008: 11-20 - [c2]Jay A. McCarthy, Shriram Krishnamurthi
Cryptographic Protocol Explication and End-Point Projection. ESORICS 2008: 533-547 - 2007
- [j1]Shriram Krishnamurthi
Implementation and use of the PLT scheme Web server. High. Order Symb. Comput. 20(4): 431-460 (2007) - [c1]Jay A. McCarthy, Shriram Krishnamurthi
Compiling cryptographic protocols for deployment on the web. WWW 2007: 687-696
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 21:15 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: