Integrating the Timing Analysis of Pipelining and Instruction Caching. - Christopher A. Healy; David B. Whalley; Marion G. Harmon (RTSS, 1995)

Supporting the specification and analysis of timing constraints. - Lo Ko; Christopher A. Healy; Emily Ratliff; Robert D. Arnold; David B. Whalley; Marion G. Harmon (IEEE Real Time Technology and Applications Symposium, 1996)

Timing Analysis for Data Caches and Set-Associative Caches. - Randall T. White; Christopher A. Healy; David B. Whalley; Frank Mueller 001; Marion G. Harmon (IEEE Real Time Technology and Applications Symposium, 1997)

Bounding Loop Iterations for Timing Analysis. - Christopher A. Healy; Mikael Sjödin; Viresh Rustagi; David B. Whalley (IEEE Real Time Technology and Applications Symposium, 1998)

Tighter Timing Predictions by Automatic Detection and Exploitation of Value-Dependent Constraints. - Christopher A. Healy; David B. Whalley (IEEE Real Time Technology and Applications Symposium, 1999)

Timing Analysis for Data and Wrap-Around Fill Caches. - Randall T. White; Frank Mueller 001; Christopher A. Healy; David B. Whalley; Marion G. Harmon (Real Time Syst., 1999)

Timing Constraint Specification and Analysis. - Lo Ko; Naghan Al-Yaqoubi; Christopher A. Healy; Emily Ratliff; Robert D. Arnold; David B. Whalley; Marion G. Harmon (Softw. Pract. Exp., 1999)

Bounding Pipeline and Instruction Cache Performance. - Christopher A. Healy; Robert D. Arnold; Frank Mueller 001; David B. Whalley; Marion G. Harmon (IEEE Trans. Computers, 1999)

Supporting Timing Analysis by Automatic Bounding of Loop Iterations. - Christopher A. Healy; Mikael Sjödin; Viresh Rustagi; David B. Whalley; Robert van Engelen (Real Time Syst., 2000)

Parametric Timing Analysis. - Emilio Vivancos; Christopher A. Healy; Frank Mueller 001; David B. Whalley (OM@PLDI, 2001)

Automatic Detection and Exploitation of Branch Constraints for Timing Analysis. - Christopher A. Healy; David B. Whalley (IEEE Trans. Software Eng., 2002)

Tuning the WCET of Embedded Applications. - Wankang Zhao; Prasad A. Kulkarni; David B. Whalley; Christopher A. Healy; Frank Mueller 001; Gang-Ryung Uh (IEEE Real-Time and Embedded Technology and Applications Symposium, 2004)

WCET Code Positioning. - Wankang Zhao; David B. Whalley; Christopher A. Healy; Frank Mueller 001 (RTSS, 2004)

Introducing practical applications into a computational theory class. - William H. Hawkins; Christopher A. Healy (J. Comput. Sci. Coll., 2004)

Timing Analysis for Sensor Network Nodes of the Atmega Processor Family. - Sibin Mohan; Frank Mueller 001; David B. Whalley; Christopher A. Healy (IEEE Real-Time and Embedded Technology and Applications Symposium, 2005)

Improving WCET by Optimizing Worst-Case Paths. - Wankang Zhao; William C. Kreahling; David B. Whalley; Christopher A. Healy; Frank Mueller 001 (IEEE Real-Time and Embedded Technology and Applications Symposium, 2005)

ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling. - Sibin Mohan; Frank Mueller 001; William Hawkins 001; Michael Root; Christopher A. Healy; David B. Whalley (RTSS, 2005)

A flexible tool for visualizing assembly code. - Joshua C. Estep; Christopher A. Healy (J. Comput. Sci. Coll., 2005)

Improving WCET by applying a WC code-positioning optimization. - Wankang Zhao; David B. Whalley; Christopher A. Healy; Frank Mueller 001 (ACM Trans. Archit. Code Optim., 2005)

Improving WCET by applying worst-case path optimizations. - Wankang Zhao; William C. Kreahling; David B. Whalley; Christopher A. Healy; Frank Mueller 001 (Real Time Syst., 2006)

Generalizing parametric timing analysis. - Joel Coffman; Christopher A. Healy; Frank Mueller 001; David B. Whalley (LCTES, 2007)

Visualizing execution paths. - Martin E. Ebersole; Christopher A. Healy (J. Comput. Sci. Coll., 2007)

Extending the Path Analysis Technique to Obtain a Soft WCET. - Paul Keim; Amanda Noyes; Andrew Ferguson; Joshua Neal; Christopher A. Healy (WCET, 2009)

International computing issues as a freshman seminar. - Christopher A. Healy (J. Comput. Sci. Coll., 2010)

Parametric timing analysis and its application to dynamic voltage scaling. - Sibin Mohan; Frank Mueller 001; Michael Root; William Hawkins 001; Christopher A. Healy; David B. Whalley; Emilio Vivancos (ACM Trans. Embed. Comput. Syst., 2010)

Computing across the curriculum as a means of revitalizing undergraduate computer science: panel discussion. - Bryan Catron; Chris Healy; Andrea Tartaro; Kevin Treu (J. Comput. Sci. Coll., 2015)

The parse machine. - Christopher A. Healy (J. Comput. Sci. Coll., 2015)

Computer science topics in first year writing seminars: panel discussion. - Bryan Catron; Chris Healy; Andrea Tartaro; Kevin Treu (J. Comput. Sci. Coll., 2016)

Computer science in general education: beyond quantitative reasoning. - Andrea Tartaro; Christopher A. Healy; Kevin Treu (J. Comput. Sci. Coll., 2016)

Computer Science Topics in First- and Second- Year Seminar Courses. - Valerie Barr; Bryan Catron; Christopher A. Healy; Kate Lockwood; Anil M. Shende; Andrea Tartaro; Kevin Treu (SIGCSE, 2017)

A mental game as a source of CS case studies. - Christopher A. Healy (J. Comput. Sci. Coll., 2017)

StreetTraffic: a library for traffic flow data collection and analysis. - Shengyi (Costa) Huang; Chris Healy (ACM Southeast Regional Conference, 2018)

Teaching the historical context of computing. - Christopher A. Healy (J. Comput. Sci. Coll., 2018)

Have Films Become More Visually Intense? - Jon Miller; Christopher A. Healy (ACM Southeast Regional Conference, 2019)

A programming workshop course to complement CS 1/2. - Christopher A. Healy (J. Comput. Sci. Coll., 2020)

Effective pedagogical practices in the computer science classroom. - Chris Healy; Andy D. Digh; Paula Gabbert; Michael P. Verdicchio (J. Comput. Sci. Coll., 2021)

Short courses in computer science. - Christopher A. Healy; Andrea Tartaro; Bryan Catron (J. Comput. Sci. Coll., 2021)

Computer science case studies from the census. - Christopher A. Healy (J. Comput. Sci. Coll., 2022)

Generating Functions without Toil. - Christopher A. Healy (J. Comput. Sci. Coll., 2023)