default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas Kidd
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c13]Michael Marty, Marc de Kruijf, Jacob Adriaens, Christopher Alfeld, Sean Bauer, Carlo Contavalli, Michael Dalton, Nandita Dukkipati, William C. Evans, Steve D. Gribble
, Nicholas Kidd, Roman Kononov, Gautam Kumar, Carl Mauer, Emily Musick, Lena E. Olson, Erik Rubow, Michael Ryan, Kevin Springborn, Paul Turner, Valas Valancius, Xi Wang, Amin Vahdat:
Snap: a microkernel approach to host networking. SOSP 2019: 399-413- 2011
- [j2]Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps:
A decision procedure for detecting atomicity violations for communicating processes with locks. Int. J. Softw. Tools Technol. Transf. 13(1): 37-60 (2011) - [j1]Nicholas Kidd, Thomas W. Reps, Julian Dolby, Mandana Vaziri:
Finding concurrency-related bugs using random isolation. Int. J. Softw. Tools Technol. Transf. 13(6): 495-518 (2011) - 2010
- [c12]Nicholas Kidd, Suresh Jagannathan, Jan Vitek:
One Stack to Run Them All - Reducing Concurrent Analysis to Sequential Analysis under Priority Scheduling. SPIN 2010: 245-261
2000 – 2009
- 2009
- [c11]William R. Harris, Nicholas Kidd, Sagar Chaki, Somesh Jha, Thomas W. Reps:
Verifying Information Flow Control over Unbounded Processes. FM 2009: 773-789 - [c10]Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps:
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks. SPIN 2009: 125-142 - [c9]Nicholas Kidd, Thomas W. Reps, Julian Dolby, Mandana Vaziri:
Finding Concurrency-Related Bugs Using Random Isolation. VMCAI 2009: 198-213 - 2008
- [c8]Nicholas Kidd, Akash Lal, Thomas W. Reps:
Language Strength Reduction. SAS 2008: 283-298 - [c7]Akash Lal, Tayssir Touili, Nicholas Kidd, Thomas W. Reps:
Interprocedural Analysis of Concurrent Programs Under a Context Bound. TACAS 2008: 282-298 - 2007
- [c6]Thomas W. Reps, Akash Lal, Nicholas Kidd:
Program Analysis Using Weighted Pushdown Systems. FSTTCS 2007: 23-51 - [c5]Akash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili:
Abstract Error Projection. SAS 2007: 200-217 - 2006
- [c4]Sagar Chaki, Edmund M. Clarke, Nicholas Kidd, Thomas W. Reps, Tayssir Touili:
Verifying Concurrent Message-Passing C Programs with Recursive Calls. TACAS 2006: 334-349 - 2005
- [c3]Gogul Balakrishnan, Thomas W. Reps, Nicholas Kidd, Akash Lal, Junghee Lim, David Melski, Radu Gruian, Suan Hsi Yong, Chi-Hua Chen, Tim Teitelbaum:
Model Checking x86 Executables with CodeSurfer/x86 and WPDS++. CAV 2005: 158-163 - [c2]Shai Rubin, Mihai Christodorescu, Vinod Ganapathy, Jonathon T. Giffin, Louis Kruger, Hao Wang, Nicholas Kidd:
An auctioning reputation system based on anomaly. CCS 2005: 270-279 - [c1]Mihai Christodorescu, Nicholas Kidd, Wen-Han Goh:
String analysis for x86 binaries. PASTE 2005: 88-95
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-04-24 22:53 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:
