A Formal Analysis of Requirements-Based Testing

Pecheur, Charles;Raimondi, Franco;Brat, Guillaume
(2009) ISSTA 2009 : Proceedings of the Eighteenth International Symposium on Software Testing and Analysis — Location: Chicago, IL, USA (19.July.2009)

Files

issta31-pecheur.pdf
  • Restricted Access
  • Adobe PDF
  • 237.84 KB
Request a copy

Details

Authors
  • Pecheur, Charlesorcid-logoUCLouvain
    Author
  • Raimondi, FrancoUniversity College London
    Author
  • Brat, GuillaumeNASA Ames, Mountain View, USA
    Author
Abstract
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for the generation of test cases from requirements by revising and extending the results presented in previous works (e.g. [21, 20, 13]). We give a syntactic characterisation of our method, defined inductively over the syntax of LTL formulae, and prove that this characterisation is sound and complete, given some restrictions on the formulae that can be used to encode requirements. We provide various examples to show the applicability of our approach.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Pecheur, C., Raimondi, F., & Brat, G. (2009). A Formal Analysis of Requirements-Based Testing. Proceedings of the eighteenth international symposium on Software testing and analysis, 1-9. https://hdl.handle.net/2078.5/230418