default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadu Rugina
Person information
- affiliation: Cornell University, Ithaca, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c22]Ole Agesen, Jim Mattson, Radu Rugina, Jeffrey Sheldon:
Software Techniques for Avoiding Hardware Virtualization Exits. USENIX ATC 2012: 373-385
2000 – 2009
- 2009
- [c21]Greg Bronevetsky, Daniel Marques, Keshav Pingali, Sally A. McKee, Radu Rugina:
Compiler-enhanced incremental checkpointing for OpenMP applications. IPDPS 2009: 1-12 - 2008
- [c20]Xin Zheng, Radu Rugina:
Demand-driven alias analysis for C. POPL 2008: 197-208 - [c19]Greg Bronevetsky, Daniel Marques, Keshav Pingali, Radu Rugina, Sally A. McKee:
Compiler-enhanced incremental checkpointing for OpenMP applications. PPoPP 2008: 275-276 - 2007
- [c18]Sigmund Cherem, Radu Rugina:
A Practical Escape and Effect Analysis for Building Lightweight Method Summaries. CC 2007: 172-186 - [c17]Sigmund Cherem, Radu Rugina:
Uniqueness inference for compile-time object deallocation. ISMM 2007: 117-128 - [c16]Greg Bronevetsky, Daniel Marques, Keshav Pingali, Radu Rugina:
Compiler-Enhanced Incremental Checkpointing. LCPC 2007: 1-15 - [c15]Sigmund Cherem, Lonnie Princehouse, Radu Rugina:
Practical memory leak detection using guarded value-flow analysis. PLDI 2007: 480-491 - [c14]Sigmund Cherem, Radu Rugina:
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning. VMCAI 2007: 234-250 - 2006
- [c13]Sigmund Cherem, Radu Rugina:
Compile-time deallocation of individual objects. ISMM 2006: 138-149 - [c12]Maksim Orlovich, Radu Rugina:
Memory Leak Analysis by Contradiction. SAS 2006: 405-424 - 2005
- [j2]Radu Rugina, Martin C. Rinard:
Symbolic bounds analysis of pointers, array indices, and accessed memory regions. ACM Trans. Program. Lang. Syst. 27(2): 185-235 (2005) - [c11]Brian Hackett, Radu Rugina:
Region-based shape analysis with tracked locations. POPL 2005: 310-323 - [c10]Sigmund Cherem, Radu Rugina:
A Verifier for Region-Annotated Java Bytecodes. Bytecode@ETAPS 2005: 183-201 - 2004
- [c9]Sigmund Cherem, Radu Rugina:
Region analysis and transformation for Java programs. ISMM 2004: 85-96 - [c8]Radu Rugina:
Shape Analysis Quantitative Shape Analysis. SAS 2004: 228-245 - 2003
- [j1]Radu Rugina, Martin C. Rinard:
Pointer analysis for structured parallel programs. ACM Trans. Program. Lang. Syst. 25(1): 70-116 (2003) - [c7]Stephen Chong, Radu Rugina:
Static Analysis of Accessed Regions in Recursive Data Structures. SAS 2003: 463-482 - 2001
- [c6]Radu Rugina, Martin C. Rinard:
Design-Driven Compilation. CC 2001: 150-164 - 2000
- [c5]Radu Rugina, Martin C. Rinard:
Recursion Unrolling for Divide and Conquer Programs. LCPC 2000: 34-48 - [c4]Radu Rugina, Martin C. Rinard:
Symbolic bounds analysis of pointers, array indices, and accessed memory regions. PLDI 2000: 182-195
1990 – 1999
- 1999
- [c3]Radu Rugina, Martin C. Rinard:
Pointer Analysis for Multithreaded Programs. PLDI 1999: 77-90 - [c2]Radu Rugina, Martin C. Rinard:
Automatic Parallelization of Divide and Conquer Algorithms. PPoPP 1999: 72-83 - 1998
- [c1]Radu Rugina, Klaus E. Schauser:
Predicting the Running Times of Parallel Programs by Simulation. IPPS/SPDP 1998: 654-660
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-07-17 21:24 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:
