bibliography - purdue university · 2006. 8. 7. · actions on softw are eng ineer ing ,...

BIBLIOGRAPHY

[1] A. Abdurazik, P. Ammann, W. Ding, and A. J. Offutt. Evaluation of three specification-based testing criteria. In Proceedings of Engineering of Complex Computer Systems,2000. ICECCS 2000, pages 179–187, September 2000.

[2] J. A. Abraham and W. K. Fuchs. Fault and error models for VLSI. In Proceedings of theIEEE, volume 74, pages 639–654, 1986.

[3] J. R. Abrial. The B-Book. Cambridge University Press, 1996.

[4] J. R. Abrial, E. Borger, and H. Langmaack. Formal Methods for Industrial Applications:Specifying and Programming the Steam Boiler Control, volume LNCS 1165. Springer-Verlag, October 1996.

[5] A. T. Acree. On mutation. PhD thesis, Georgia Institute of Technology, 1980.

[6] W. R. Adrion, M. A. Branstad, and J. C. Cherniavsky. Validation, verification, and testingof computer software. ACM Computing Surveys, 14(2):159–192, 1982.

[7] K. K. Aggrawal, Y. Singh, and A. Kaur. Code coverage based technique for prioritizing testcases for regression testing. SIGSOFT Software Engineering Notes, 29(5):1–4, 2004.

[8] H. Agrawal. Towards Automatic Debugging of Computer Programs. PhD thesis, PurdueUniversity, August 1991.

[9] H. Agrawal. Towards automatic debugging of computer programs. Technical ReportSERC-TR-193-P, Purdue University, August 1991.

[10] H. Agrawal. Dominators, super blocks, and program coverage. In In Proceedings ofPOPL 94, pages 25–34, 1994.

[11] H. Agrawal, R. A. DeMillo, R. Hathaway, W. M. Hsu, W. Hsu, E. W. Krauser, R. J. Mar-tin, A. P. Mathur, and E. Spafford. Design of mutant operators for the C programminglanguage. Technical Report SERC-TR-41-P, Purdue University, 1989.

[12] H. Agrawal, R. A. DeMillo, and E. H. Spafford. Dynamic slicing in the presence of un-constrained pointers. In TAV4: Proceedings of the symposium on Testing, analysis, andverification, pages 60–73, New York, NY, USA, 1991. ACM Press.

695

696Foundations of Software Testing Bibliography

[13] H. Agrawal and J. R. Horgan. Dynamic program slicing. In PLDI ’90: Proceedings of theACM SIGPLAN 1990 conference on Programming language design and implementation,pages 246–256, New York, NY, USA, 1990. ACM Press.

[14] H. Agrawal, J. R. Horgan, E. W. Krauser, and S. London. Incremental regression testing.In ICSM ’93: Proceedings of the Conference on Software Maintenance, pages 348–357,Washington, DC, USA, 1993. IEEE Computer Society.

[15] K. Agrawal and J. A. Whittaker. Experiences in applying statistical testing to a real-time,embedded software system. In Proceedings of the Pacific Northwest Software QualityConference, pages 154–170, 1993.

[16] V. D. Agrawal, S. C. Seth, and P. Agrawal. Fault coverage requirement in productiontesting of lsi circuit. IEEE Journal of Solid-State Circuits, 17(1):57–61, February 1982.

[17] J. M. Agustin. Improving software quality through extreme coverage with JBlanket. Mas-ter’s thesis, University of Hawaii, May 2003.

[18] A. V. Aho, A. T. Dahbura, D. Lee, and M. U. Uyar. An optimization technique for protocolconformance test generation based on UIO sequences and rural chinese postman tours.IEEE Transactions on Communications, 39(11):1604–1615, 1991.

[19] A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools.Addison Wesley, January 1986.

[20] A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: principles, techniques, and tools.Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1986.

[21] B. K. Aichernig. Contract-based mutation testing in the refinement calculus. In RE-FINE02, Formal Aspects of Computing Refinement Workshop. Elsevier, 2002.

[22] V. S. Alagar, O. Ormandjieva, and M. Zheng. Specification-based testing for real-timereactive systems. In Proceedings 34th International Conference on Technology of Object-Oriented Languages and Systems. TOOLS 34, pages 25–36, July 2000.

[23] R. T. Alexander, J. M. Bieman, S. Ghosh, and B. Ji. Mutation of Java objects. In Pro-ceedings of the 13th IEEE International Symposium on Software Reliability Engineering(ISSRE 2002), November 2002.

[24] A. Allen and D. de Champeaux. Extending the statechart formalism: event scheduling &disposition. SIGPLAN Notices, 30(10):1–16, 1995.

[25] R. Alur, C. Courcoubetis, N. Halbwachs, D. L. Dill, and H. Wong-Toi. Minimization of timedtransition systems. In Proceedings of the Third International Conference on ConcurrencyTheory, pages 340–354. Springer-Verlag, 1992.

[26] R. Alur and D. L. Dill. Automata for modeling real-time systems. In Proceedings of theseventeenth international colloquium on Automata, languages and programming. LNCS443, pages 322–335. Springer-Verlag New York, Inc., 1990.

c©Aditya P. Mathur. Author’s written permission is required to make copies of any part of this book.Latest revision of this chapter: August 7, 2006


[27] R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science,126:183–235, 1994.

[28] F. Ambert, F. Bouquet, S. Chemin, S. Guenaud, B. Legeard, F. Peureux, N. Vacelet,and M. Utting. BZ-TT: A tool-set for test generation from Z and B using constraint logicprogramming. In Proceedings of Formal Approaches to Testing of Software, SatelliteWorkshop of CONCUR02, pages 105–119, Brno, Czech Republic, August 2002.

[29] N. Amla and P. Ammann. Using Z specifications in category partition testing. In Pro-ceeding of the Seventh Annual Conference On Computer Assurance, pages 3–10, June1992.

[30] P. Ammann. System testing via mutation analysis of model checking specifications. SIG-SOFT Software Engineering Notes, 25(1):33, 2000.

[31] D. M. S. Andre. Pilot mutation system (PIMS) user’s manual, Technical report GIT-ICS-79/04. Georgia Institute of Technology, April 1979.

[32] J. H. Andrews, L. C. Briand, and Y. Labiche. Is mutation an appropriate tool for testingexperiments? In ICSE ’05: Proceedings of the 27th international conference on Softwareengineering, pages 402–411, New York, NY, USA, 2005. ACM Press.

[33] T. Apiwattanapong, A. Orso, and M. J. Harrold. A differencing algorithm for object-oriented programs. In ASE ’04: Proceedings of the 19th IEEE international conferenceon Automated software engineering, pages 2–13, Washington, DC, USA, 2004. IEEEComputer Society.

[34] T. Apiwattanapong, A. Orso, and M. J. Harrold. Jdiff: A differencing technique and tool forobject-oriented programs. Automated Software Engineering: An International Journal, Toappear.

[35] A. W. Appel. Modern compiler implementation in Java. Cambridge University Press, NewYork, NY, USA, 1998.

[36] J. Armstrong and L. Barroca. Specification and verification of reactive system behaviour:The railroad crossing example. Real-Time Systems, 10:143–178, 1996.

[37] A. L. Baker and S. H. Zweben. A comparison of measures of control flow complexity.IEEE Transactions on Software Engineering, SE-6(6):506–512, November 1980.

[38] M. J. Balcer, W. Hasling, and T. J. Ostrand. Automatic generation of test scripts fromformal test specifications. In TAV3: Proceedings of the ACM SIGSOFT ’89 third sympo-sium on Software testing, analysis, and verification, pages 210–218, New York, NY, USA,1989. ACM Press.

[39] D. Baldwin and F. G. Sayward. Heuristics for determining equivalence of program muta-tions. Technical Report Research Report No. 276, Yale University, Department of Com-puter Science, 1979.



[40] T. Ball. The Use of Control-Flow and Control Dependence in Software Tools. PhD thesis,University of Wisconsin-Madison, 1993.

[41] T. Ball and J. R. Larus. Optimally profiling and tracing programs. ACM Trans. Program.Lang. Syst., 16(4):1319–1360, 1994.

[42] V. R. Basili, L.C. Briand, and W. L. Melo. A validation of object-oriented design metricsas quality indicators. IEEE Transactions Software Engineering, 22(10):751–761, 1996.

[43] S. Bates and S. Horwitz. Incremental program testing using program dependence graphs.In POPL ’93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principlesof programming languages, pages 384–396, New York, NY, USA, 1993. ACM Press.

[44] F. Bazzichi and I. Spadafora. An automatic generator for compiler testing. IEEE Trans-actions on Software Engineering, SE-8(4):343–353, July 1982.

[45] M.v.D. Beeck. A comparison of statechart variants. In Egidio Astesiano, editor, Proceed-ings of the Third International Symposium Organized Jointly with the Working GroupProvably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Sys-tems, pages 128 – 148. Springer-Verlag, 1994.

[46] B. Beizer. Software Testing Techniques. Van Nostrand Reinhold, New York, secondedition, 1990.

[47] F. Belina and D. Hogrefe. The ccit-specification and description language SDL. ComputerNetworks and ISDN Systems, 16(4):311–341, 1989.

[48] F. Belina, D. Hogrefe, and A. Sarma. SDL with applications from protocol specification.Prentice-Hall, Inc. Upper Saddle River, NJ, USA, 1991.

[49] F. Belli. Finite state testing and analysis of graphical user interfaces. In ISSRE 2001:Proceedings of the 12th International Symposium on Software Reliability Engineering,pages 34–43. IEEE Computer Society, 2001.

[50] F. Belli, C.J. Budnik, and N. Nissanke. Finite-state modeling, analysis, and testing ofsystem vulnerabilities. In Proceedings of the 17th International Conference on Architec-ture of Computing Systems (ARCS), volume 2981, pages 19–33. Springer-Verlag, March2004.

[51] F. Belli and J. Dreyer. Program segmentation for controlling test coverage. In Proceedingsof the Eight International Symposium on Software Reliability Engineering (ISSRE 1997),Albuquerque, NM, pages 72–83, November 1997.

[52] P. Benedusi, A. Cmitili, and U. De Carlini. Post-maintenance testing based on pathchange analysis. In Proceedings of the Conference on Software Maintenance, pages352–361, October 1988.

[53] M. Benjamin, D. Geist, A. Hartman, G. Mas, R. Smeets, and Y. Wolfsthal. A study incoverage-driven test generation. In DAC ’99: Proceedings of the 36th ACM/IEEE confer-ence on Design automation, pages 970–975, New York, NY, USA, 1999. ACM Press.



[54] Philip J. Bernhard. A reduced test suite for protocol conformance testing. ACM Transac-tions Software Engineering Methodology, 3(3):201–220, 1994.

[55] J. Bible, G. Rothermel, and D. S. Rosenblum. A comparative study of coarse- and fine-grained safe regression test-selection techniques. ACM Transactions on Software Engi-neering Methodology, 10(2):149–183, 2001.

[56] J. M. Bieman, S. Ghosh, and R. T. Alexander. A technique for mutation of Java ob-jects. In Proceedings of the 16th IEEE Internation Conference on Automated SoftwareEngineering (ASE 2001), pages 337–340, November 2001.

[57] J.M. Bieman and H. Yin. Designing for software testability using automated oracles. InProceedings of International Test Conference, pages 900–907, September 1992.

[58] D. Binkley. Precise executable interprocedural slices. ACM Letters on ProgrammingLanguages and Systems, 2(1-4):31–45, March–December 1993.

[59] D. Binkley. Semantics guided regression test cost reduction. IEEE Transactions on Soft-ware Engineering, 23(8):498–516, 1997.

[60] D.B. Boardman, G. Greene, V. Khandelwal, and A. P. Mathur. Listen: A tool to investigatethe use of sound for the analysis of program behavior. In COMPSAC, pages 184–191,1995.

[61] G.v. Bochmann, R. Dssouli, and J. R. Zhao. Trace analysis for conformance and arbi-tration testing. IEEE Transactions on Software Engineering, 15(November):1347–1356,June 1989.

[62] B. W. Boehm, J. R. Brown, and M. Lipow. Quantitative evaluation of software quality.In ICSE ’76: Proceedings of the 2nd international conference on Software engineering,pages 592–605, Los Alamitos, CA, USA, 1976. IEEE Computer Society Press.

[63] B. W. Boehm, R. K. McClean, and D. B. Urfrig. Some experience with automated aids tothe design of large-scale reliable software. IEEE Transactions on Software Engineering,SE-1(1):125–133, March 1975.

[64] K. Bogdanov. Automated Testing of Harel’s Statecharts. PhD thesis, University ofSheffield, January 2000.

[65] T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS.Computer Networking and ISDN Systems, 14(1):25–59, 1987.

[66] G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language Guide.Addison-Wesley, 1999.

[67] R. C. Bose, I. M. Chakravarti, and D. E. Knuth. On methods of constructing sets ofmutually orthogonal latin squares using a computer. I. Technometrics, 2(4):507–516,November 1960.



[68] R. C. Bose, I. M. Chakravarti, and D. E. Knuth. On methods of constructing sets ofmutually orthogonal latin squares using a computer. II. Technometrics, 3(4):111–117,November 1961.

[69] R. C. Bose, S. S. Shrikhande, and E. T. Parker. Further results on the construction ofmutually orthogonal Latin squares and the falsity of Euler’s conjecture. Canadian Journalof Mathematics, 12:189–203, 1960.

[70] C. Boyapati, S.Khurshid, and D. Marinov. Korat: automated testing based on Java predi-cates. In ISSTA ’02: Proceedings of the 2002 ACM SIGSOFT international symposium onSoftware testing and analysis, pages 123–133, New York, NY, USA, 2002. ACM Press.

[71] R. Brownlie, P. James Prowse, and M. S. Phadke. Robust testing of at&t pmx/starmailusing oats. AT&T Technical Journal, 71(3):41–47, 1992.

[72] R. C. Bryce and C. J. Colbourn. Test prioritization for pairwise interaction coverage. In A-MOST ’05: Proceedings of the first international workshop on Advances in model-basedtesting, pages 1–7, New York, NY, USA, 2005. ACM Press.

[73] A. L. Buchsbaum, H. Kaplan, A. Rogers, and J. R. Westbrook. A new, simpler linear-timedominators algorithm. ACM Transactions on Programming Languages and Systems,20(6):1265–1296, 1998.

[74] T. A. Budd. Mutation analysis of program test data. PhD thesis, Yale University, NewHaven, 1980.

[75] T. A. Budd. Mutation analysis: ideas, examples, problems and prospects. In B. Chan-drasekaran and S. Radicchi, editors, Computer Program Testing, pages 129–148. NorthHolland, Amsterdam, July 1981.

[76] T. A. Budd, R. A. DeMillo, R. J. Lipton, and F. G. Sayward. Theoretical and empiricalstudies on using program mutation to test the functional correctness of programs. InPOPL ’80: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles ofprogramming languages, pages 220–233, New York, NY, USA, 1980. ACM Press.

[77] T. A. Budd and A. S. Gopal. Program testing by specification mutation. Computer Lan-guages, 10(1):63–73, 1985.

[78] T. A. Budd and R. J. Lipton. Mutation analysis of decision table programs. In Proceedingsof the 1978 Conference on Informatlon Science and Systems, pages 346–349, JohnsHopkins Univ, Baltimore, MD, USA, 1978.

[79] T. A. Budd and R. J. Lipton. Proving LISP programs using test data. In Digest for theWorkshop on Software Testing and Test Documentation, pages 374–403, 1978.

[80] L. Burdy, Y. Cheon, D. Cok, M. Ernst, J. Kiniry, G. Leavens, K. R. M. Leino, and E. Poll.An overview of JML tools and applications. International Journal on Software Tools forTechnology Transfer, 7(3):212–232, June 2005.



[81] M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. InSIGPLAN ’86: Proceedings of the 1986 SIGPLAN symposium on Compiler construction,pages 162–175, New York, NY, USA, 1986. ACM Press.

[82] K. Burr and W. Young. Combinatorial test techniques: Table-based automation, test gen-eration, and test coverage. In Proceedings of the International Conference on SoftwareTesting, Analysis, and Review, pages 503–513, October 1998.

[83] S. Burton. Automated testing from Z specifications. Technical Report YCS-2000-329,University of York, Heslington, York, UK, 2000.

[84] S. Burton. Automated Generation of High Integrity Test Suits from Graphical Specifica-tions. PhD thesis, University of York, Department of Computer Science, March 2002.

[85] K. A. Bush. Orthogonal Arrays. PhD thesis, University of North carolina, Chapel Hill,1950.

[86] M. Bybro. A mutation testing tool for Java programs. Master’s thesis, Royal Instituteof Technology, Department of Numerical Analysis and Computer Science, SE-100 44Stockholm, Sweden, August 2003.

[87] J. W. Cangussu, P. C. Masiero, and J. C. Maldonado. Programmed execution of state-charts (in Portugese). In Proceedings of VII Brazilian Symposium of Software Engeneer-ing, Rio de Janeiro-RJ/Brazil, pages 3–14, 1994.

[88] R. Cardell-Oliver and T. Glover. A practical and complete algorithm for testing real-timesystems. In Proceedings of the 5th International Symposium on Formal Techniques inReal-Time and Fault-Tolerant Systems, volume 1486, pages 251–261. Springer-Verlag,1998.

[89] D. A. Carrington and P. A. Stocks. A tale of two paradigms: Formal methods and softwaretesting. In Jonathan P. Bowen and J. Anthony Hall, editors, Z User Workshop, Cambridge1994, Workshops on Computing, pages 51–68. Springer-Verlag, 1994.

[90] R. H. Carver and K. C. Tai. Test sequence generation from formal specifications ofdistributed programs. In Proceedings of the 15th International Conference on DistributedComputing Systems, pages 360–367, 1995.

[91] A. Celentano, S. C.Reghizzi, P. Della Vigna, C. Ghezzi, G. Granata, and F. Savoretti.Compiler testing using a sentence generator. Software – Practice and Experience,10:897–918, 1980.

[92] M. L. Chaim. Poke-tool–uma ferramenta para suporte ao teste estrutural de pro-gramas baseado em anelise de fluxo de dados (in Portugese). Master’s thesis,DCA/FEEC/Unicamp, Campinas, Campinas, Brazil, April 1991.

[93] C.Hammer, M. Grimme, and J. Krinke. Dynamic path conditions in dependence graphs.In PEPM ’06: Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluationand semantics-based program manipulation, pages 58–67, New York, NY, USA, 2006.ACM Press.



[94] W. Y. L. Chan, C. T. Vuong, and M. R. Otp. An improved protocol test generation pro-cedure based on UIOS. In Symposium proceedings on Communications architectures &protocols, pages 283–294. ACM Press, 1989.

[95] C-Y. Chen, R. Chapman, and K. H. Chang. Usage based test generation from Object-Z formal specification. In Proceedings of the 1998 International Computer Symposium,workshop on software engineering and Database systems, pages 244–251, Taiwan, De-cember 1998.

[96] C-Y. Chen, R. Chapman, and K. H. Chang. Test scenario and regression test suite gener-ation from Object-Z formal specification for object-oriented program testing. In ACM-SE37: Proceedings of the 37th annual Southeast regional conference (CD-ROM), pages37–39, New York, NY, USA, 1999. ACM Press.

[97] T. Y. Chen and M. F. Lau. Two test data selection strategies towards testing of booleanspecifications. In Proceedings of The Twenty-First Annual International Computer Soft-ware and Applications Conference, pages 608 –611, 13-15 August 1997.

[98] T. Y. Chen, M. F. Lau, and Y. T. Yu. Mumcut: A fault-based strategy for testing booleanspecifications. In APSEC ’99: Proceedings of the Sixth Asia Pacific Software EngineeringConference, page 606, Washington, DC, USA, 1999. IEEE Computer Society.

[99] T. Y. Chen and Y. T. Yu. On the relationship between partition and random testing. IEEETransactions on Software Engineering, 20(12):977–980, December 1994.

[100] T. Y. Chen and Y. T. Yu. A more general sufficient condition for partition testing to bebetter than random testing. Information Processing Letters, 57(3):145–149, February1996.

[101] Y-F. Chen, D. S. Rosenblum, and K-P. Vo. TestTube: a system for selective regressiontesting. In ICSE ’94: Proceedings of the 16th international conference on Software engi-neering, pages 211–220. IEEE Computer Society Press, 1994.

[102] P. Chevalley and P. Thevenod-Fosse. Automated generation of statistical test cases fromUML state diagrams. In Proceedings of the 25th Annual International Computer Softwareand Applications Conference, COMPSAC 2001, pages 205 –214, October 2001.

[103] P. Chevalley and P. Thevenod-Fosse. An empirical evaluation of statistical testing de-signed from UML state diagrams: the flight guidance system case study. In Proceedingsof the 12th International Symposium on Software Reliability Engineering, pages 254 –263, November 2001.

[104] S. R. Chidamber, D. P. Darcy, and C. F. Kemerer. Managerial use of metrics for object-oriented software: An exploratory analysis. IEEE Transactions Software Engineering,24(8):629–639, 1998.

[105] S. R. Chidamber and C. F. Kemerer. A metrics suite for object oriented design. IEEETransactions Software Engineering, 20(6):476–493, 1994.



[106] J. J. Chilenski and S. P. Miller. Applicability of modified condition/decision coverage tosoftware testing. In Software Engineering Journal, pages 193–200, September 1994.

[107] B. Choi. Software testing using high performance computers. PhD thesis, Purdue Uni-versity, West Lafayette, IN, 1990. Advisor: Aditya Mathur.

[108] B. Choi and A. P. Mathur. Experience with PMothra: A tool for mutant based testing on ahypercube. In Proceedings of Distributed and Multiprocessor Systems Workshop, pages237–254, October 1989.

[109] B. Choi and A. P. Mathur. Use of fifth generation computers for high performance reli-able software testing (final report). Technical Report SERC-TR-72-P, Purdue University,Software Engineering Research Center, West Lafayette, IN, USA, April 1990.

[110] B. Choi and A. P. Mathur. High performance mutation testing. Journal of Systems andSoftware, 20(2):135–152, February 1993.

[111] B. Choi, A. P. Mathur, and B. Pattison. Pmothra: scheduling mutants for execution on ahypercube. In TAV3: Proceedings of the ACM SIGSOFT ’89 third symposium on Softwaretesting, analysis, and verification, pages 58–65, New York, NY, USA, 1989. ACM Press.

[112] T. S. Chow. Testing software design modelled by finite state machines. IEEE Transactionson Software Engineering, SE-4(3):178–187, May 1978.

[113] T. Chusho. Test data selection and quality estimation based on the concept of essentialbranches for path testing. IEEE Transactions on Software Engineering, 13(5):509–517,1987.

[114] V. Chvltal. A greedy heuristic for the set-covering problem. Mathematics of OperationsResearch, 4:233–235, 1979.

[115] D. Clarke. Testing real-time constraints. PhD thesis, University of Pennsylvania, MS-CIS-96-33, 1996.

[116] D. Clarke and I. Lee. Automatic generation of tests for timing constraints from require-ments. In Proceedings of the Third International Workshop on Object-Oriented Real-Time Dependable Systems, Newport Beach, California, 1997.

[117] E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state con-current systems using temporal logic specifications. ACM Transactions on ProgrammingLanguages and Systems, 8(2):244–263, 1986.

[118] E. M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 2000.

[119] L. A. Clarke, A. Podgurski, D. J. Richardson, and S. J. Zeil. A comparison of data flowpath selection criteria. In ICSE ’85: Proceedings of the 8th international conference onSoftware engineering, pages 244–251, Los Alamitos, CA, USA, 1985. IEEE ComputerSociety Press.



[120] L. A. Clarke, A. Podgurski, D. J. Richardson, and S. J. Zeil. A formal evaluation of dataflow path selection criteria. IEEE Transactions on Software Engineering, 15(11):1318–1332, 1989.

[121] D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton. The combinatorial designapproach to automatic test generation. IEEE Software, 13(5):83–89, September 1996.

[122] D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton. The AETG system: Anapproach to testing based on combinatorial design. IEEE Transactions on Software En-gineering, 23(7):437–443, July 1997.

[123] D. M. Cohen, S. R. Dalal, A. Kajla, and G. C. Patton. The Automatic Efficient TestsGenerator. In Procedings of the Fifth International Symposium on Software Reliability,pages 303–309. IEEE Press, 1994.

[124] D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton. The combinatorial design ap-proach to automatic test generation. IEEE Software, 13(5):83–89, September 1996.

[125] D. M. Cohen and M. L. Fredman. New techniques for designing qualitatively independentsystems. Technical Report DCS-96-114, Rutgers University, New Jersey, USA, Novem-ber 1996.

[126] M. B. Cohen, C. J. Colburn, and A. C. H. Ling. Augmenting simulated annealing tobuild interaction test suites. In 14th IEEE Intl. Symp. on Software Reliability Engineer-ing(ISSRE 2003), pages 394–405, November 2003.

[127] M. B. Cohen, P. B. Gibbons, W. B. Mugridge, and C. J. Colbourn. Constructing test suitesfor interaction testing. In Proceedings of the 25th International Conference on Softwareengineering, pages 38–48. IEEE Computer Society, 2003.

[128] C. J. Colburn and J. H. Dinitz. Mutually orthogonal Latin squares: a brief survey ofconstructions. Journal of Statistical Planning and Inference, 95:9–48, 2001.

[129] D. M. Colburn and J. H. Dinitz, editors. The CRC handbook of combinatorial design. CRCPress, 1996.

[130] D. Coleman, F. Hayes, and S. Bear. Introducing objectcharts or how to use statecharts inobject-oriented design. IEEE Transactions on Software Engineering, 18(1):9–18, 1992.

[131] Reliable Software Technologies Corporation. Testability of object-oriented systems.Technical Report GCR 95-675, National Institute of Standards and Technology, June1995.

[132] S. R. Dalal, A. Jain, N. Karunanithi, J. Leaton, and C. Lott. Model-based testing of ahighly programmable system. In Fevzi Belli, editor, Proceedings of the Ninth InternationalSymposium on Software Reliability Engineering, pages 174–178, November 1998.

[133] S. R. Dalal, A. Jain, and J. Poore. Workshop on avances in model-based software testing.In Proceedings of the 27th International Conference on Software Engineering, St Louis,page 860. IEEE Press, 2005.



[134] S. R. Dalal and C.L. Mallows. Factor-covering designs for testing software. Technomet-rics, 40(3):234–243, 1998.

[135] B. Dandanell. Rigorous development using RAISE. In SIGSOFT ’91: Proceedings ofthe conference on Software for citical systems, pages 29–43, New York, NY, USA, 1991.ACM Press.

[136] M. Daran and P. Thevenod-Fosse. Software error analysis: a real case study involvingreal faults and mutations. In ISSTA ’96: Proceedings of the 1996 ACM SIGSOFT inter-national symposium on Software testing and analysis, pages 158–171, New York, NY,USA, 1996. ACM Press.

[137] J. Davies and J. Woodcock. Using Z. Prentice Hall, 1996.

[138] C. Daws and S. Yovine. Reducing the number of clock variables of timed automata.In Proceedings of the 17th IEEE Real-Time Systems Symposium, pages 73–81. IEEEPress, December 1996.

[139] M. C. F. de Oliveira, M. A. S. Turine, and P. C. Masiero. A statechart-based model forhypermedia applications. ACM Transactions on Information Systems, 19(1):28–52, 2001.

[140] M. E. Delamaro. Mutacoo de interface: um criterio de adequacao inter-procedementalpara o teste de integracao. PhD thesis, University of Sao Paulo, Sao Carlos, PhysicsInstitute of Sao Carlos, June 1997.

[141] M. E. Delamaro and J. C. Maldonado. Interface mutation: assessing testing quality atinterprocedural level. In Proceedings. SCCC ’99. XIX International Conference of theChilean Computer Society, pages 78–86, 1999.

[142] M. E. Delamaro, J. C. Maldonado, and A. P. Mathur. Integration testing using interfacemutation. In Proceedings Seventh International Symposium on Software Reliability En-gineering, pages 112–121. IEEE Computer Society, October-November 1996.

[143] M. E. Delamaro, J. C. Maldonado, and A. P. Mathur. Interface mutation: an approach forintegration testing. IEEE Transactions on Software Engineering, 27(3):228–247, March2001.

[144] M. E. Delamaro, J. C. Maldonado, and A. Vincenzi. Proteum/IM 2.0: An integrated mu-tation testing environment. In Proceedings of Mutation 2000: Mutation Testing in theTwentieth Century, October 2000.

[145] P. Dembinski and S. Budkowski. Specification language Estelle. In M. Diaz, editor, TheFormal Description Technique, pages 35–75. EsteUe, North-Holland, 1989.

[146] R. A. DeMillo. Mutation analysis as a tool for software quality assurance. In Proceedingsof COMPSAC’80, October 1980.

[147] R. A. DeMillo. Program mutation: An approach to software testing. Technical report,Georgia Institute of Technology, 1983.



[148] R. A. DeMillo. Progress toward automated software testing. In ICSE ’91: Proceedings ofthe 13th international conference on Software engineering, pages 180–183, Los Alami-tos, CA, USA, 1991. IEEE Computer Society Press.

[149] R. A. DeMillo, D. S. Guindi, K. N. King, W. M. McCracken, and A. J. Offutt. An extendedoverview of the MOTHRA testing environment. In Proceedings of the Second Workshopon Software Testing, Verification, and Analysis, Banff, Canada, July 1988.

[150] R. A. DeMillo, E. W. Krauser, and A. P. Mathur. Compiler integrated program mutation.In Proceedings of COMPSAC ’91, pages 351–356, Tokyo, Japan, 1991. IEEE ComputerSociety Press.

[151] R. A. DeMillo, R. J. Lipton, and A. J. Perlis. Social processes and proofs of theorems andprograms. In POPL ’77: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium onPrinciples of programming languages, pages 206–214, New York, NY, USA, 1977. ACMPress.

[152] R. A. DeMillo, R. J. Lipton, and A. J. Perlis. Response from R. A. DeMillo and R. J. Liptonand A. J. Perlis. SIGSOFT Software Engineering Notes, 3(2):16–17, 1978.

[153] R. A. DeMillo, R. J. Lipton, and F. G. Sayward. Hints on test data selection. IEEEComputer, 11(4):34–41, April 1978.

[154] R. A. DeMillo and A. P. Mathur. On the use of software artifacts to evaluate the ef-fectiveness of mutation analysis for detecting errors in production software. TechnicalReport SERC-TR-92-P, Purdue University, Software Engineering Research Center, WestLafayette, IN, USA, February 1991.

[155] R. A. DeMillo and A. P. Mathur. A grammar based fault classification scheme and itsapplication to the classification of the errors of TEX. Technical Report SERC-TR-165-P, Purdue University, Software Engineering Research Center, West Lafayette, IN, USA,September 1995.

[156] R. A. DeMillo, W. M. McCracken, R. J. Martin, and J.F Passafiume. Software Testing andEvaluation. Addison-Wesley, January 1987.

[157] R. A. DeMillo and A. J. Offutt. Constraint based automatic test data generation. IEEETransactions on Software Engineering, 17(9):900–910, 1991.

[158] R. A. DeMillo and A. J. Offutt. Experimental Results from an Automatic Test Case Gen-erator. ACM Transactions on Software Engineering Methodology, 2(2):109–127, April1993.

[159] R. A. DeMillo and A. J. Offutt. Experimental results from an automatic test case genera-tor. ACM Transactions Software Engineering Methodology, 2(2):109–127, 1993.

[160] J. Denes and A. D. Keedwell. Latin Squares and their Applications. Academic Press,New York, Amsterdam, The Netherlands, 1974.



[161] R. Denney. Test-case generation from Prolog-based specifications. IEEE Software,8(2):49–57, March 1991.

[162] D. S. deSouza, J. C. Maldonado, S. C. P. F. Fabbri, and L. W. deSouza. Mutation testingapplied to Estelle specifications. In Proceedings of the 33rd Annual Hawaii InternationalConference on System Sciences, volume 1, pages 1–10, January 2000.

[163] H. Do, G. Rothermel, and A. Kinneer. Empirical studies of test case prioritization ina JUnit testing environment. In Proceedings of International Symposium on SoftwareReliability Engineering, pages 113–124, 2004.

[164] H. Do, G. Rothermel, and A. Kinneer. Prioritizing JUnit test cases: An empirical assess-ment and cost-benefits analysis. Empirical Software Engineering, 11(1):33–70, March2006.

[165] A Druseikis and C. Frederick. Syntax errors and their impact on recovery schemes andlanguage design. Technical report, Computer Science Department, University of Arizona,Tucson, 1977.

[166] A. G. Duncan and J. S. Hutchison. Using attributed grammars to test designs and imple-mentations. In ICSE ’81: Proceedings of the 5th international conference on Softwareengineering, pages 170–178, Piscataway, NJ, USA, 1981. IEEE Press.

[167] J. Duran and S. C. Ntafos. An evaluation of random testing. IEEE Transactions onSoftware Engineering, SE-10(4):438–444, July 1984.

[168] H. P. e. Vranken, M.F. Witteman, and R. C. van Wuijtswinkel. Design for testability inhardware-software systems. IEEE Des. Test, 13(3):79–87, 1996.

[169] K. El-Fakih, N. Yevtushenko, and G. v. Bochmann. FSM-based incremental conformancetesting methods. IEEE Transaction on Software Engineering, 30(7):425–436, 2004.

[170] S. Elbaum, G.Rothermel, S. Kanduri, and A. G. Malishevsky. Selecting a cost-effectivetest case prioritization technique. Software Quality Control, 12(3):185–210, 2004.

[171] W. R. Elmendorf. Controlling the functional testing of an operating system. IEEE Trans-actions on Systems, Science, and Cybernetics, SSC-5(4):284–289, October 1969.

[172] A. En-Nouaary, R. Dssouli, and F. Khendek. Testing embedded real-time systems. InProceedings of the Seventh International Conference on Real-Time Computing Systemsand Applications, pages 417–424, December 2000.

[173] A. En-Nouaary, R. Dssouli, and F. Khendek. Timed Wp method: testing real-time sys-tems. IEEE Transactions on Software Engineering, 28(11):1023–1038, November 2002.

[174] A. En-Nouaary, R. Dssouli, F. Khendek, and A. Elqortobi. Timed test cases generationbased on state characterization technique. In Proceedings of the Seventh InternationalIEEE Conference on Developments in Power System Protection, pages 58–61, 2001.



[175] A. En-Nouaary, F. Khendek, and R. Dssouli. Fault coverage in testing real-time systems.In Proc. Sixth International Conference on Real-Time Computing Systems and Applica-tions, RTCSA ’99, pages 150–157, December 1999.

[176] L. Euler. Recherches sur une nouvelle espece de quarres magiques. Verh. ZeeuwschGen. Wetensch. Vlissingen, 9:85–239, 1782.

[177] S. C. P. F. Fabbri. Use of mutation analysis in the context of reactive systems: a contribu-tion to the establishment of testing and validation strategies (in Portugese). PhD thesis,Physics Institute of Sao Carlos, University of Sao Paulo, October 1996.

[178] S. C. P. F. Fabbri, M. E. Delamaro, J. C. Maldonado, and P. C. Masiero. Mutation analysistesting for finite state machines. In Proceedings of the Fifth International Symposium onSoftware Reliability Engineering, pages 220–229, November 1994.

[179] S. C. P. F. Fabbri, J. C. Maldonado, P. C. Masiero, and M. E. Delamaro. A tool to sup-port finite state machine validation based on mutation testing. In Proceedings of the19th International Conference of the Chilean Computer Science Society, pages 96–104,November 1999.

[180] S. C. P. F. Fabbri, J. C. Maldonado, T. Sugeta, and P. C. Masiero. Mutation testing appliedto validate specifications based on statecharts. In Proceedings of the Tenth InternationalSymposium on Software Reliability Engineering, pages 210–219, 1999.

[181] N. E. Fenton and N. Ohlsson. Quantitative analysis of faults and failures in a complexsoftware system. IEEE Transactions on Software Engineering, 26(8):797–814, August2000.

[182] J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and itsuse in optimization. In Proceedings of the 6th Colloquium on International Symposiumon Programming, pages 125–132, London, UK, 1984. Springer-Verlag.

[183] K. Fischer, F. Raji, and A. Chruscicki. A methodology for retesting modified software. InProceedings of the National Telecommunications Conference, volume B-6-3, pages 1–6,1981.

[184] V. N. Fleyshgakker and S. N. Weiss. Efficient mutation analysis: a new approach. In IS-STA ’94: Proceedings of the 1994 ACM SIGSOFT international symposium on Softwaretesting and analysis, pages 185–195, New York, NY, USA, 1994. ACM Press.

[185] L. D. Fosdick and L. Osterweil. Data flow analysis in software reliability. ComputingSurveys, 8(3):305–330, September 1976.

[186] K. A. Foster. Error sensitive test case analysis (ESTCA). IEEE Transactions on SoftwareEngineering, SE-6(3):258–264, May 1980.

[187] K. A. Foster. Sensitive test data for logic expressions. ACM SIGSOFT Software Engi-neering Notes, 9(6):120–126, April 1984.



[188] P. G. Frankl and S. N. Weiss. An experimental comparison of the effectiveness of branchtesting and and data flow testing. IEEE transactions on Software Engineering, 19(8):774–787, 1993.

[189] P. G. Frankl, S. N. Weiss, and C. Hu. All-uses vs mutation testing: an experimentalcomparison of effectiveness. Journal of Systems and Software, 38(3):235–253, 1997.

[190] P. G. Frankl and E. J. Weyuker. A data flow testing tool. In Proceedings of the secondconference on Software development tools, techniques, and alternatives, pages 46–53,Los Alamitos, CA, USA, 1985. IEEE Computer Society Press.

[191] P. G. Frankl and E. J. Weyuker. An analytical comparison of the fault-detecting abilityof data flow testing techniques. In ICSE ’93: Proceedings of the 15th international con-ference on Software Engineering, pages 415–424, Los Alamitos, CA, USA, 1993. IEEEComputer Society Press.

[192] F. Del Frate, P. Garg, A. P. Mathur, and A. Pasquini. On the correlation between codecoverage and software reliability. In Proceedings of the Sixth International Symposiumon Software Reliability Engineering, pages 124–132. IEEE Press, October 1995.

[193] S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selectionbased on finite state models. IEEE Transactions on Software Engineering, 17(6):591–603, June 1991.

[194] E. Galiano and A. P. Mathur. Inducing vectorization: a formal analysis. In Proceedings ofthe Third International Conference on Supercomputing, pages 455–463, 1988.

[195] L. Gang, G. v. Bochmann, and A. Petrenko. Test selection based on communicatingnondeterministic finite-state machines using a generalized wp-method. IEEE Transactionon Software Engineering, 20(2):149 –162, February 1994.

[196] J. Gannon, P. McMullin, and R. Hamlet. Data abstraction, implementation, specification,and testing. ACM Transactions Program. Lang. System, 3(3):211–223, 1981.

[197] P. Garg. On code coverage and software reliability. Master’s thesis, Purdue University,1995. Advisor: A. P. Mathur.

[198] M.-C. Gaudel and B. Marre. Generation of test data from algebraic specifications. InProceedings of the Second Workshop on Software Testing, Verification, and Analysis,pages 138–139, July 1988.

[199] R. Geist, A. J. Offutt, and F. Harris. Estimation and enhancement of real-time softwarereliability through mutation analysis. IEEE Transactions on Computers, 41(5):550–558,May 1992.

[200] R. Van Ghent. Letter on real software, regarding the commentary by Dijkstra and thereply by DeMillo, Lipton and Perlis. SIGSOFT Softw. Eng. Notes, 3(3):20–21, 1978.



[201] S. Ghosh. Testing Component-based Distributed Systems. PhD thesis, Purdue Univer-sity, Department of Computer Science, West Lafayette, IN, USA, August 2000. Advisor:Aditya Mathur.

[202] S. Ghosh. Towards measurement of testability of concurrent object-oriented programsusing fault insertion: a preliminary investigation. In Proceedings. Second IEEE Interna-tional Workshop on Source Code Analysis and Manipulation, pages 17–25. IEEE Press,2002.

[203] S. Ghosh and A. P. Mathur. Issues in testing distributed component-based systems. InProceedings of the 1st ICSE Workshop on Testing Distributed Component-Based Sys-tems, May 1999.

[204] S. Ghosh and A. P. Mathur. Interface mutation to assess the adequacy of tests for comp-onents. In Proceedings of the 34th International Conference and Exhibition on Technol-ogy of Object-Oriented Languages and Systems (TOOLS USA 2000), July-August 2000.

[205] S. Ghosh and A. P. Mathur. Interface mutation. Journal of Testing, Verification andReliability, 11(4):227–247, December 2001.

[206] A. Gill. Finite-State Models for Logical Machines. John Wiley and Sons, Inc., New York,1968.

[207] S. Gill. The diagnosis of mistakes in programmes on the EDSAC. In Proceedings of theRoyal Society, volume A. 206, pages 538–554, 1951.

[208] M. R. Girgis and M. R. Woodward. An experimental comparison of the error exposingability of program testing criteria. In Proceedings of the Workshop on Software Testing,pages 64–73, July 1986.

[209] M. Gittens, H. Lutfiyya, M. Bauer, D. Godwin, Y. W. Kim, and P. Gupta. An empiricalevaluation of system and regression testing. In CASCON ’02: Proceedings of the 2002conference of the Centre for Advanced Studies on Collaborative research, page 3. IBMPress, 2002.

[210] R. L. Glass. Real-time: the “lost world” of software debugging and testing. Communica-tions of the ACM, 23(5):264–271, 1980.

[211] J. C. Godskesen. Models for embedded systems. In Proceedings of CHARME’99, LNCS1703, pages 197–214. Springer-Verlag, September 1999.

[212] G. Gonenc. A method for the design of fault detection experiments. IEEE Transactionson Computers, C-19:551–558, June 1970.

[213] J. B. Goodenough and S. L. Gerhart. Correction to “Toward a theory of test data selec-tion”. IEEE Transactions on Software Engineering, SE-1(4):425, December 1975.

[214] J. B. Goodenough and S. L. Gerhart. Toward a theory of test data selection. IEEETransactions on Software Engineering, SE-1(2):156–173, June 1975.



[215] J. B. Goodenough and S. L. Gerhart. Toward a theory of test data selection. In Proceed-ings of the international conference on Reliable software, pages 493–510, 1975.

[216] D. R. Goodman and R. G. Enk. Future real-time testing and evaluation computing en-vironments. In Proceedings of the Winter Simulation Conference, pages 237–242, De-cember 1990.

[217] S. Goren and F. J. Ferguson. Checking sequence generation for asynchronous sequentialelements. In Proceedings of the ITC International Test Conference, pages 406–413,1999.

[218] S. Goren and F. J. Ferguson. Testing Finite State Machines Based on a Structural Cov-erage Metric. In Proceedings of the ITC International Test Conference, pages 773–780,2002.

[219] T. L. Graves, M. J. Harrold, J. M. Kim, A. Porter, and G. Rothermel. An empirical studyof regression test selection techniques. ACM Transactions on Software EngineeringMethodology, 10(2):184–208, 2001.

[220] M. Grindal, B. Lindstrom, J. Offutt, and S. F. Andler. An evaluation of combination teststrategies for test case selection. Technical Report HS-IDA-TR-03001, Department ofComputer Science, University of Skovde, Sewden, October 2004.

[221] M. Grochtmann. Test case design using classification trees. In Proceedings of STAR’94,pages 1–11, Washington, D.C., May 1994.

[222] M. Grochtmann and K. Grimm. Classification trees for partitition testing. Software Test-ing, Verification, & Reliability, 3(2):63–82, June 1993.

[223] G.Rothermel and M. J. Harrold. A safe, efficient regression test selection technique. ACMTrans. Software Engineering Methodology, 6(2):173–210, 1997.

[224] P. Gruer, V. Hilaire, and A. Koukarn. Multi-agent approach to modeling and simulation ofurban transportation systems. In IEEE International Conference on Systems, Man, andCybernetics, volume 4, pages 2499–2504. IEEE Press, October 2001.

[225] R. Gupta. Generalized dominators and post-dominators. In POPL ’92: Proceedings ofthe 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages,pages 246–257, New York, NY, USA, 1992. ACM Press.

[226] R. Gupta, M. J. Harrold, and M. L. Soffa. An approach to regression testing using slic-ing. In Proceedings of the IEEE Conference on Software Maintenance, pages 299–308,November 1992.

[227] D. A. Gustafson and B.Prasad. Properties of software measures. In Proceedings ofthe BCS-FACS Workshop on Formal Aspects of Measurement, pages 179–193, London,UK, 1992. Springer-Verlag.

[228] W. J. Gutjahr. Partition testing vs. random testing: the influence of uncertainty. IEEETransactions on Software Engineering, 25(5):661–674, November 1999.



[229] N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous data flow program-ming language LUSTRE. Proceedings of IEEE, 79(9):1305–1320, September 1991.

[230] D. Hamlet and R. Taylor. Partition testing does not inspire confidence [program testing].IEEE Transactions on Software Engineering, 16(12):1402–1411, December 1990.

[231] R. G. Hamlet. Programs with finite sets of data. Computer Journal, 20:232–237, August1977.

[232] R. G. Hamlet. Testing programs with the aid of a compiler. IEEE Transactions on SoftwareEngineering, SE-3(4), July 1977.

[233] J. M. Hanks. Testing COBOL programs by mutation. Master’s thesis, Georgia Institute ofTechnology, Atlanta, Georgia, USA, 1980.

[234] P. Brinch Hansen. Testing a multiprogramming system. Software–Practice and Experi-ence, 3(2), 1973.

[235] D. Harel. A visual formalism for complex systems. Science of Programming, 8:231–274,1987.

[236] D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, and A. Shtul-Trauring. Statemate: a working environment for the development of complex reactivesystems. In Proceedings of the 10th international conference on Software engineering,pages 396–406. IEEE Computer Society Press, 1988.

[237] D. Harel and A. Naamad. Statemate Semantics of Statecharts. ACM Transactions onSoftware Engineering Methodology, 5(4):293–333, October 1996.

[238] E. R. Harold and W. S. Means. XML in a Nutshell. O’Reilly, third edition, 2004.

[239] M . J. Harrold, J. A. Jones, T. Li, and D. Liang. Regression test selection for Java software.In Proceedings of the ACM Conference on OO Programming, Systems, Languages, andApplications (OOPSLA ’01), 2001.

[240] M. J. Harrold, R. Gupta, and M. L. Soffa. A methodology for controlling the size of a testsuite. ACM Transactions on Software Engineering Methodology, 2(3):270–285, 1993.

[241] M. J. Harrold, J. A. Jones, T. Li, D. Liang, A. Orso, M. Pennings, S. Sinha, S. A. Spoon,and A. Gujarathi. Regression test selection for Java software. In OOPSLA ’01: Proceed-ings of the 16th ACM SIGPLAN conference on Object oriented programming, systems,languages, and applications, pages 312–326, New York, NY, USA, 2001. ACM Press.

[242] M. J. Harrold, B. Malloy, and G. Rothermel. Efficient construction of program dependencegraphs. In ISSTA ’93: Proceedings of the 1993 ACM SIGSOFT international symposiumon Software testing and analysis, pages 160–170, New York, NY, USA, 1993. ACM Press.

[243] M. J. Harrold and G. Rothermel. Performing data flow testing on classes. In Proceedingsof the SIGSOFT’94 Symposium on Foundations of Software Engineering, New Orleans,pages 154–163. ACM Press, 1994.



[244] M. J. Harrold, G. Rothermel, R. Wu, and L. Yi. An empirical investigation of programspectra. In PASTE ’98: Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop onProgram analysis for software tools and engineering, pages 83–90, New York, NY, USA,1998. ACM Press.

[245] M. J. Harrold and M. Soffa. Interprocedual data flow testing. In TAV3: Proceedings ofthe ACM SIGSOFT ’89 third symposium on Software testing, analysis, and verification,pages 158–167, New York, NY, USA, 1989. ACM Press.

[246] A. Hartman. Software and hardware testing using combinatorial covering suites. InHaifa Workshop on Interdisciplinary Applications and Graph Theory, Combinatorics andAlgorithms, June 2002.

[247] J. Hartmann and D. Robson. Retest—development of a selective revalidation prototypeenvironment for use in software maintenance. In Proceedings of the 23rd Hawaii Inter-national Conference on System Sciences, pages 92–101, 1990.

[248] J. Hartmann and D. J. Robson. Techniques for Selective Revalidation. IEEE Software,7(1):31–36, January 1990.

[249] L. Hatton. Re-examining the fault density - component size connection. IEEE Software,14(2):89–97, March 1997.

[250] L. Hatton. The T experiments: Errors in scientific software. IEEE Computational Scienceand Engineering, 4(2):27–38, April–June 1997.

[251] L. Hatton and A. Roberts. How accurate is scientific software ? IEEE Transactions onSoftware Engineering, 20(10):785–797, October 1994.

[252] K. Havelund, A. Skou, K. G. Larsen, and K. Lund. Formal modeling and analysis of anaudio/video protocol: an industrial case study using UPPAAL. In Proceedings of 18thIEEE Real-Time Systems Symposium, pages 2–13, December 1997.

[253] Ian Hayes and Bill Flinn, editors. Specification Case Studies. Prentice Hall, 1993.

[254] K. J. Hayhurst and C. M. Holloway. Aviation software guidelines. IEEE Software,19(5):107, September/October 2002.

[255] K. J. Hayhurst, D. S. Veerhusen, J. J. Chilenski, and L. K. Rierson. “A practical tutorialon modified condition/decision coverage ”. Technical Report NASA/TM-2001-210876,NASA, NASA Center for Aerospace Information (CASI), 7121 Standard Drive, Hanover,MD 21076-1320, May 2001 2001.

[256] A. S. Hedayat, N. J. A. Sloane, and J. Stufken. Orthogonal Arrays. Springer, New York,USA, 1999.

[257] D. Hedley, M. A. Hennell, and M. R. Woodward. On the generation of test data for pro-gram validation. In M. A. Hennel and L. M. Delves, editors, Production and Assessmentof Numerical Software, pages 128–135. Academic Press, November 1980.



[258] M. P. E. Heimdahl and N. G. Leveson. Completeness and consistency in hierarchicalstate-based requirements. IEEE Transactions on Software Engineering, 22(6):363 – 377,June 1996.

[259] S. Helke, T. Neustupny, and T. Santen. Automating test case generation from Z specifi-cations with Isabelle. In Proceedings of the 10th International Conference of Z Users onThe Z Formal Specification Notation, volume 1212, pages 52–71. Springer-Verlag, 1997.

[260] E. Heller. Using design of experiments structures to generate software tests. In Proceed-ings of the 12th international conference on Testing Computer Software, pages 33–41,1995.

[261] M. A. Hennell, D. Hedley, and M. R. Woodward. Experience with an ALGOL 68 numericalalgorithms testbed. In J. Fox, editor, Computer Software Engineering, pages 457–463.Polytechnic Press, New York, USA, 1976.

[262] F. C. Hennie. Introduction to the Theory of Finite State Machines. Mc-Graw Hill BookCompany Inc., New York, 1962.

[263] A. Hessel and P. Pettersson. A test case generation algorithm for real-time systems. InProceedings of QSIC 2004. Fourth International Conference on Quality Software, pages268–273. IEEE Press, September 2004.

[264] W. C. Hetzel. Program test methods. Prentice Hall, Englewood Cliffs, NJ, USA, 1973.

[265] R. M. Hierons. Using formal specifications to enhance the software testing process. PhDthesis, Brunel University, 1993.

[266] R. M. Hierons. Testing from a Z specification. Journal of Software Testing, Verification,and Reliability, 7:19–33, 1997.

[267] R. M. Hierons. Checking states and transitions of a set of communicating finite statemachines. Microprocessors and Microsystems, Special Issue on Testing and testingtechniques for real-time embedded software systems, 24(9):443–452, 2001.

[268] R. M. Hierons, M. Harman, and S. Danicic. Using program slicing to assist in the detec-tion of equivalent mutants. Software Testing, Verification and Reliability, 9(4):233–262,1999.

[269] R. M. Hierons, S. Sadeghipour, and H. Singh. Testing a system specified using State-charts and Z. Information and Software Technology, 43(2):137–149, 2001.

[270] R. M. Hierons and H. Ural. Reduced length checking sequences. IEEE Transaction onComputers, 51(9):1111 –1117, September 2002.

[271] W. D. Hillis. The connection machine. MIT Press, Cambridge, MA, USA, 1986.

[272] C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

[273] G.J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley Professional, 2003.



[274] J.E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Com-putation. Addison-Wesley, November 2000.

[275] J. R. Horgan and S. London. Data-flow coverage and the C language. In Proceedingsof the Fourth Symposium on Software Testing, Analysis, and Verification, pages 87–97,October 1991.

[276] J. R. Horgan and S. London. ATAC: A data flow coverage testing tool for C. In Proceed-ings of Symposium on Assessment of Quality Software Development Tools, pages 2–10,May 1992.

[277] J. R. Horgan and A. P. Mathur. Weak mutation is probably strong mutation. Technical Re-port SERC-TR-83-P, Purdue University, West Lafayette, IN, USA, Software EngineeringResearch Center, 1990.

[278] S. Horwitz. Identifying the semantic and textual differences between two versions ofa program. Technical Report 895, Department of Computer Sciences, University ofWisconsin—Madison, November 1989.

[279] S. Horwitz. Identifying the semantic and textual differences between two versions of aprogram. In PLDI ’90: Proceedings of the ACM SIGPLAN 1990 conference on Program-ming language design and implementation, pages 234–245, New York, NY, USA, 1990.ACM Press.

[280] S. Horwitz, J. Prins, and T. Reps. On the adequacy of program dependence graphs forrepresenting programs. In POPL ’88: Proceedings of the 15th ACM SIGPLAN-SIGACTsymposium on Principles of programming languages, pages 146–157, New York, NY,USA, 1988. ACM Press.

[281] S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs.SIGPLAN Notices, 39(4):229–243, 1988.

[282] S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs.ACM Trans. Program. Lang. Syst., 12(1):26–60, 1990.

[283] W. E. Howden. Methodology for the generation of program test data. IEEE Transactionson Computers, C-24(5):554–559, May 1975.

[284] W. E. Howden. Applicability of software validation techniques to scientific programs. ACMTrans. Program. Lang. Syst., 2(3):307–320, 1980.

[285] W. E. Howden. Completeness criteria for testing elementary program functions. In ICSE’81: Proceedings of the 5th international conference on Software engineering, pages235–243. IEEE Press, 1981.

[286] W. E. Howden. A survey of dynamic analysis methods. In E. F. Miller and W. E. Howden,editors, Tutorial: Program Testing and Validation Techniques. IEEE Computer SocietyPress, Washington D.C., USA, 1981.



[287] W. E. Howden. Validation of scientific programs. ACM Computing Surveys, 14(2):193–227, 1982.

[288] W. E. Howden. Weak mutation testing and completeness of test sets. IEEE Transactionson Software Engineering, 8(4):371–379, 1982.

[289] W. E. Howden. Program testing versus proofs of correctness. Software Testing, Verifica-tion, and Reliability, 1(1):5–15, 1991.

[290] J. C. Huang. An Approach to Program Testing. ACM Computing Surveys, 7:113–128,September 1975.

[291] J. Huller. Reducing time to market with combinatorial design method testing. In Proceed-ings of the 2000 International Council on Systems Engineering (INCOSE) Conference,Englewood, CO, March 2000.

[292] IEEE, IEEE Service Center, 445 Hoes Lane, Piscataway, NJ 08854. ANSI/IEEE Std1008-1987, IEEE Standard for Software Unit Testing.

[293] IEEE, IEEE Service Center, 445 Hoes Lane, Piscataway, NJ 08854. ANSI/IEEE Std729-1983 Glossary of Software Engineering Terminology.

[294] IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glos-saries. New York, NY, 1990.

[295] D. Jackson. Alloy: a lightweight object modelling notation. ACM Transactions SoftwareEngineering Methodology, 11(2):256–290, 2002.

[296] D. Jackson, I. Schechter, and H. Shlyahter. Alcoa: the Alloy constraint analyzer. In ICSE’00: Proceedings of the 22nd international conference on Software engineering, pages730–733, New York, NY, USA, 2000. ACM Press.

[297] D. Jackson and M. R. Woodward. Parallel firm mutation of Java programs. In Proceedingsof Mutation 2000, pages 77–83, October 2000.

[298] J. Jacky. The way of Z. Cambridge University Press, 1997.

[299] F. Jahanian and A. K. Mok. Modechart: a specification language for real-time systems.IEEE Transactions on Software Engineering, 20(12):933–947, December 1994.

[300] P. Jalote. Testing the completeness of specifications. IEEE Transactions on SoftwareEngineering, 15(5):526–531, May 1988.

[301] J. Voas Jeffrey and K. Miller. Improving the software development process using testa-bility research. Technical report, NASA Langley Technical Report Server, 1992.

[302] B. Jeng and E. J. Weyuker. Some observations on partition testing. In Proceedings ofthe ACM SIGSOFT ’89 third symposium on Software testing, analysis, and verification,pages 38–47. ACM Press, 1989.



[303] D. S. Johnson. Approximation algorithms for combinatorial problems. In STOC ’73:Proceedings of the fifth annual ACM symposium on Theory of computing, pages 38–49,New York, NY, USA, 1973. ACM Press.

[304] N. Juristo, A. M. Moreno, and S. Vegas. Reviewing 25 years of testing technique experi-ments. Empirical Softw. Engg., 9(1-2):7–44, 2004.

[305] S. H. Kan, J. Parrish, and D. Manlove. In-process metrics for software testing. IBMSystems Journal, 40(1):220–241, 2001.

[306] K. Kapoor and J. Bowen. Experimental evaluation of the variation in effectiveness forDC, FPC and MC/DC test criteria. In Proceedings of 2003 International Symposium onEmpirical Software Engineering, pages 185–194, October 2003.

[307] K. Karoui, A. Ghedamsi, and R. Dssouli. A study of some influencing factors in testabilityand diagnostics based on FSMs. Technical report, Dept. IRO, Universite de Montreal,1997. TR P#1048.

[308] R. M. Karp. A note on the application of graph theory to digital computer programming.Information and Control, 3(2):179–190, 1960.

[309] M. Katrowitz and L. M. Noack. I’m done simulating; now what? verification coverageanalysis and correctness checking of the DEC chip 21164 Alpha microprocessor. In DAC’96: Proceedings of the 33rd annual conference on Design automation, pages 325–330,New York, NY, USA, 1996. ACM Press.

[310] D. K. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. Timed I/O automata: a mathemat-ical framework for modeling and analyzing real-time systems. In Proceedings of the 24thIEEE Real-Time Systems Symposium, pages 166–177. IEEE Press, December 2003.

[311] V. Khandelwal. On program auralization. Master’s thesis, Purdue University, Departmentof Computer Science, West Lafayette, N, USA, August 1995. Advisor: Aditya Mathur.

[312] A. Khoumsi. Test cases generation for embedded systems. In Maghrebian Conf. on Soft.Engin. and Art. Intel. (MCSEAI), pages 1–12, 2004.

[313] H. Kilov. Letter on Parnas’ view of Dijkstra vs. DeMillo, Lipton and Perlis. SIGSOFTSoftware Engineering Notes, 4(1):19–19, 1979.

[314] J. Kim and A. Porter. A history-based test prioritization technique for regression testing inresource constrained environments. In ICSE ’02: Proceedings of the 24th InternationalConference on Software Engineering, pages 119–129, New York, NY, USA, 2002. ACMPress.

[315] J-M. Kim, A. Porter, and G. Rothermel. An empirical study of regression test applicationfrequency. In ICSE ’00: Proceedings of the 22nd international conference on Softwareengineering, pages 126–135, New York, NY, USA, 2000. ACM Press.



[316] T. H. Kim, I. S. Hwang, M. S. Jang, S. W. Kang, J. Y. Lee, and S. B Lee. Test casegeneration of a protocol by a fault coverage analysis. In Proceedings Twelfth InternationalConference on Information Networking, (ICOIN-12), pages 690– –695, January 1998.

[317] Y. G. Kim, H. S. Hong, D. H. Bae, and S. D. Cha. Test cases generation from UML statediagrams. In IEE Proceedings, pages 187–192, August 1999.

[318] Y. W. Kim. Efficient use of code coverage in large-scale software development. In CAS-CON ’03: Proceedings of the 2003 conference of the Centre for Advanced Studies onCollaborative research, pages 145–155. IBM Press, 2003.

[319] D. E. Knuth. The errors of TEX. Software Practice and Experience, 19(7):607–685, 1989.

[320] D. E. Knuth and F. R. Stevenson. Optimal measurement points for program frequencycounts. BIT, 13:313–322, 1973.

[321] Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill, second edition, 1978.

[322] B. Korel. The program dependence graph in static program testing. Information Process-ing Letters, 24(2):103–108, 1987.

[323] B. Korel and J. W. Laski. Data flow oriented program testing strategy. Technical ReportTech. Rep. C/SJW11, Oakland University, School of Engineering, 1980.

[324] B. Korel and J. W. Laski. Dynamic program slicing. Information Processing Letters,29(3):155–163, 1988.

[325] N. Kosmatov, B. Legeard, F. Peureux, and M. Utting. Boundary coverage criteria for testgeneration from formal models. In Proceedings of the 15th International Symposium onSoftware Reliability Engineering (ISSRE 2004), pages 139–150. IEEE Press, 2004.

[326] I. Koufareva, A. Petrenko, and N. Yevtushenko. Test generation driven by user-definedfault models. In Proceedings of the Twelfth International Workshop on Testing of Com-municating Systems, Hungary, pages 215–233, 1999.

[327] E. W. Krauser. Compiler-integrated software testing. PhD thesis, Purdue University, WestLafayette, IN, 1991. Co-Advisor: Aditya Mathur.

[328] E. W. Krauser and A. P. Mathur. Program testing on a massively parallel transputer basedsystem. In Proceedings of the ISMM International Symposium on Mini and Microcom-puters and their Applications, pages 67–71, Austin, Texas, USA, November 1986.

[329] E. W. Krauser, A. P. Mathur, and V. J. Rego. High performance software testing on SIMDmachines. IEEE Transactions on Software Engineering, 17(5):403–423, May 1991.

[330] David L. Kuck. Structure of Computers and Computations. John Wiley & Sons, Inc., NewYork, NY, USA, 1978.

[331] D. R. Kuhn and M. J. Reilly. An investigation of the applicability of design of experimentsto software testing. In SEW ’02: Proceedings of the 27th Annual NASA Goddard SoftwareEngineering Workshop (SEW-27’02), page 91. IEEE Computer Society, 2002.



[332] D. R. Kuhn, D. R. Wallace, and Jr. Al J. Gallo. Software fault interactions and implicationsfor software testing. IEEE Transactions on Software Engineering, 30(6):418–421, June2004.

[333] X. Wen L-T. Wang, C-W. Wu. VLSI Test Principles and Architectures: Design for Testa-bility. Morgan Kaufmann, 2006.

[334] K. G. Larsen, P. Pettersson, and Y. Wang. UPPAAL in a nutshell. International Journal ofSoftware Tools for Technology Transfer, 1(1–2):134–152, 1997.

[335] K. G. Larsen and Y. Wang. Time-abstracted bisimulation: Implicit specifications anddecidability. Information and Computation, 134(2):75–101, May 1997.

[336] J. R. Larus. Abstract execution: a technique for efficiently tracing programs. SoftwarePractice and Experience, 20(12):1241–1258, 1990.

[337] J. W. Laski. On data flow guided program testing. SIGPLAN Notices, 17(9):62–71, 1982.

[338] J. W. Laski. Data flow testing in STAD. Journal of Systems and Software, 12(1):3–14,1990.

[339] J. W. Laski and B. Korel. A data flow oriented program testing strategy. IEEE Transactionson Software Engineering, SE-9(3):347–354, May 1983.

[340] J. W. Laski, W. Szermer, and P. Luczycki. Dynamic mutation testing in integrated regres-sion analysis. In ICSE ’93: Proceedings of the 15th international conference on SoftwareEngineering, pages 108–117, Los Alamitos, CA, USA, 1993. IEEE Computer SocietyPress.

[341] G. T. Leavens, A. L. Baker, and C. Ruby. JML: A notation for detailed design. KluwerAcademic Publishers, 1999.

[342] G. T. Leavens and Y. Cheon. Design by contract with JML. http://citeseer.ist.psu.edu/leavens03design.html, 2003.

[343] D. Lee, K. K. Sabnani, D. M. Kristol, and S. Paul. Conformance testing of protocolsspecified as communicating finite state machines-a guided random walk based approach.IEEE Transaction on Communications, 44(5):631 –640, May 1996.

[344] D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - Asurvey. In Proceedings of the IEEE, volume 84, pages 1090–1126, 1996.

[345] I. Lee, P. Bremond-Gregoire, and R. Gerber. A process algebraic approach to the spec-ification and analysis of resource-bound real-time systems. Proceedings of the IEEE,82(1):158–171, 1994.

[346] S. C. Lee and J. Offutt. Generating test cases for XML-based Web component interac-tions using mutation analysis. In Proceedings of the 12th International Symposium onSoftware Reliability Engineering (ISSRE’01), pages 200–209, Hong Kong, PRC, 2001.



[347] B. Legeard and F. Peureux. Generation of functional test sequences from b formal spec-ifications: presentation and industrial case-study. In Proceedings of the 16th AnnualInternational Conference on Automated Software Engineering (ASE 2001), pages 377–381. IEEE Press, November 2001.

[348] B. Legeard, F. Peureux, and M. Utting. Automated boundary testing from Z and B. InFME ’02: Proceedings of the International Symposium of Formal Methods Europe onFormal Methods - Getting IT Right, pages 21–40, London, UK, 2002. Springer-Verlag.

[349] B. Legeard, F. Peureux, and M. Utting. A comparison of the BTT and TTF test-generationmethods. In ZB ’02: Proceedings of the 2nd International Conference of B and Z Userson Formal Specification and Development in Z and B, pages 309–329, London, UK,2002. Springer-Verlag.

[350] B. Legeard, F. Peureux, and M. Utting. Controlling test case explosion in test generationfrom B formal models. Journal of Software Testing, Verification, and Reliability, 14:81–104, 2004.

[351] Y. Lei and K. C. Tai. In-parameter-order: A test generation strategy for pairwise test-ing. In HASE ’98: The 3rd IEEE International Symposium on High-Assurance SystemsEngineering, pages 254–261, Washington, DC, USA, 1998. IEEE Computer Society.

[352] T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACMTrans. Program. Lang. Syst., 1(1):121–141, 1979.

[353] H. K. N. Leung and L. White. Insights into regression testing. In Proceedings of theConference on Software Maintenance, pages 60–69, 1989.

[354] N. Leveson and A. Dupuy. An empirical evaluation of the MC/DC coverage criterion onthe hete-2 satellite software. In Proceedings of the Digital Aviation Systems Conference(DASC), Philadelphia, October 2000.

[355] N. G. Leveson, M. P. E. Heimdahl, H. Hildreth, and J. D. Reese. Requirements spec-ification for process-control systems. IEEE Transactions on Software Engineering,20(9):684–707, September 1994.

[356] J. B. Li and J. Miller. Testing the semantics of W3C XML schema. In Proceedings ofthe Twenty-Ninth Annual International Computer Software and Applications Conference,pages 443–448, Edinburgh, Scotland, July 2005. IEEE Press.

[357] W. Li. Software product metrics. IEEE Potentials, 18(5):24–27, December 1999.

[358] W. Li and S. Henry. Object-oriented metrics which predict maintainability. Journal ofSystems and Software, 2:111–122, 1993.

[359] R. J. Lipton and F. G. Sayward. The status of research on program mutation. In Digestfor the workshop on software testing and test documentation, pages 355–378, 1978.

[360] C. R. Litecky and G. B. Davis. A study of errors, error-proneness, and error diagnosis inCobol. Communications of the ACM, 19(1):33–37, 1976.



[361] C.-H. Liu. Data flow analysis and testing of Java server pages. In Proceedings of 28th An-nual International Computer Software and Applications Conference (COMPSAC 2004),volume 2, pages 114–119, 2004.

[362] C. H. Liu, D. C. Kung, and P. Hsia. Object-based data flow testing of web applications. InProceedings of First Asia-Pacific Conference on Quality Software, pages 7–16, October2000.

[363] S. Liu, A. J. Offutt, C. Ho-Stuart, Y. Sun, and M. Ohba. Sofl: a formal engineeringmethodology for industrial applications. IEEE Transactions on Software Engineering,24(1):24–45, January 1998.

[364] L. Liuying and Q. Zhichang. Test selection from UML statecharts. In ProceedingsTechnology of Object-Oriented Languages and Systems, TOOLS 31, pages 273 –279,September 1999.

[365] G. Luo, A. Das, and G. v. Bochmann. Software testing based on SDL specifications withSave. IEEE Transaction on Software Engineering, 20(1):72–87, 1994.

[366] Y. S. Ma and Y. R. Kwon. A study on method and tool of mutation analysis for object-oriented programs. Software Engineering Review, 15(3):41–52, September 2002.

[367] Y-S. Ma, Y-R. Kwon, and J. Offutt. Inter-class mutation operators for Java. In Proceedingsof the 13th International Symposium on Software Reliability Engineering, pages 352–363, November 2002.

[368] Y-S. Ma, J. Offutt, and Y-R. Kwon. MuJava: an automated class mutation system. Soft-ware Testing, Verification, and Reliability, 15(2):97–133, 2005.

[369] S. Maheshwari. Traversal marker placement problems are np-complete. Technical ReportRep. CU-CS-092-76, Univ of Colorado, Boulder, Colorado, Dept. of Computer Science,1976.

[370] S. Maity, A. Nayak, M. Zaman, N. Bansal, and A. Srivastava. An improved test generationalgorithm for pair-wise testing. In Proceedings of the 14th International Symposium onSoftware Reliability Engineering, Fast Abstracts, pages 1–2, 2003.

[371] J. C. Maldonado, M. L. Chaim, and M. Jino. Bridging the gap in the presence of infeasiblepaths: potential uses testing criteria. In In Proceedings of the Fifth International Confer-ence on Software Engineering and its Applications, pages 613–623, Toulouse, France,1992.

[372] J. C. Maldonado, A. P. Mathur, and W. E. Wong. Constrained mutation in C programs.In Proceedings of VIII Simposio Brasileiro De Enginharia De Software, pages 439–452,Curitiba, Brazil, October 1994.

[373] R. Mandl. Orthogonal Latin Squares. Communications of the ACM, pages 1054–1058,October 1985.



[374] B. Marick. The weak mutation hypothesis. In TAV4: Proceedings of the symposiumon Testing, analysis, and verification, pages 190–199, New York, NY, USA, 1991. ACMPress.

[375] B. Marick. How to misuse code coverage, 1999. Reliable Software Technologies.

[376] V. Massol and T. Husted. JUnit in Action. Manning Publications Co., Greenwich, CT,USA, 2003.

[377] A. P. Mathur. On the relative strengths of data flow and mutation testing. In Proceedingsof the Ninth Annual Pacific Software Quality Conference, pages 165–181, 1991.

[378] A. P. Mathur. Performance, effectiveness, and reliability issues in software testing. InProceedings of COMPSAC’91, pages 604–605, 1991.

[379] A. P. Mathur. CS 406 Software Engineering I: Course Project Handout, August 1992.Available from A. P. Mathur at [email protected].

[380] A. P. Mathur. Mutation testing. In J. J. Marciniak, editor, Encyclopedia of Software Engi-neering, pages 707–713. John Wiley & Sons Inc., December 1994.

[381] A. P. Mathur, S. Ghosh, P. Govindarajan, and B. Sridharan. A framework for assessingtest adequacy, architecture extraction, metering, monitoring and controlling distributedcomponent-based systems. In Proceedings of the 1st Symposium on Reusable Architec-ture and Components for Developing Distributed Information Systems, pages 657–660,July 1999.

[382] A. P. Mathur and E. W. Krauser. Modeling mutation on a vector processor. In Proceedingsof the International Conference on Software Engineering, pages 154–161, Singapore,April 1988.

[383] A. P. Mathur and V. J. Rego. Exploiting parallelism across program execution: a unifica-tion technique and its analysis. IEEE Transactions on Parallel and Distributed Systems,1(4):399–414, 1990.

[384] A. P. Mathur and W. E. Wong. Evaluation of the cost of alternate mutation strategies.In Proceedings of the Seventh Brazilian Symposium on Software Engineering, pages320–335, October 1993.

[385] A. P. Mathur and W. E. Wong. An empirical comparison of data flow and mutation-basedtest adequacy criteria. Software Testing, Verification, and Reliability, 4(1):9–31, March1994.

[386] A. P. Mathur and W. E. Wong. A theoretical comparison between mutation and dataflow based test adequacy criteria. In CSC ’94: Proceedings of the 22nd annual ACMcomputer science conference on Scaling up : meeting the challenge of complexity inreal-world computing applications, pages 38–45, New York, NY, USA, 1994. ACM Press.

[387] A. P. Mathur and W. E. Wong. Fault detection effectiveness of mutation and data flowtesting. Software Quality Journal, 4:69–83, 1995.



[388] MathWorks. Using Simulink-Model-Based and System Based Design. The MathWorks,Inc., 2002.

[389] T. J. McCabe. A complexity measure. IEEE Transactions on Software Engineering, SE-2(4):308–320, 1976.

[390] J. A. McCall, P. K. Richards, and G. F. Walters. Factors in software quality. Techni-cal Report AD/A-049-014/015/055, Rome Air Development Center, Hanscom AFB, MA,National Technical Information Service, Springfield, VA, USA, 1977.

[391] J. McDonald, P. Strooper, and D. Hoffman. Tool support for generating passive C++ testoracles from Object-Z specifications. In Proceedings of the Tenth Asia-pacific SoftwareEngineering Conference, pages 322–331, 2003.

[392] K. L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.

[393] A. Memon and X. Qing. Using transient/persistent errors to develop automated testoracles for event-driven software. In Proceedings of the 19th International Conferenceon Automated Software Engineering, pages 184–195, 2004.

[394] M. Mikucionis, K. G. Larsen, and B. Nielsen. T-UPPAAL: Online model-based testing ofreal-time systems. In Proceedings of the 19th International Conference on AutomatedSoftware Engineering (ASE’04), pages 396–397. IEEE Press, September 2004.

[395] E. Miller. Advances in automating software testing. In Proceedings of Software Engi-neering in 1990’s Congress, February 1998.

[396] E. F. Miller and W. E. Howden. Software Testing and Validation Techniques. IEEE Com-puter Society, Long Beach, CA, USA, 1978.

[397] J. C. Miller and C. J. Maloney. Systematic mistake analysis of digital computer programs.Communications of the ACM, pages 58–63, February 1963.

[398] R. E. Miller and S. Paul. On the generation of minimal-length conformance tests forcommunication protocols. IEEE Transactions on Software Engineering, 15(4):413–426,April 1989.

[399] T. Miller and P. Strooper. A framework and tool support for the systematic testing ofmodel-based specifications. ACM Transactions on Software Engineering Methodology,12(4):409–439, 2003.

[400] W. Miller and E. W. Myers. A file comparison program. Software- Practice and Experi-ence, 15(II):1025–1040, 1985.

[401] I. Moore. Jester- a JUnit test tester. In Proceedings of the Second International Confer-ence on Extreme Programming and Flexible Processes in Software Engineering, pages84–87, 2001.



[402] A. Moreira, J. Araujo, and I. Brito. Crosscutting quality attributes for requirements en-gineering. In SEKE ’02: Proceedings of the 14th international conference on Softwareengineering and knowledge engineering, pages 167–174, New York, NY, USA, 2002.ACM Press.

[403] E. S. Mresa and L. Bottaci. Efficiency of mutation operators and selective mutation strate-gies: an empirical study. Software Testing, Verification, and Reliability, 9(4):202–232,December 1999.

[404] T. Murnane. The application of mutation techniques to specification testing. Master’sthesis, Department of Computer Science, La Trobe University, Australia, 1999.

[405] T. Murnane and K. Reed. On the effectiveness of mutation analysis as a black box testingtechnique. In Proceedings Australian Software Engineering Conference, pages 12–20,2001.

[406] G. J. Myers. Software Reliability: Principles and Practices. John Wiley, 1976.

[407] G. J. Myers. A controlled experiment in program testing and code walk-throughs/inspections. Communications of the ACM, 21(9):760–768, 1978.

[408] G. J. Myers. The Art of Software Testing. John Wiley & Sons, New York, 1979.

[409] G. J. Myers. The Art of Software Testing. John Wiley & Sons, New Jersey, 2004.

[410] N. Nagappan, L. Williams, M. Vouk, and J. Osborne. Early estimation of software qualityusing in-process testing metrics: a controlled case study. In 3-WoSQ: Proceedings of thethird workshop on Software quality, pages 1–7, New York, NY, USA, 2005. ACM Press.

[411] K. Naik. Efficient computation of unique input/output sequences in finite-state machines.IEEE Transaction on Networking, 5(4):585–599, August 1997.

[412] V. N. Nair, D. A. James, W. K. Ehrlich, and J. Zevallos. A statistical assessment of somesoftware testing strategies and application of experimental design techniques. StatisticaSinica, 8:165–184, 1998.

[413] S. Naito and M. Tsunoyama. Fault detection for sequential machines by transition tours.In Proceedings of IEE Fault Tolerant Computing Systems, pages 238–243. IEEE Com-puter Society Press, 1981.

[414] G. Natwick. CMMI R© technology conference and user group, 2001.

[415] P. Naur. The design of the Gier ALGOL compiler. BIT, 3:124–140,145–166, 1963.

[416] P. Naur. Programming by action clusters. BIT, 9(3):250–258, 1969.

[417] P. Netisopakul, L. J. White, and J. Morris. Data coverage testing. In 9th Asia-PacificSoftware Engineering Conference (APSEC), pages 465–. IEEE Computer Society, De-cember 2002.



[418] B. Nielsen. Specification and test of real-time systems. PhD thesis, Department ofComputer Science, Aalborg University, Denmark, April 2000.

[419] B. Nielsen and A. Skou. Automated test generation from timed automata. InternationalJournal on Software Tools for Technology Transfer (STTT), 5(1):59–77, 2003.

[420] B. Nikolik. Test suite oscillations. Information Procesing Letters, 98:47–55, 2006.

[421] S. C. Ntafos. On testing with required elements. In Proceedings of COMPSAC’81, pages142–149, 1981.

[422] S. C. Ntafos. On required element testing. IEEE Transactions on Software Engineering,SE-10(6):795–803, 1984.

[423] S. C. Ntafos. A comparison of some structural testing strategies. IEEE Transactions onSoftware Engineering, 14(6), June 1988.

[424] S. C. Ntafos. On comparisons of random, partition, and proportional partition testing.IEEE Transactions on Software Engineering, 27(10):949–960, October 2001.

[425] K. A. Ockunzzi and C. A. Papachristou. Testability enhancement for control-flow intensivebehaviors. Journal of Electronic Testing, 13(3):239–257, 1998.

[426] A. J. Offutt. Automatic test data generation. PhD thesis, Georgia Institute of Technology,1988.

[427] A. J. Offutt. The coupling effect: fact or fiction. In TAV3: Proceedings of the ACMSIGSOFT ’89 third symposium on Software testing, analysis, and verification, pages131–140, New York, NY, USA, 1989. ACM Press.

[428] A. J. Offutt. Investigations of the software testing coupling effect. ACM TransactionsSoftware Engineering Methodology, 1(1):5–20, 1992.

[429] A. J. Offutt. Practical mutation testing. In Proceedings of the Twelfth International Con-ference on Testing Computer Software, pages 99–109, June 1995.

[430] A. J. Offutt and A. Irvine. Testing object-oriented software using the category-partitionmethod. In Proceedings of the Seventeenth International Conference on Technology ofObject-Oriented Languages and Systems (TOOLS USA ’95), pages 293–304, 1995.

[431] A. J. Offutt, A. Lee, G. Rothermel, R. H. Untch, and C. Zapf. An experimental determina-tion of sufficient mutant operators. ACM Transactions on Software Engineering Method-ology, 5(2):99–118, 1996.

[432] A. J. Offutt and S. D. Lee. How strong is weak mutation? In TAV4: Proceedings of thesymposium on Testing, analysis, and verification, pages 200–213, New York, NY, USA,1991. ACM Press.

[433] A. J. Offutt and S. D. Lee. An empirical evaluation of weak mutation. IEEE Transactionson Software Engineering, 20(5):337–344, 1994.



[434] A. J. Offutt and S. Liu. Generating test data from SOFL specifications. Technical ReportISSE-TR-97-02, George Mason University, Fairfax, Virginia, 1997.

[435] A. J. Offutt and J. Pan. Automatically detecting equivalent mutants and infeasible paths.Software Testing, Verification, and Reliability, 7(3):165–192, September 1997.

[436] A. J. Offutt, J. Pan, K. Tewary, and T. Zhang. An experimental evaluation of data flow andmutation testing. Software Practice and Experience, 26(2):165–176, 1996.

[437] A. J. Offutt, R. P. Pargas, S. V. Fichter, and P. K. Khambekar. Mutation testing of soft-ware using a MIMD computer. In Proceedings of International Conference on ParallelProcessing, pages 257–266, August 1992.

[438] A. J. Offutt, G. Rothermel, and C. Zapf. An experimental evaluation of selective mutation.In Proceedings of the Fifteenth International Conference on Software Engineering, pages100–107, May 1993.

[439] A. J. Offutt and W. Xu. Generating test cases for web services using data perturbation.In Proceedings of Workshop on Testing, Analysis and Verification of Web Services, July2004.

[440] J. Offutt, R. T. Alexander, Y. Wu, Q. Xiao, and C. Hutchinson. A fault model for subtypeinheritance and polymorphism. In 12th International Symposium on Software ReliabilityEngineering, 2001. ISSRE 2001, pages 84–93. IEEE Press, November 2001.

[441] J. Offutt, Y-S. Ma, and Y-R. Kwon. An experimental mutation system for Java. SIGSOFTSoftware Engineering Notes, 29(5):1–4, 2004.

[442] V. Okun. Specification mutation for test generation and analysis. PhD thesis, Universityof Maryland, Baltimore County, 2004.

[443] V. Okun, P. E. Black, and Y. Yesha. Testing with model checker: Insuring fault visibility.WSEAS Transactions on Systems, 2(1):77–82, January 2003.

[444] A. Olivero, J. Sifakis, and S. Yovine. Using abstractions for the verification of linear hy-brid systems. In Proceedings of the 7th International Conference on Computer AidedVerification, Lecture Notes in Computer Science, 818. Springer Verlag, 1994.

[445] A. Orso and A. Porter. ICSE workshop on remote analysis and measurement of softwaresystems (ramss). In ICSE ’03: Proceedings of the 25th International Conference onSoftware Engineering, pages 791–792, Washington, DC, USA, 2003. IEEE ComputerSociety.

[446] A. Orso, N. Shi, and M. J. Harrold. Scaling regression testing to large software systems.In SIGSOFT ’04/FSE-12: Proceedings of the 12th ACM SIGSOFT twelfth internationalsymposium on Foundations of software engineering, pages 241–251, New York, NY,USA, 2004. ACM Press.

[447] T. J. Ostrand. Data-flow testing with pointers and function calls. In Proceedings of thePacific Northwest Software Quality Conference, pages 218–227, October 1990.



[448] T. J. Ostrand and M. J. Balcer. The category-partition method for specifying and gener-ating fuctional tests. Communications of the ACM, 31(6):676–686, 1988.

[449] T. J. Ostrand and E. J. Weyuker. Using dataflow analysis for regression testing. InProceedings of the 6th Annual Pacific Northwest Software Quality Conference, pages233–247, September 1988.

[450] T. J. Ostrand and E. J. Weyuker. Data flow-based test adequacy analysis for languageswith pointers. In TAV4: Proceedings of the symposium on Testing, analysis, and verifica-tion, pages 74–86, New York, NY, USA, 1991. ACM Press.

[451] S. Padmanabhan. Domain testing: Divide and conquer. Master’s thesis, Florida Instituteof Technology, 2002.

[452] M. R. Paige and E. E. Balkovich. On testing programs. In Proceedings of the 1973 IEEESymposium on Computer Software Reliability, pages 23–27, 1973.

[453] A. Paradkar and K. C. Tai. “Test Generation for Boolean Expressions”. In Proceedings ofthe Fifth International Symposium on Software Reliability Engineering, pages 106–117.IEEE Computer Society Press, October 1995.

[454] A. Paradkar, K. C. Tai, and M. A. Vouk. “Automated Test Generation for Predicates”. InProceedings of the Seventh International Symposium on Software Reliability Engineer-ing, pages 66–75. IEEE Computer Society Press, November 1997.

[455] A. M. Paradkar. A new solution to test generation for Boolean expressions. In CAS-CON ’95: Proceedings of the 1995 conference of the Centre for Advanced Studies onCollaborative research, page 48. IBM Press, 1995.

[456] A. M. Paradkar. Specification-based testing using cause-effect graphs. PhD thesis, NorthCarolina State University, 1996.

[457] A. M. Paradkar. An integrated environment to automate generation of function tests forapis. In Proceedings of the International Symposium on Software Reliability, pages 304–316, October 2000.

[458] A. M. Paradkar. Towards model-based generation of self-priming and self-checking con-formance tests for interactive systems. Technical Report RC22586, IBM Research, York-town Heights, NY, 2002.

[459] A. M. Paradkar. Selecting small yet effective set of test data. In Proceedings of 21stIASTED International Multi-Conference on Applied Informatics, volume 21, pages 1013–1019, February 2003.

[460] A. M. Paradkar, K. C. Tai, and M A. Vouk. Specification-based testing using cause-effectgraphs. Annals of Software Engineering, 4:133–157, 1997.

[461] C. Pavlopoulou and M. Young. Residual test coverage monitoring. In ICSE ’99: Proceed-ings of the 21st international conference on Software engineering, pages 277–284, LosAlamitos, CA, USA, 1999. IEEE Computer Society Press.



[462] D. K. Peters and D. L. Parnas. Using test oracles generated from program documentation.IEEE Transactions on Software Engineering, 24(3):161–173, 1998.

[463] E. Petitjean and H. Fouchal. A realistic architecture for timed testing. In Fifth IEEE Inter-national Conference on Engineering of Complex Computer Systems (ICECCS), pages109–118. IEEE Press, October 1999.

[464] A. Petrenko, G. v. Bochmann, and M. Yao. On fault coverage of tests for finite statespecifications. Computer Networks and ISDN Systems, 29(1):81–106, 1996.

[465] A. Petrenko and N. Yevtushenko. On test derivation from partial specifications. In Pro-ceedings of the FIP TC6 WG6.1 Joint International Conference on Formal DescriptionTechniques for Distributed Systems and Communication Protocols (FORTE XIII) andProtocol Specification, Testing and Verification (PSTV XX), pages 85–102. Kluwer, B.V.,2000.

[466] M. S. Phadke. Robust testing and robust design for Software Engineering (in Japanese).Journal of Quality Engineering Forum, 3(5):21–27, 1995.

[467] M. S. Phadke. Planning efficient software tests. Crosstalk, 10:11–15, October 1997.

[468] S. Pimont and J. C. Rault. A software reliability assessment based on a structural andbehavioral analysis of programs. In Proceedings of the Second International Conferenceon Software Engineering, pages 486–491, October 1976.

[469] P. Piwowarski, M. Ohba, and J. Caruso. Coverage Measurement During Function Test.In International Conference on Software Engineering, pages 287–300, May 1993.

[470] N. Plat and P. G. Larsen. An overview of the ISO/VDM-SL standard. SIGPLAN Not.,27(8):76–82, 1992.

[471] I. Pomeranz and S. M. Reddy. Test generation for multiple state-table faults in finite-statemachines. IEEE Transactions on Computers, 46(7):783 –794, July 1997.

[472] R. L. Probert. Optimal insertion of software probes in well-delimited programs. IEEETransactions on Software Engineering, 8(1):34–42, 1982.

[473] P. Purdom. A sentence generator for testing parsers. BIT, 12:366–375, 1972.

[474] P. Puschner and R. Nossal. Testing the results of static worst-case execution-time anal-ysis. In Proceedings of the 9th IEEE Systems Symposium (RTSS98), pages 134–143.Springer-Verlag New York, Inc., December 1998.

[475] J. Raik, T. Nommeots, and R. Ubar. A new testability calculation method to guide rtl testgeneration. Journal of Electronic Testing, 21(1):71–82, 2005.

[476] C. V. Ramamoorthy, K. H. Kim, and W. T. Chen. Optimal placement of software monitorsaiding systematic testing. IEEE Transactions on Software Engineering, SE-1(4):403–411,December 1975.



[477] C. V. Ramamoorthy, R. E. Meeker, and J. Turner. Design and construction of an au-tomated software evaluation system. In Proceedings of the 1973 IEEE Symposium onComputer Software Reliability, pages 28–37, 1973.

[478] C. R. Rao. Hypercubes of strength d leading to confounded designs in factorial experi-ments. Bulletin of Calcutta mathematical Society, 38:67–78, 1946.

[479] S. Rapps and E. J. Weyuker. Data flow analysis techniques for test data selection. Tech-nical Report Technical Report 023, Courant Institute of Mathematical Sciences, Dept ofComputer Science, New York University, August/December 1980/1981.

[480] S. Rapps and E. J. Weyuker. Data flow analysis techniques for test data selection.In ICSE ’82: Proceedings of the 6th international conference on Software engineering,pages 272–278, Los Alamitos, CA, USA, 1982. IEEE Computer Society Press.

[481] Rational Rose RealTime User’s Guide, March 1999.

[482] S. Rayadurgam and M. P. E. Heimdahl. Generating MC/DC adequate test sequencesthrough model checking. In Proceedings. 28th Annual NASA Goddard Software Engi-neering Workshop, pages 91–96, December 2003.

[483] P. Raymond, X. Nicollin, N. Halbwachs, and D. Weber. Automatic testing of reactivesystems. In Proceedings of the 19th IEEE Real-Time Systems Symposium, pages 200–209, December 1998.

[484] RCTA. Final report for clarification of DO178B/ED12B “Software considerations in air-borne systems and equipment certification”. Technical Report RTCA/DO-248B, EURO-CAE/ED94B, RTCA, Inc., RCTA (formerly Radio Technical Commission for Aeronautics),December 1992.

[485] RCTA. Software considerations in airborne systems and equipment certification. Tech-nical Report RTCA/DO-178B, EUROCAE/ED012B, RTCA, Inc., RCTA (formerly RadioTechnical Commission for Aeronautics), December 1992.

[486] S. C. Reid. An empirical analysis of equivalence partitioning, boundary value analysisand random testing. In Proceedings of the Fourth International Software Metrics Sympo-sium, pages 64–73, November 1997.

[487] X. Ren, F. Shah, F. Tip, B. G. Ryder, and O. Chesley. Chianti: A tool for change impactanalysis of Java programs. In Object-Oriented Programming Systems, Languages, andApplications (OOPSLA 2004), pages 432–448, Vancouver, BC, Canada, October 26–282004.

[488] C. B. Rene, C. J. Colbourn, and M. B. Cohen. A framework of greedy methods forconstructing interaction test suites. In ICSE ’05: Proceedings of the 27th internationalconference on Software engineering, pages 146–155, New York, NY, USA, 2005. ACMPress.



[489] T. Reps, T. Ball, M. Das, and J. Larus. The use of program profiling for software mainte-nance with applications to the year 2000 problem. In ESEC ’97/FSE-5: Proceedings ofthe 6th European conference held jointly with the 5th ACM SIGSOFT international sym-posium on Foundations of software engineering, pages 432–449, New York, NY, USA,1997. Springer-Verlag New York, Inc.

[490] D. J. Richardson and L. A. Clarke. A partition analysis method to increase programreliability. In Proceedings of the Fifth International Conference on Software Engineering,pages 244–253. IEEE Press, March 1981.

[491] D. J. Richardson and M. C. Thompson. An analysis of test data selection criteria using therelay model of fault detection. IEEE Transactions Software Engineering, 19(6):533–553,1993.

[492] A. Ripley and G. David. A statistical analysis of syntax errors. Journal of ComputerLanguages, 3(4):227–240, 1978.

[493] A. D. Rocha. Uma ferramenta baseada em aspectos para apoio ao teste funcional deprogramas Java. Master’s thesis, University of Sao Pao, ICMC-USP, Sao Carlos, Brazil,January 2005.

[494] L.H. Rosenberg, T. F. Hammer, and L. L. Huffman. Requirements, testing, & metrics. InProceedings of 16th Pacific Northwest Software Quality Conference, UTAH, pages 1–12,October 1998.

[495] G. Rothermel. Efficient, effective regression testing using safe test selection techniques.PhD thesis, Clemson University, 1996.

[496] G. Rothermel and M. J Harrold. A safe, efficient algorithm for regression test selection.In ICSM ’93: Proceedings of the Conference on Software Maintenance, pages 358–367,Washington, DC, USA, 1993. IEEE Computer Society.

[497] G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage require-ments for modified software. In ISSTA ’94: Proceedings of the 1994 ACM SIGSOFTinternational symposium on Software testing and analysis, pages 169–184, New York,NY, USA, 1994. ACM Press.

[498] G. Rothermel and M. J. Harrold. Analyzing regression test selection techniques. IEEETransactions on Software Engineering, 22(8):529–551, 1996.

[499] G. Rothermel, M. J. Harrold, and J. Dedhia. Regression test selection for C++ software.Journal of Software Testing, Verification, and Reliability, 10(2), June 2000.

[500] R. J. Rubey, J. A. Dana, and P. W. Biche. Quantitative aspects of software validation.IEEE Transactions on Software Engineering, SE-1(2):150–155, 1975.

[501] M. J. Rummel, G. M. Kapfhammer, and A. Thall. Towards the prioritization of regres-sion test suites with data flow information. In SAC ’05: Proceedings of the 2005 ACMsymposium on Applied computing, pages 1499–1504, New York, NY, USA, 2005. ACMPress.



[502] J. Ryser and M. Glinz. A scenario-based approach to validating and testing software sys-tems using statecharts. In Proc. 12th International Conference on Software and SystemsEngineering and their Applications, December 1999.

[503] K. K. Sabnani and A. T. Dahbura. A Protocol Test Generation Procedure. ComputerNetworks and ISDN Systems, 15:285–297, 1988.

[504] S. Salva and H. Fouchal. Some parameters for timed system testability. In ACS/IEEEInternational Conference on Computer Systems and Applications, pages 335–341. IEEEPress, June 2001.

[505] D. Sankoff. Matching sequences under deletion/insertion constraints. In Proceedings ofNational Academy of Sciences, volume 69, pages 4–6, January 1972.

[506] B. Sarikaya. Conformance testing: architectures and test sequences. Computer Net-works and ISDN Systems, 17(5):111–126, 1989.

[507] B. Sarikaya and G. v. Bochmann. Synchronization and specification issues in protocoltesting. IEEE transactions on Communications, 32(4):389 –395, April 1984.

[508] B. Sarikaya, G. v. Bochmann, and E. Cerny. A test design methodology for protocoltesting. IEEE transactions on Software Engineering, SE-13(5):518–531, May 1987.

[509] R. L. Sauder. A general test data generator for COBOL. In Proceedings of the 1962SJCC, pages 317–323, May 1962.

[510] S.Elbaum, A. G. Malishevsky, and G. Rothermel. Prioritizing test cases for regressiontesting. In ISSTA ’00: Proceedings of the 2000 ACM SIGSOFT international symposiumon Software testing and analysis, pages 102–112, New York, NY, USA, 2000. ACM Press.

[511] S. M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):84–186, December 1977.

[512] R. K. Shehady and D. P. Siewiorek. A method to automate user interface testing usingvariable finite state machines. In Twenty-Seventh Annual International Symposium onFault-Tolerant Computing, FTCS-27. Digest of Papers, pages 80–88, 1997.

[513] Y. N. Shen, F. Lombardi, and A. T. Dahbura. Protocol conformance testing using multipleuio sequences. In Proceedings of the 9th IFIP Symposium on Protocol Specification,Testing, and Verification, June 1989.

[514] K. D. Shere and R. A. Carlson. Real-time: the “lost world” of software debugging andtesting. IEEE Computer, 27(2):35–48, 1994.

[515] S. B. Sherwood. Effective testing of factor combinations. In Proceedings of the ThirdInternational Conference on Software Testing, Analysis, and Review, Washington, DC,May 1994.



[516] A. Shye, M. Iyer, V. J. Reddy, and D. A. Connors. Code coverage testing using hardwareperformance monitoring support. In AADEBUG’05: Proceedings of the Sixth sixth in-ternational symposium on Automated analysis-driven debugging, pages 159–163, NewYork, NY, USA, 2005. ACM Press.

[517] D. P. Sidhu and C.-S. Chang. Probabilistic testing of protocols. In Symposium proceed-ings on Communications architectures & protocols, pages 295–302. ACM Press, 1989.

[518] D. P. Sidhu and T. K. Leung. Experience with test generation for real protocols. InSymposium proceedings on Communications architectures and protocols, pages 257–261. ACM Press, 1988.

[519] D. P. Sidhu and T. K. Leung. Formal methods for protocol testing: a detailed study. IEEETransactions on Networking, 1(1):116–129, February 1993.

[520] A. S. Simao and J. C. Maldonado. Mutation based test sequence generation for petrinets. In Proceedings of III Workshop of Formal Methods, pages 68–79, 2000.

[521] A. S. Simao, J. C. Maldonado, and S. C. P. F. Fabbri. Proteum-RS/PN: A tool to supportedition, simulation and validation of petri nets based on mutation testing. In Anais do XIVSimposio Brasileiro de Engenharia de Software, pages 227–242, 2000.

[522] H. Singh, M. Conrad, and S. Sadeghipour. Test case design based on z and theclassification-tree method. In Proceedings First IEEE International Conference Confer-ence on Formal Engineering Methods, pages 81–90, 1997.

[523] P. Slavik. A tight analysis of the greedy algorithm for set cover. In STOC ’96: Proceedingsof the twenty-eighth annual ACM symposium on Theory of computing, pages 435–441,New York, NY, USA, 1996. ACM Press.

[524] N. J. A. Sloane. Covering arrays and intersecting codes. Journal of Combinatorial De-signs, 1:51–63, 1973.

[525] B. Smith, W. Millar, J. Dunphy, Y. W. Tung, P. Nayak, E. Gamble, and M. Clark. Validationand verification of the remote agent for spacecraft autonomy. In Proceedings of the 1999IEEE Aerospace Conference, volume 1, pages 449–468. IEEE Press, March 1999.

[526] G. Smith. The Object-Z specification language. In Advances in Formal methods. KluwerAcademic, 2000.

[527] G. Smith. The Object-Z Specification Language. Kluwer Academic Publishers, Advancesin Formal Methods series, 2000.

[528] IEEE Computer Society. IEEE Standard for Software Test Documentation, ANSI/IEEEStd. 829-1983. IEEE Computer Society, 1983.

[529] S. Some, R. Dssouli, and J. Vaucher. From scenarios to timed automata: building specifi-cations from users requirements. In Proceedings of the Asia Pacific Software EngineeringConference, pages 48–57, December 1995.



[530] Specification of a transport protocol for computer communication: Service specifications,January 1983. Rep. ICST/HLNP-83-4.

[531] J. M. Spivey. The Z notation: A Reference Manual. Prentice Hall, 1989.

[532] J. Springintveld and F. Vaandrager. Minimizable timed automata. In Proceedings ofthe 4th International Symposium on Formal Techniques in Real Time and Fault TolerantSystems, Lecture Notes in Computer Science, volume 1135, pages 130–147. Springer-Verlag, 1996.

[533] J. Springintveld, F. Vaandrager, and P. Dargenio. Testing timed automata. TheoreticalComputer Science, 254(1-2):225–257, 2001.

[534] H. Srikanth and L. Williams. On the economics of requirements-based test case prioriti-zation. In EDSER ’05: Proceedings of the seventh international workshop on Economics-driven software engineering research, pages 1–3, New York, NY, USA, 2005. ACM Press.

[535] A. Srivastava, A.Edwards, and H. Vo. Vulcan: Binary Transformation in a DistributedEnvironment. Technical Report MSR-TR-2001-50, Microsoft, 2001.

[536] A. Srivastava and J. Thiagarajan. Effectively prioritizing tests in development environ-ment. In ISSTA ’02: Proceedings of the 2002 ACM SIGSOFT international symposiumon Software testing and analysis, pages 97–106, New York, NY, USA, 2002. ACM Press.

[537] T. Srivatanakul, J. A. Clark, S. Stepney, and F. Polack. Challenging formal specificationsby mutation: a CSP example. In Proceedings of Tenth Asia Pacific Software EngineeringConference, pages 340–350, 2003.

[538] T. Srivatanukul. Mutation testing for concurrency. Master’s thesis, University of York, TheDepartment of Computer Science, September 2001.

[539] I. Stamelos. Detecting associative shift faults in predicate testing. Journal of Systemsand Software, 66(1):57–63, April 2003.

[540] P. A. Stocks. Applying formal methods to software testing. PhD thesis, The University ofQueensland, Department of Computer Science, December 1993.

[541] P. A. Stocks and D. A. Carrington. Deriving software test cases from formal specifications.In Proceedings of the 6th Australian Software Engineering Conference, pages 327–340,July 1991.

[542] P. A. Stocks and D. A. Carrington. Test template framework: a specification-based testingcase study. In Proceedings of the International Symposium on Software Testing andAnalysis (ISSTA’93), pages 11–18, June 1993.

[543] P. A. Stocks and D. A. Carrington. A framework for specification-based testing. IEEEtransactions on Software Engineering, 22(11):777–793, November 1996.

[544] A. Sung and B. Choi. Interaction testing in an embedded system using hardware faultinjection and program mutation. In Proceedings of Workshop on Formal Approaches toTesting Software, pages 18–25, October 2003.



[545] A. Sung, B. Choi, and J. Lee. Interaction mutation testing. In Fast Abstracts: Supplemen-tal Proceedings of the 14th International Symposium on Software Reliability Engineering,pages 301–302, November 2003.

[546] E. Suvanaphen and J. C. Roberts. Textual Difference Visualization of Multiple Search Re-sults utilizing Detail in Context. In Paul G. Lever, editor, Theory and Practice of ComputerGraphics, pages 2–8. IEEE Computer Society, June 2004.

[547] K. C. Tai. Condition testing for software quality assurance. In Proceedings of the FourthAnnual Conference on Computer Assurance, COMPASS’89, pages 31–35, June 1989.

[548] K. C. Tai. Predicate-based test generation for computer programs. Technical Report92-23, North carolina State University, Department of Computer Science, 1992.

[549] K. C. Tai. Predicate-based test generation for computer programs. In Proceedings of the15th international conference on Software Engineering, pages 267–276. IEEE ComputerSociety Press, 1993.

[550] K.-C. Tai. Theory of fault-based predicate testing for computer programs. IEEE Transac-tions on Software Engineering, 22(8):552–562, 1996.

[551] K. C. Tai, A. Paradkar, H. K. Su, and M. A. Vouk. Fault-based test generation for cause-effect graphs. In Proceedings of the 1993 conference of the Centre for Advanced Studieson Collaborative research, pages 495–504. IBM Press, 1993.

[552] K. C. Tai and H. K. Su. Test generation for Boolean expressions. In Proceedings ofCOMPSAC (Computer Software and Applications), pages 278–283, 1987.

[553] K. C. Tai, M. A. Vouk, A. Paradkar, and P. Lu. Evaluation of a predicate-based softwaretesting strategy. IBM Systems Journal, pages 445–457, September 1994.

[554] S. Tallam and N. Gupta. A concept analysis inspired greedy algorithm for test suiteminimization. In PASTE ’05: The 6th ACM SIGPLAN-SIGSOFT workshop on Programanalysis for software tools and engineering, pages 35–42, New York, NY, USA, 2005.ACM Press.

[555] S. Tasiran and K. Keutzer. Coverage metrics for functional validation of hardware designs.IEEE Design and Test of Computers, 18(4):36–45, July-August 2001.

[556] R. N. Taylor, D. L. Levine, and C. D. Kelly. Structural testing of concurrent programs. IEEETransactions on Software Engineering, 18(3):206–215, 1992.

[557] Leirios Technologies. http://www.leirios.com/.

[558] Telcordia Technologies. AETG Web Home. http://aetgweb.argreenhouse.com/. TheAETG Web service is available via this site at the time of writing this book.

[559] Telcordia Software Visualization and Analysis Toolsuite. http://xsuds.argreenhouse.com/.



[560] M. M. Tikir and J. K. Hollingsworth. Efficient instrumentation for code coverage test-ing. In ISSTA ’02: Proceedings of the 2002 ACM SIGSOFT international symposium onSoftware testing and analysis, pages 86–96, New York, NY, USA, 2002. ACM Press.

[561] P. Tripathy and B. Sarikaya. Test generation from LOTOS specifications. IEEE Transac-tions on Computers, 40(4):543–542, 1991.

[562] E. Trischler. An integrated design for testability and automatic test pattern generationsystem: An overview. In DAC ’84: Proceedings of the 21st conference on Design au-tomation, pages 209–215, Piscataway, NJ, USA, 1984. IEEE Press.

[563] B. Y. Tsai, S. Stobart, and N. Parrington. Employing data flow testing on object-orientedclasses. In IEE Proceedings [see also Software Engineering, IEE Proceedings], volume148, pages 56–64, April 2001.

[564] T. W. Tsai, V. Agarwal, B. Huang, and R. Paul. Augmenting sequence constraints in Zand its application to testing. In Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, pages 41–48, March 2000.

[565] Y. W. Tung and W. S. Aldiwan. Automating test case generation for the new generationmission software system. IEEE Aerospace Conference Proceedings, 11:431–437, March2000.

[566] R. H. Untch. Mutation-based software testing using program schemata. In ACM-SE 30:Proceedings of the 30th annual Southeast regional conference, pages 285–291, NewYork, NY, USA, 1992. ACM Press.

[567] R. H. Untch, A. J. Offutt, and M. J. Harrold. Mutation analysis using mutant schemata. InISSTA ’93: Proceedings of the 1993 ACM SIGSOFT International Symposium on Soft-ware Testing and Analysis, pages 139–148, New York, NY, USA, 1993. ACM Press.

[568] H. Ural, W. Xiaolin, and F. Zhang. On minimizing the lengths of checking sequences.IEEE Transactions on Computers, 46(1):93 –99, 1997.

[569] A. C. Uselton and S. A. Smolka. A Compositional Semantics for Statecharts using La-beled Transition Systems. In Proceedings of the 5th International Conference on Concur-rency Theory, CONCUR 1994, Notes in Computer Science 836, pages 2–17. Springer,1994.

[570] M. U. Uyar and A. T. Dahbura. Optimum test sequence generation for protocols: TheChinese Postman algorithm applied to Q.931. In Proceedings of GLOBECOM’86, pages3.1.1–3.1.5, 1986.

[571] M. U. Uyar and A. Y. Duale. Test generation for EFSM models of complex army protocolswith inconsistencies. In MILCOM 2000. Proceedings 21st Century Military Communica-tions Conference, volume 1, pages 340 –346, October 2000.

[572] S. R. Virgilio, J. C. Maldonado, and M. Jino. Constraint based selection of test sets to sat-isfy structural software testing criteria. In In Proceedings of XVII International Conferenceof the Chilean Computer Science Society, pages 256–263, November 1997.



[573] J. Voas. PIE: A dynamic failure based technique. IEEE Transactions on Software Engi-neering, 18(8):717–727, August 1992.

[574] J. Voas and K. Miller. Software testability: The new verification. IEEE Software, 12(3):17–28, May 1995.

[575] J. Voas, L. Morell, and K. Miller. Predicting where faults can hide from testing. IEEESoftware, 8:41– 48, March 1991.

[576] J. M. Voas. Dynamic testing complexity metric. Technical report, NASA Langley TechnicalReport Server, 1992.

[577] M. Vokac. Defect frequency and design patterns: an empirical study of industrial code.IEEE Transactions on Software Engineering, 30(12):904–917, December 2004.

[578] F. Vokolos and P. Frankl. Pythia: A regression test selection tool based on textual differ-encing. In In ENCRESS ’97, Third International Conference on Reliability, Quality, andSafety of Software Intensive Systems, May 1997.

[579] F. I. Vokolos. A regression test selection technique based on textual differencing. PhDthesis, Polytechnic University, Brooklyn, NY, USA, January 1998.

[580] F. I. Vokolos and P. G. Frankl. Empirical evaluation of the textual differencing regressiontesting technique. In ICSM ’98: Proceedings of the International Conference on SoftwareMaintenance, page 44, Washington, DC, USA, 1998. IEEE Computer Society.

[581] C. T. Vuong and K. C. Ko. A novel approach to protocol test sequence generation. InGlobal Telecommunications Conference, volume 3, pages 1880–1884, December 1990.

[582] P. J. Walsh. A measure of test case completeness. PhD thesis, State University of NewYork, Binghamton, NY, 1985.

[583] B. Wang and D. Hutchison. Protocol testing techniques. Computer Communications,10(2):79–87, 1987.

[584] C. J. Wang and M. T. Liu. Generating test cases for EFSM with given fault models. InINFOCOM ’93. Proceedings of Twelfth Annual Joint Conference of the IEEE Computerand Communications Societies, volume 2, pages 774 –781, April 1993.

[585] T.-H. Wang and C. G. Tan. Practical code coverage for Verilog. In Proceedings of Inter-national Verilog HDL Conference, pages 99–104, March 1995.

[586] A. Watanabe and K. Sakamura. A specification-based adaptive test case generationstrategy for open operating system standards. In ICSE ’96: Proceedings of the 18thinternational conference on Software engineering, pages 81–89, Washington, DC, USA,1996. IEEE Computer Society.

[587] J. Wegener and M. Grochtmann. Verifying timing constraints of real-time systems bymeans of evolutionary testing. Real-Time Systems, 15(3):275–298, 1998.



[588] M. Weiser. Program slicing. In Proceedings of the 5th International Conference onSoftware Engineering, pages 439–449. IEEE Press, 1981.

[589] M. Weiser. Program slicing. IEEE Transactions on Software Engineering, SE-10(4):352–357, 1984.

[590] S. N. Weiss and V. N. Fleyshgakker. Hitest: An architecture for highly parallel softwaretesting. In In Proceedings of the 1992 IEEE International Conference on Computer Sys-tems and Software Engineering, pages 347–352. IEEE Computer Society, May 1992.

[591] S. N. Weiss and V. N. Fleyshgakker. Improved serial algorithms for mutation analysis. InISSTA ’93: Proceedings of the 1993 ACM SIGSOFT international symposium on Soft-ware testing and analysis, pages 149–158, New York, NY, USA, 1993. ACM Press.

[592] C. H. West. Protocol validation: principles and applications. Computer Networks ISDNSystems, 24(3):219–242, May 1992.

[593] E. J. Weyuker. Evaluating software complexity measures. IEEE Transactions on SoftwareEngineering, 14(9):1357–1365, 1988.

[594] E. J. Weyuker. In defense of coverage criteria. In 11th International Conference onSoftware Engineering, pages 361–361, May 1989.

[595] E. J. Weyuker. The cost of data flow testing: an empirical study. IEEE Transactions onSoftware Engineering, 16(2):121–128, February 1990.

[596] E. J. Weyuker. More experience with data flow testing. IEEE Transactions on SoftwareEngineering, 19(9):912–919, September 1990.

[597] E. J. Weyuker, T. Gordia, and A. Singh. Automatically generating test data from a Booleanspecification. IEEE Transactions on Software Engineering, 20(5):353–363, 1994.

[598] L. White, H. Almezen, and S. Sastry. Firewall regression testing of GUI sequences andtheir interactions. In Proceedings of the International Conference on Software Mainte-nance, pages 398–409. IEEE Computer Society, September 2003.

[599] L. White, K. Jaber, and B. Robinson. Utilization of extended firewall for object-orientedregression testing. In Proceedings of the 21st IEEE International Conference on SoftwareMaintenance. ICSM’05, pages 695–698, 2005.

[600] L. White and B. Robinson. Industrial real-time regression testing and analysis usingfirewalls. In Proceedings of International Conference on Software Maintenance, pages18–27, 2004.

[601] L. J. White and K. Abdullah. A firewall approach for regression testing of object-orientedsoftware. In Proceedings of 10th Annual Software Quality Week, May 1997.

[602] L. J. White and E. I. Cohen. A domain strategy for computer program testing. IEEETransactions on Software Engineering, SE-6:247–257, May 1980.



[603] L. J. White and H. K. N. Leung. A Firewall Concept for both control-flow and data-flow in regression integration testing. In Proceedings of the Symposium on SoftwareMaintenance, pages 262–271, November 1992.

[604] L. J. White and H. K. N. Leung. On the edge: regression testability. IEEE Micro, 12(2):81–84, 1992.

[605] W. E. Wong. On Mutation and Data Flow. PhD thesis, Purdue University, West Lafayette,IN, 1993. Advisor: Aditya Mathur.

[606] W. E. Wong, J. R. Horgan, S. London, and A. P. Mathur. Effect of test set size andblock coverage on the fault detection effectiveness. In Proceedings of 5th InternationalSymposium on Software Reliability Engineering, pages 230–238, November 1994.

[607] W. E. Wong, J. R. Horgan, A. P. Mathur, and A. Pasquini. Test set size minimizationand fault detection effectiveness: a case study in a space application. In Proceedings ofThe Twenty-First Annual International Computer Software and Applications Conference( COMPSAC ’97), pages 522–528, August 1997.

[608] W. E. Wong, J. R. Horgan, S.London, and H. Agrawal. A study of effective regressiontesting in practice. In ISSRE ’97: Proceedings of the Eighth International Symposium onSoftware Reliability Engineering (ISSRE ’97), page 264, Washington, DC, USA, 1997.IEEE Computer Society.

[609] W. E. Wong, Y. Lei, and X. Ma. Effective generation of test sequences for structuraltesting of concurrent programs. In Proceedings. 10th IEEE International Conferenceon Engineering of Complex Computer Systems ( ICECCS 2005), pages 539–548, June2005.

[610] W. E. Wong and A. P. Mathur. Reducing the cost of mutation testing: an empirical study.Journal of Systems and Software, 31(3):185–196, 1995.

[611] M. R. Woodward. Mutation testing of algebraic specifications. In Proceedings of theSoftware Quality Workshop, pages 169–178, June 1990.

[612] M. R. Woodward. Aspects of path testing and mutation testing. In D. Ince, editor, SoftwareQuality and Reliability: Tools and Methods, pages 1–15. Chapman and Hall, 1991.

[613] M. R. Woodward. OBJTEST: an experimental testing tool for algebraic specifications. InIEE Colloquium Digest: Automating Formal Methods for Computer Assisted Prototyping,pages 2/1–2/2, June 1992.

[614] M. R. Woodward. Errors in algebraic specifications and an experimental mutation testingtool. Software Engineering Journal, 8(4):211–224, July 1993.

[615] M. R. Woodward. Mutation testing: its origin and evolution. Information and SoftwareTechnology, 35(3):163–169, March 1993.



[616] M. R. Woodward and K. Halewood. From weak to strong, dead or alive. In Proceedingsof the Second Workshop on Software Testing, Verification and Analysis, pages 152–158,Banff, Canada, July 1988. IEEE Computer Society Press.

[617] M. R. Woodward, D. Hedley, and M. A. Hennell. On program analysis. InformationProcessing Letters, 5:136–140, November 1976.

[618] M. R. Woodward and M. A. Hennell. On the relationship between two control-flow cover-age criteria: All jj-paths and mcdc. Information and Software Technology, 48(7):433–440,July 2006.

[619] J. B. Wordsworth. Formal methods in the development of CICS. Computer Bulletin,pages 6–8, 1987.

[620] E. Xia, I. Jurisica, J. Waterhouse, and V. Sloan. Scheduling functional regression testsfor ibm db2 products. In CASCON ’05: Proceedings of the 2005 conference of the Centrefor Advanced Studies on Collaborative research, pages 292–304. IBM Press, 2005.

[621] R. Xu, Y. Xue, P. Nie, Y. Zhang, and D. Li. Research on cmmi-based software processmetrics. In Proceedings of First International Multi-Symposiums on Computer and Com-putational Sciences. IMSCCS ’06., volume 2, pages 391–397, April 2006.

[622] S. M. Yacoub and H. H. Ammar. The development of a client/server architecture forstandardized medical application network services . In IEEE Symposium on Application-Specific Systems and Software Engineering and Technology, pages 2–9. IEEE Press,October 1999.

[623] B. Yang and H. Ural. Protocol conformance test generation using multiple uio sequenceswith overlapping. In Proceedings of the ACM symposium on Communications architec-tures & protocols, pages 118–125. ACM Press, 1990.

[624] M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition sys-tems. Formal Methods in System Design, 11(2):113–136, 1997.

[625] S. S. Yau and Z. Kishimoto. Revalidating Modified Programs in the Maintenance Phase.In IEEE COMPSAC, pages 272–=277, 1987.

[626] N. Yevtushenko, A. R. Cavalli, and R. Anido. Test suite minimization for embedded non-deterministic finite state machines. In Proceedings of the IFIP TC6 12th InternationalWorkshop on Testing Communicating Systems, pages 237–250. Kluwer, B.V., 1999.

[627] H. Yin and J.M. Biemen. Improving software testability with assertion insertion. In Pro-ceedings of International Test Conference, pages 831–839, October 1994.

[628] E. A. Youngs. Error-proneness in programming. PhD thesis, North Carolina State Uni-versity, 1970.

[629] Y. Zhan and J. A. Clark. Search-based mutation testing for simulink models. In GECCO’05: Proceedings of the 2005 conference on Genetic and evolutionary computation,pages 1061–1068, New York, NY, USA, 2005. ACM Press.



[630] X. Zhang and R. Gupta. Matching execution histories of program versions. In ESEC/FSE-13: Proceedings of the 10th European software engineering conference held jointly with13th ACM SIGSOFT international symposium on Foundations of software engineering,pages 197–206, New York, NY, USA, 2005. ACM Press.

[631] X. Zhang and R. Gupta. Whole execution traces and their applications. ACM Transactionson Architecture and Code Optimization, 2(3), 2005.

[632] X. Zhang, R. Gupta, and Y. Zhang. Precise dynamic slicing algorithms. In ICSE ’03:Proceedings of the 25th International Conference on Software Engineering, pages 319–329, Washington, DC, USA, 2003. IEEE Computer Society.

[633] J. Zheng, B.Robinson, L. Williams, and K. Smiley. Applying regression test selection forcots-based applications. In ICSE ’06: Proceeding of the 28th international conference onSoftware engineering, pages 512–522, New York, NY, USA, 2006. ACM Press.

[634] H. Zhu, P. A. V. Hall, and J. H. R. May. Software unit test coverage and adequacy. ACMComputing Surveys, 29(4):366–427, December 1997.

[635] G. W. Zobrist. VLSI Fault Modeling and Testing Techniques. Ablex Publishing, 1993.


bibliography - purdue university · 2006. 8. 7. · actions on softw are eng ineer ing ,...

Documents