Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher A. Healy
Person information
- affiliation: Furman University, Greenville, SC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c17]Jon Miller, Christopher A. Healy:
Have Films Become More Visually Intense? ACM Southeast Regional Conference 2019: 277-278- 2018
- [c16]Shengyi (Costa) Huang, Chris Healy:
StreetTraffic: a library for traffic flow data collection and analysis. ACM Southeast Regional Conference 2018: 40:1-40:3 - 2017
- [c15]Valerie Barr, Bryan Catron, Christopher A. Healy, Kate Lockwood, Anil M. Shende, Andrea Tartaro, Kevin Treu:
Computer Science Topics in First- and Second- Year Seminar Courses. SIGCSE 2017: 643-644 - 2010
- [j8]Sibin Mohan
, Frank Mueller, Michael Root, William Hawkins, Christopher A. Healy, David B. Whalley, Emilio Vivancos:
Parametric timing analysis and its application to dynamic voltage scaling. ACM Trans. Embed. Comput. Syst. 10(2): 25:1-25:34 (2010)
2000 – 2009
- 2009
- [c14]Paul Keim, Amanda Noyes, Andrew Ferguson, Joshua Neal, Christopher A. Healy:
Extending the Path Analysis Technique to Obtain a Soft WCET. WCET 2009 - 2007
- [c13]Joel Coffman, Christopher A. Healy, Frank Mueller, David B. Whalley:
Generalizing parametric timing analysis. LCTES 2007: 152-154 - 2006
- [j7]Wankang Zhao, William C. Kreahling, David B. Whalley, Christopher A. Healy, Frank Mueller:
Improving WCET by applying worst-case path optimizations. Real Time Syst. 34(2): 129-152 (2006) - 2005
- [j6]Wankang Zhao, David B. Whalley, Christopher A. Healy, Frank Mueller:
Improving WCET by applying a WC code-positioning optimization. ACM Trans. Archit. Code Optim. 2(4): 335-365 (2005) - [c12]Wankang Zhao, William C. Kreahling, David B. Whalley, Christopher A. Healy, Frank Mueller:
Improving WCET by Optimizing Worst-Case Paths. IEEE Real-Time and Embedded Technology and Applications Symposium 2005: 138-147 - [c11]Sibin Mohan, Frank Mueller, David B. Whalley, Christopher A. Healy:
Timing Analysis for Sensor Network Nodes of the Atmega Processor Family. IEEE Real-Time and Embedded Technology and Applications Symposium 2005: 405-414 - [c10]Sibin Mohan, Frank Mueller, William Hawkins, Michael Root, Christopher A. Healy, David B. Whalley:
ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling. RTSS 2005: 233-242 - 2004
- [c9]Wankang Zhao, Prasad A. Kulkarni, David B. Whalley, Christopher A. Healy, Frank Mueller, Gang-Ryung Uh:
Tuning the WCET of Embedded Applications. IEEE Real-Time and Embedded Technology and Applications Symposium 2004: 472-481 - [c8]Wankang Zhao, David B. Whalley, Christopher A. Healy, Frank Mueller:
WCET Code Positioning. RTSS 2004: 81-91 - 2002
- [j5]Christopher A. Healy, David B. Whalley:
Automatic Detection and Exploitation of Branch Constraints for Timing Analysis. IEEE Trans. Software Eng. 28(8): 763-781 (2002) - 2001
- [c7]Emilio Vivancos, Christopher A. Healy, Frank Mueller, David B. Whalley:
Parametric Timing Analysis. LCTES/OM 2001: 88-93 - [c6]Emilio Vivancos, Christopher A. Healy, Frank Mueller, David B. Whalley:
Parametric Timing Analysis. OM@PLDI 2001: 88-93 - 2000
- [j4]Christopher A. Healy, Mikael Sjödin, Viresh Rustagi, David B. Whalley, Robert van Engelen:
Supporting Timing Analysis by Automatic Bounding of Loop Iterations. Real Time Syst. 18(2/3): 129-156 (2000)
1990 – 1999
- 1999
- [j3]Randall T. White, Frank Mueller, Christopher A. Healy, David B. Whalley, Marion G. Harmon:
Timing Analysis for Data and Wrap-Around Fill Caches. Real Time Syst. 17(2-3): 209-233 (1999) - [j2]Lo Ko, Naghan Al-Yaqoubi, Christopher A. Healy, Emily Ratliff, Robert D. Arnold, David B. Whalley, Marion G. Harmon:
Timing Constraint Specification and Analysis. Softw. Pract. Exp. 29(1): 77-98 (1999) - [j1]Christopher A. Healy, Robert D. Arnold, Frank Mueller, David B. Whalley, Marion G. Harmon:
Bounding Pipeline and Instruction Cache Performance. IEEE Trans. Computers 48(1): 53-70 (1999) - [c5]Christopher A. Healy, David B. Whalley:
Tighter Timing Predictions by Automatic Detection and Exploitation of Value-Dependent Constraints. IEEE Real Time Technology and Applications Symposium 1999: 79-88 - 1998
- [c4]Christopher A. Healy, Mikael Sjödin, Viresh Rustagi, David B. Whalley:
Bounding Loop Iterations for Timing Analysis. IEEE Real Time Technology and Applications Symposium 1998: 12-21 - 1997
- [c3]Randall T. White, Christopher A. Healy, David B. Whalley, Frank Mueller, Marion G. Harmon:
Timing Analysis for Data Caches and Set-Associative Caches. IEEE Real Time Technology and Applications Symposium 1997: 192-202 - 1996
- [c2]Lo Ko, Christopher A. Healy, Emily Ratliff, Robert D. Arnold, David B. Whalley, Marion G. Harmon:
Supporting the specification and analysis of timing constraints. IEEE Real Time Technology and Applications Symposium 1996: 170-178 - 1995
- [c1]Christopher A. Healy, David B. Whalley, Marion G. Harmon:
Integrating the Timing Analysis of Pipelining and Instruction Caching. RTSS 1995: 288-297
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-02-07 03:14 CET 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:
