Building on the knowledge gained in chapter 1, this chapter explains the next form of black-box testing, based on the boundary values of each equivalence partition.

This chapter provides a more detailed description of the background of black-box and white-box testing. it then discusses a number of more advanced issues, covering testing with: more complex data types and data structures, more complex specifications, and more complex code. The chapter ends with an overview of some more advanced forms of white-box testing: condition coverage, decision coverage, decision-condition coverage, multiple condition coverage, and modified condition/decision coverage.

Test automation is used to make software testing must be reliable, fast, and repeatable. This chapter usesan exemplar test framework (TestNG) to demonstrate typical automation features. The handling of timeouts and exceptiomns is examined. A mode advanced look at inheritance testing is presented. The chapter ends with a further look at examining different types of application: web-based, desktop, and mobile.

As an introduction to white-box testing, the first technique presented shows how to identify lines of code that have not been executed during testing, and how to develop additional tests to ensure that they produce the correct results when executed.

Application testing is often emphasised in practice, as it ensures that an entire software system works for a user. However, this is substantially more complex than unit-testing, so this topic is addressed after the underlying concepts have been introduced in the previous chapters. As for object-oriented testing, this is a significant topic, and the reader is introduced to the common form used in practice: user-story testing. A worked example is used to present the techniques involved to analyse the software interface and produce a fully automated set of tests for a web-based application. A more detailed analysis follows, identifying many of the more difficult problems that an application tester will experience.

Testing is an important element in the software development cycle. This chapter examines where software testing fits into a number of software process models: the waterfall model, the V-model, incremental and Agile development, eXtreme Programming, and SCRUM.

There is a subtle distinction between statements in a program, and the branches between those statements. Even with full statement coverage, faults may remain. This chapter presented shows how to identify branches in the code that have not been taken during testing, and how to develop additional tests to ensure that they produce the correct results when they are taken.

The book is summarised by reviewingthe topics discussed and practised. It then motivates the software testing process used in the book by tracing all the steps backwards based on the data required by each step. We further provide additional reading material, categoriesed by important topics such as random testing, program proving, testing safety-critical software, etc. The chapter closes with a glimpse into current 'hot' research topics.

Combinations of different inputs, when not correctly handled, are a frequent cause of faults in software. Decision tables allow the tester to identify these combinations, and further improve the test coverage. Building on the knowledge gained in the previous chapters, this chapter explains how to identify casues and effects, build a decision table, and then use the rules in the table to develop test cases and automated tests.

The technique of finite-injury constructions is among the most important in computability theory. We introduce two types: priority constructions and true-stage constructions.

Forcing and generics are useful tools all over computability theory. The main concepts of this chapter are 1-generic enumerations of structures and 1-generic presentations.

A common way to measure the complexity is by comparing it to other objects. We will look into Muchnik and Medvedev reducibility, and effective interpretability and bi-interpretability.

Existentially atomic structures are atomic structures where all the types are generated by existential formulas. They are the best-behaved structures around.

Computably categorical structures are the ones for which all computable ω-presentations have the same computational properties. We analyze what we know about them.