A Set-Covering Approach to Customized Coverage Instrumentation

References

• Agrawal H (1994) Dominators, super blocks, and program coverage. Proc. 21st ACM SIGPLAN-SIGACT Sympos. on Principles of Programming Languages (ACM, New York), 25–34.Google Scholar
• Agrawal H (1999) Efficient coverage testing using global dominator graphs. Griswold WG, Horwitz S, eds. Proc. SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engrg. (ACM, New York), 11–20.Google Scholar
• Ball T, Larus JR (1994) Optimally profiling and tracing programs. ACM Trans. Programming Language Systems 16(4):1319–1360.Crossref, Google Scholar
• Chilakamarri K, Elbaum SG (2006) Leveraging disposable instrumentation to reduce coverage collection overhead. Software Testing Verify Reliability 16(4):267–288.Crossref, Google Scholar
• Dallmeier V, Lindig C, Zeller A (2005) Lightweight defect localization for Java. Proc. 19th Eur. Conf. of Object-Oriented Programming (Springer, Berlin), 528–550.Google Scholar
• Do H, Elbaum SG, Rothermel G (2005) Supporting controlled experimentation with testing techniques: An infrastructure and its potential impact. Empirical Software Engrg. 10(4):405–435.Crossref, Google Scholar
• GAMS Development Corporation (2018) General algebraic modeling system (GAMS) release 25.1.2. Accessed November 15, 2018, http://www.gams.com/.Google Scholar
• Gurobi Optimization LLC (2018) Gurobi optimizer reference manual. http://www.gurobi.com.Google Scholar
• Kasikci B, Ball T, Candea G, Erickson J, Musuvathi M (2014) Efficient tracing of cold code via bias-free sampling. Proc. USENIX Annual Tech. Conf. (USENIX Association, Berkley, CA), 243–254.Google Scholar
• Knuth DE (1968) The Art of Computer Programming, Volume I: Fundamental Algorithms (Addison-Wesley, Boston).Google Scholar
• Knuth DE, Stevenson FR (1973) Optimal measurement points for program frequency counts. BIT Numerical Mathematics 13(3):313–322.Crossref, Google Scholar
• Lattner C, Adve V (2004) LLVM: A compilation framework for lifelong program analysis & transformation. Proc. Internat. Sympos. on Code Generation and Optim. (IEEE, Piscataway, NJ).Google Scholar
• Liblit B (2014) The cooperative bug isolation project. http://research.cs.wisc.edu/cbi/.Google Scholar
• LLVM Project (2018) LLVM block frequency terminology. https://llvm.org/docs/BlockFrequencyTerminology.html.Google Scholar
• Michini C, Ohmann P, Liblit B, Linderoth J (2022) A set covering approach to customized coverage instrumentation. http://dx.doi.org/10.1287/ijoc.2021.0349.cd, https://github.com/INFORMSJoC/2021.0349.Google Scholar
• Misurda J, Childers BR, Soffa ML (2011) Jazz2: A flexible and extensible framework for structural testing in a Java VM. Proc. 9th Internat. Conf. on Principles and Practice of Programming in Java (ACM, New York), 81–90.Google Scholar
• Misurda J, Clause JA, Reed JL, Childers BR, Soffa ML (2005) Demand-driven structural testing with dynamic instrumentation. Roman G, Griswold WG, Nuseibeh B, eds. Proc. 27th Internat. Conf. on Software Engrg. (ACM, New York), 156–165.Google Scholar
• Mitchell JE (2002) Branch-and-cut algorithms for combinatorial optimization problems. Pardalos PM, Resende MGC, eds. Handbook of Applied Optimization (Oxford University Press, Oxford, UK), 65–77.Google Scholar
• Nishimatsu A, Jihira M, Kusumoto S, Inoue K (1999) Call-mark slicing: An efficient and economical way of reducing slice. Proc. 21st Internat. Conf. on Software Engrg. (ACM, New York), 422–431.Google Scholar
• Ohmann P, Liblit B (2013) Lightweight control-flow instrumentation and postmortem analysis in support of debugging. 28th IEEE/ACM Internat. Conf. on Automated Software Engrg. (IEEE, Piscataway, NJ), 378–388.Google Scholar
• Ohmann P, Liblit B (2017) Lightweight control-flow instrumentation and postmortem analysis in support of debugging. Automated Software Engrg. 24(4):865–904.Crossref, Google Scholar
• Ohmann P, Brooks A, D’Antoni L, Liblit B (2017) Control-flow recovery from partial failure reports. Vechev M, ed. Proc. 38th ACM SIGPLAN Conf. on Programming Language Design and Implementation (ACM, New York), 390–405.Google Scholar
• Ohmann P, Brown DB, Neelakandan N, Linderoth J, Liblit B (2016a) Encoding optimal customized coverage instrumentation. Technical Report TR1836, Department of Computer Sciences, University of Wisconsin-Madison, Madison.Google Scholar
• Ohmann P, Brown DB, Neelakandan N, Linderoth J, Liblit B (2016b) Optimizing customized program coverage. Proc. 31st IEEE/ACM Internat. Conf. on Automated Software Engrg. (ACM, New York), 27–38.Google Scholar
• Orso A, Liang D, Harrold MJ, Lipton R (2002) Gamma system: Continuous evolution of software after deployment. Proc. ACM SIGSOFT Internat. Sympos. on Software Testing and Analysis (ACM, New York), 65–69.Google Scholar
• Pankumhang T, Rutherford M (2015) Iterative instrumentation for code coverage in time-sensitive systems. Proc. 8th IEEE Internat. Conf. on Software Testing, Verification and Validation (IEEE, Piscataway, NJ), 1–10.Google Scholar
• Pavlopoulou C, Young M (1999) Residual test coverage monitoring. Proc. Internat. Conf. on Software Engrg. (ACM, New York), 277–284.Google Scholar
• Reiss SP, Renieris M (2001) Encoding program executions. Proc. 23rd Internat. Conf. on Software Engrg. (IEEE, Piscataway, NJ), 221–230.Google Scholar
• Rothermel G, Elbaum S, Kinneer A, Do H (2006) Software–artifact infrastructure repository. http://sir.unl.edu/portal/.Google Scholar
• Santelices RA, Jones JA, Yu Y, Harrold MJ (2009) Lightweight fault-localization using multiple coverage types. Proc. 31st Internat. Conf. on Software Engrg. (IEEE, Piscataway, NJ), 56–66.Google Scholar
• Tikir MM, Hollingsworth JK (2002) Efficient instrumentation for code coverage testing. ACM SIGSOFT Software Engineering Notes, vol. 27, 86–96.Google Scholar
• Tikir MM, Hollingsworth JK (2005) Efficient online computation of statement coverage. J. System Software 78(2):146–165.Crossref, Google Scholar
• Wu R, Xiao X, Cheung S, Zhang H, Zhang C (2016) Casper: An efficient approach to call trace collection. Proc. 43rd Annual ACM SIGPLAN-SIGACT Sympos. on Principles of Programming Languages (ACM, New York), 678–690.Google Scholar