Modelling Variability in the Leader Algorithm Family: A Testable Model and Implementation

Download
  1. (PDF, 576 KB)
DOIResolve DOI: http://doi.org/10.4224/5763719
AuthorSearch for:
TypeTechnical Report
AbstractThis final project report is a <em>Type I</em>: Modelling variability into a testable model project. The main themes of the course revolve around the concepts of <em>variability</em> (in this project variability is associated with the variation of an algorithm in time i.e. evolutionary variability and with variability in definitions of concepts), <em>traceability</em> and <em>verification</em>. Hence these concepts form the core focus of this project, with more emphasis being placed on the creation of a traceable, testable domain model. In particular, two questions posed during the offering of this course are: i) “Can tests be used to document how family members are different?", and ii) “How can features and their dependencies be properly documented?"
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number47429
NPARC number5763719
Export citationExport as RIS
Report a correctionReport a correction
Record identifier3bae5e69-bd07-4f3e-8898-366508ad07ba
Record created2009-03-29
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)