The art of software testing. Myers (2nd edition) (2004) (The art of software testing. Myers (2nd edition) (2004).pdf), страница 37

The types of tests you rundepend on the architecture.212The Art of Software TestingYou should also consider database recovery as equally important.The objective of recoverability testing is to create a scenario in whichyou cannot recover that database. At some point, your database willcrash, so you should have procedures in place to recover it veryquickly. The planning for recovery begins in obtaining valid backups.If you cannot recover the database during recoverability testing, thenyou need to modify your backup plan.APPENDIX ASample ExtremeTesting Application1. check4Prime.javaTo compile:&> javac check4Prime.javaTo run:&> java -cp check4Prime 5Yippeee...

5 is a prime number!&> java -cp check4Prime 10Bummer.... 10 is NOT a prime number!&> java -cp check4Prime AUsage: check4Prime x-- where 0<=x<=1000Source code://check4Prime.java//Importsimport java.lang.*;public class check4Prime {static final int max = 1000;// Set upper bounds.static final int min = 0;// Set lower bounds.static int input =0;// Initialize input variable.213214Appendix Apublic static void main (String [] args) {//Initialize class object to work withcheck4Prime check = new check4Prime();try{//Check arguments and assign value to input variablecheck.checkArgs(args);//Check for Exception and display help}catch (Exception e) {System.out.println("Usage: check4Prime x");System.out.println("-- where 0<=x<=1000");System.exit(1);}//Check if input is a prime numberif (check.primeCheck(input))System.out.println("Yippeee...

" + input + " is a prime number!");elseSystem.out.println("Bummer... " + input + " is NOT a prime number!");} //End main//Calculates prime numbers and compares it to the inputpublic boolean primeCheck (int num) {double sqroot = Math.sqrt(max);// Find square root of n//Initialize array to hold prime numbersboolean primeBucket [] = new boolean [max+1];//Initialize all elements to true, then set non-primes to falsefor (int i=2; i<=max; i++) {primeBucket[i]=true;}Appendix A//Do all multiples of 2 firstint j=2;for (int i=j+j; i<=max; i=i+j) {primeBucket[i]=false;//start with 2j as 2 is prime//set all multiples to false}for (j=3; j<=sqroot; j=j+2) {if (primeBucket[j]==true) {for (int i=j+j; i<=max; i=i+j) {primeBucket[i]=false;// do up to sqrt of n// only do if j is a prime// start with 2j as j is prime// set all multiples to false}}}//Check input against prime arrayif (primeBucket[num] == true) {return true;}else{return false;}}//end primeCheck()//Method to validate inputpublic void checkArgs(String [] args) throws Exception{//Check arguments for correct number of parametersif (args.length != 1) {throw new Exception();}else{//Get integer from characterInteger num = Integer.valueOf(args[0]);input = num.intValue();215216Appendix A//If less than zeroif (input < 0)//If less than lower boundsthrow new Exception();else if (input > max)//If greater than upper boundsthrow new Exception();}}}//End check4Prime2.

check4PrimeTest.javaRequires the JUnit API, junit.jarTo compile:&> javac -classpath .:junit.jar check4PrimeTest.javaTo run:&> java -cp .:junit.jar check4PrimeTestExamples:Starting test..........Time: 0.01OK (7 tests)Test finished...Appendix ASource code://check4PrimeTest.java//Importsimport junit.framework.*;public class check4PrimeTest extends TestCase{//Initialize a class to work with.private check4Prime check4prime = new check4Prime();//constructorpublic check4PrimeTest (String name) {super(name);}//Main entry pointpublic static void main(String[] args) {System.out.println("Starting test...");junit.textui.TestRunner.run(suite());System.out.println("Test finished...");} // end main()//Test case 1public void testCheckPrime_true() {assertTrue(check4prime.primeCheck(3));}//Test cases 2,3public void testCheckPrime_false() {assertFalse(check4prime.primeCheck(0));assertFalse(check4prime.primeCheck(1000));}217218Appendix A//Test case 7public void testCheck4Prime_checkArgs_char_input() {try {String [] args= new String[1];args[0]="r";check4prime.checkArgs(args);fail("Should raise an Exception.");} catch (Exception success) {//successful test}} //end testCheck4Prime_checkArgs_char_input()//Test case 5public void testCheck4Prime_checkArgs_above_upper_bound() {try {String [] args= new String[1];args[0]="10001";check4prime.checkArgs(args);fail("Should raise an Exception.");} catch (Exception success) {//successful test}} // end testCheck4Prime_checkArgs_upper_bound()//Test case 4public void testCheck4Prime_checkArgs_neg_input() {try {String [] args= new String[1];args[0]="-1";check4prime.checkArgs(args);fail("Should raise an Exception.");} catch (Exception success) {//successful test}}// end testCheck4Prime_checkArgs_neg_input()Appendix A//Test case 6public void testCheck4Prime_checkArgs_2_inputs() {try {String [] args= new String[2];args[0]="5";args[1]="99";check4prime.checkArgs(args);fail("Should raise an Exception.");} catch (Exception success) {//successful test}} // end testCheck4Prime_checkArgs_2_inputs//Test case 8public void testCheck4Prime_checkArgs_0_inputs() {try {String [] args= new String[0];check4prime.checkArgs(args);fail("Should raise an Exception.");} catch (Exception success) {//successful test}} // end testCheck4Prime_checkArgs_0_inputs//JUnit required method.public static Test suite() {TestSuite suite = new TestSuite(check4PrimeTest.class);return suite;}//end suite()} //end check4PrimeTest219APPENDIX BPrime NumbersLess Than 1,0002317312717923328335341946754760766173981187794733779131181239293359421479557613673743821881953541831371912413073674314875636176777518238839677438913919325131137343349156961968375782788797111479714919725731337943949957163169176182990797713531011511992633173834435035776417017698399119832211759103157211269331389449509587643709773853919991196110716322327133739745752159364771978785792999723671091672272773474014615235996537277978599372971113173229281349409463541601659733809863941Glossaryblack-box testing.

A testing approach whereby the program is considered as a complete entity and the internal structure is ignored.Test data are derived solely from the application’s specification.bottom-up testing. A form of incremental module testing in whichthe terminal module is tested first, then its calling module, andso on.boundary-value analysis. A black-box testing methodology thatfocuses on the boundary areas of a program’s input domain.branch coverage.

See decision coverage.cause-effect graphing. A technique that aids in identifying a set ofhigh-yield test cases by using a simplified digital-logic circuit (combinatorial logic network) graph.code inspection. A set of procedures and error-detection techniquesused for group code readings that is often used as part of the testing cycle to detect errors. Usually a checklist of common errors isused to compare the code against.condition coverage. A white-box criterion in which one writesenough test cases that each condition in a decision takes on all possible outcomes at least once.data-driven testing. See black-box testing.decision/condition coverage.

A white-box testing criterion thatrequires sufficient test cases that each condition in a decision takeson all possible outcomes at least once, each decision takes on allpossible outcomes at least once, and each point of entry is invokedat least once.223224Glossarydecision coverage. A criterion used in white-box testing in whichyou write enough test cases that each decision has a true and a falseoutcome at least once.desk checking. A combination of code inspection and walk-throughtechniques that the program performs at the user’s desk.equivalence partitioning. A black-box methodology in which eachtest case should invoke as many different input conditions as possible in order to minimize the total number of test cases; you shouldtry to partition the input domain of a program into equivalentclasses such that the test result for an input in a class is representative of the test results for all inputs of the same class.exhaustive input testing.

A criterion used in black-box testing inwhich one tries to find all errors in a program by using every possible input condition as a test case.external specification. A precise description of a program’s behaviorfrom the viewpoint of the user of a dependent system component.facility testing. A form of system testing in which you determine ifeach facility (a.k.a. function) stated in the objectives is implemented. Do not confuse facility testing with function testing.function testing. The process of finding discrepancies between theprogram and its external specification.incremental testing. A form of module testing whereby the moduleto be tested is combined with already-tested modules.input/output testing.

See black-box testing.JVM. Acronym for Java Virtual Machine.LDAP. Acronym for Lightweight Directory Application Protocol.logic-driven testing. See white-box testing.multiple-condition coverage. A white-box criterion in which onewrites enough test cases that all possible combinations of conditionoutcomes in each decision, and all points of entry, are invoked atleast once.nonincremental testing. A form of module testing whereby eachmodule is tested independently.performance testing.

A system test in which you try to demonstrate that an application does not meet certain criteria, such asGlossary225response time and throughput rates, under certain workloads orconfigurations.random-input testing. The processes of testing a program by randomly selecting a subset of all possible input values.security testing. A form of system testing whereby you try to compromise the security mechanisms of an application or system.stress testing. A form of system testing whereby you subject the program to heavy loads or stresses. Heavy stresses are considered peakvolumes of data or activity over a short time span. Internet applications where large numbers of concurrent users can access the applications typically require stress testing.system testing. A form of higher-order testing that compares thesystem or program to the original objectives.

To complete systemtesting, you must have a written set of measurable objectives.testing. The process of executing a program, or a discrete programunit, with the intent of finding errors.top-down testing. A form of incremental module testing in whichthe initial module is tested first, then the next subordinate module,and so on.usability testing. A form of system testing in which the humanfactor elements of an application are tested. Components generallychecked include screen layout, screen colors, output formats, inputfields, program flow, spellings, and so on.volume testing. A type of system testing of the application with largevolumes of data to determine whether the application can handlethe volume of data specified in its objectives. Volume testing is notthe same as stress testing.walkthrough.