Publications
Gregory M. Kapfhammer
Gregory M. Kapfhammer Research Papers
- René Just, Gregory M. Kapfhammer, and Franz Schweiggert. Using Non-Redundant Mutation Operators and Test Suite Prioritization to Achieve Efficient and Scalable Mutation Analysis. In the Proceedings of the 23rd International Symposium on Software Reliability Engineering, Dallas, Texas, November 2012.
- Chu-Ti Lin, Kai-Wei Tang, Cheng-Ding Chen, and Gregory M. Kapfhammer. Reducing the Cost of Regression Testing by Identifying Irreplaceable Test Cases. In the Proceedings of the 6th International Conference on Genetic and Evolutionary Computing, Kitakyushu, Japan, August 2012.
- Philip F. Burdette, William F. Jones, Brian C. Blose, Gregory M. Kapfhammer. An Empirical Comparison of Java Remote Communication Primitives for Intra-Node Data Transmission. In ACM SIGMETRICS Performance Evaluation Review, 39(4), April 2012.
- Gregory M. Kapfhammer. Towards a Method for Reducing the Test Suites of Database Applications. In the Proceedings of the 5th International Conference on Software Testing, Verification and Validation (Poster Paper), Montreal, Canada, April 2012.
- Jonathan Miller Kauffman and Gregory M. Kapfhammer. A Framework to Support Research in and Encourage Industrial Adoption of Regression Testing Techniques. In the Proceedings of the 7th Testing: Academic and Industrial Conference, Montreal, Canada, April 2012.
Robert S. Roos
- Alexander P. Conrad, Robert S. Roos, and Gregory M. Kapfhammer. Empirically Studying the Role of Selection Operators During Search-Based Test Suite Prioritization. In the Proceedings of the ACM SIGEVO Genetic and Evolutionary Computation Conference, Portland, Oregon, July 2010.
- Gregory M. Kapfhammer, Chris Howell, and Robert S. Roos. An Examination of the Run-Time Performance of GUI Creation Frameworks. In Proceedings of the Second International Conference on the Principles and Practice of Programming in Java, Kilkenny City, Ireland, June 2003.
- Tiffany Bennett, Jennifer Hannon, Elizabeth Zehner, and Robert S. Roos. A Genetic Algorithm for Improved Shellsort Sequences. Poster presentation at the 2002 Genetic and Evolutionary Computation Conference (GECCO 2002), New York City, July 9-13, 2002.
- Robert S. Roos. Parameter Relaxation Methods In Memetic Algorithms. Presented at the Second Workshop on Memetic Algorithms, part of the 2001 Genetic and Evolutionary Computation Conference (GECCO 2001), July 7-11, San Francisco, 2001.
- Regular reviewer for ACM Computing Reviews since 1993, 56 published reviews.
- Judge at the ACM International Collegiate Programming Contest from 1996 through 2012.
- Judge at the ACM East Central North America Regional Programming Contest since 2002.
Student Research
Senior Thesis Research
- An Empirical Evaluation of Test Suite Reduction and Prioritization Techniques
- GA-Connect Four: Towards Evolving an Optimal Computer Opponent
- Using Artificial Fault Injection to Support Test Suite Prioritization
- A Genetic Algorithm to Improve Kernel Performance on Resource-Constrained Devices
- Snowcover: An Experimental Framework for Distributed Search-Based Test Suite Prioritization
- Techniques and Methodologies of a Successful Case Study of the Social Web
- Test Suite Prioritization With Greedy and Genetic Algorithms: An Empirical Study
- Performing APFD-Based Prioritization With Synthetic Fault Data
- An Evolutionary Approach to Airfoil Design
- Towards Cost Effective Test Suite Prioritization With Hill Climbing and Simulated Annealing
- Using Test Suite Prioritization to Avoid Database Restarts
- Incorporating Time Into Test Suite Reduction and Prioritization: An Empirical Study
- A Parallel Genetic Knapsack Solver Implemented with the CUDA Graphics Architecture
- A Comprehensive Framework for the Regression Testing of Procedural XML Applications
- Using Knapsack Algorithms to Store Music on Resource Constrained Devices
- Dynamic Path-Based Piracy Prevention
- Quantifying the Impact of Test Suite Reduction
- The Parallel Distributed Processing Model of Stroop Task Performance as a Recurrent Neural Network.
Regression Testing
The senior thesis research of Matthew Rummel ’04, focused on the design, implementation, and evaluation of a technique that could re-order the tests within a test suite so that faults are found earlier in the testing process. A comprehensive series of experiments demonstrated that Rummel’s test prioritization approach could efficiently improve the fault detection capability of JUnit test suites. Rummel’s senior thesis research also led to the publication of a full paper at the ACM SIGAPP Symposium on Applied Computing (SAC 2005).
Matthew Rummel and Instructor Gregory M. Kapfhammer traveled to Santa Fe, New Mexico in March of 2005 and Matthew presented his research to a standing room only audience. Rummel’s senior thesis research enabled him to develop a strong foundation in computer science and software engineering. These skills have served him well as a software developer at Raytheon Corporation in State College, PA.
Imitating Nature: Creating Images using Biological Models
Joseph Zumpella ’04 focused on creation of images using biologically-based pattern formation techniques—think ‘zebra stripes’ or ‘leopard sports’ or ‘giraffe-like coloration’—first proposed by Alan Turing. He then evolved these “reaction-diffusion textures” using genetic algorithms to create more interesting and intricate designs. Joe and his advisor, Dr. Andrew Thall, attended ACM’s SIGGRAPH ’04 conference in Los Angeles and presented his work at a poster-session, where it appeared alongside posters from Brown University and the University of Waterloo.
Collaborative Research Experiences for Women
In 2002 a team of three students – Tiffany Bennett, Jennifer Hannon, and Elizabeth Zehner – obtained funding from the Computing Research Association’s “Collaborative Research Experiences for Women” program to conduct research into genetic algorithms for finding improved shellsort sequences. Meeting weekly throughout the fall and spring semesters, the students researched, designed, and tested an algorithm that uses a hybrid, or memetic, genetic algorithm to generate novel increment sequences for use by shellsort. They had an opportunity to meet computer science professionals and udergarduate researchers from other schools at SIGCSE 2002 and to present the results of their research as a poster at GECCO 2002.
