### Resumé

Originalsprog | Engelsk |
---|---|

Titel | 33rd Annual IEEE International Computer Software and Applications Conference |

Forlag | IEEE |

Publikationsdato | 2009 |

Sider | 160-165 |

Status | Udgivet - 2009 |

Begivenhed | 33rd IEEE International Computer Software and Applications Conference - Seattle, USA Varighed: 20 jul. 2009 → 24 jul. 2009 Konferencens nummer: 33 |

### Konference

Konference | 33rd IEEE International Computer Software and Applications Conference |
---|---|

Nummer | 33 |

Land | USA |

By | Seattle |

Periode | 20/07/2009 → 24/07/2009 |

### Citer dette

*33rd Annual IEEE International Computer Software and Applications Conference*(s. 160-165). IEEE.

}

*33rd Annual IEEE International Computer Software and Applications Conference.*IEEE, s. 160-165, 33rd IEEE International Computer Software and Applications Conference, Seattle, USA, 20/07/2009.

**Towards a Theory for Testing Non-terminating Programs.** / Gotlieb, Arnaud; Petit, Matthieu.

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - Towards a Theory for Testing Non-terminating Programs

AU - Gotlieb, Arnaud

AU - Petit, Matthieu

PY - 2009

Y1 - 2009

N2 - Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theoretic developments as usual definitions of test data adequacy criteria ignore infinite paths. This paper develops a theory of program-based structural testing based on operational semantics. Reasoning at the program semantics level permits to cope with infinite paths (and non-feasible paths) when defining test data adequacy criteria. As a result, our criteria respect the first Weyuker’s property on finite applicability, even for non-terminating programs. We discuss the consequences of this re-interpretation of test data adequacy criteria w.r.t. existing test coverage criteria.

AB - Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theoretic developments as usual definitions of test data adequacy criteria ignore infinite paths. This paper develops a theory of program-based structural testing based on operational semantics. Reasoning at the program semantics level permits to cope with infinite paths (and non-feasible paths) when defining test data adequacy criteria. As a result, our criteria respect the first Weyuker’s property on finite applicability, even for non-terminating programs. We discuss the consequences of this re-interpretation of test data adequacy criteria w.r.t. existing test coverage criteria.

KW - Structural Software Testing

KW - Test Data Adequacy Criteria

M3 - Article in proceedings

SP - 160

EP - 165

BT - 33rd Annual IEEE International Computer Software and Applications Conference

PB - IEEE

ER -