Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/18975
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorMaibaum, Tom-
dc.contributor.advisorDiskin, Zinovy-
dc.contributor.authorSafilian, Aliakbar-
dc.date.accessioned2016-03-22T16:03:49Z-
dc.date.available2016-03-22T16:03:49Z-
dc.date.issued2016-
dc.identifier.urihttp://hdl.handle.net/11375/18975-
dc.description.abstractSoftware product line engineering is a common method for designing complex software systems. Feature modeling is the most common approach to specify product lines. A feature model is a feature diagram (a special tree of features) plus some crosscutting constraints. Feature modeling languages are grouped into basic and cardinality-based models. The common understanding of the semantics of feature models is a Boolean semantics. We discuss a major deficiency of this semantics and fix it by applying, in turn, modal logic, the theory of multisets, and formal language theory. In order to adequately represent the semantics of basic models, we propose a Kripke semantics and show that basic feature modeling needs a modal rather than Boolean logic. We propose two multiset based theories for cardinality-based feature diagrams, called flat and hierarchical semantics. We show that the hierarchical semantics of a given cardinality-based diagram captures all information in the diagram. We also charac- terize sets of multisets, which can provide a hierarchical semantics of some diagrams. We provide three different reduction processes going from a cardinality-based diagram to an appropriate regular expression. As for crosscutting constraints, we propose a formal language interpretation of them. We also characterize some existing analysis operations over feature models in terms of operations on the corresponding languages and discuss the relevant decidability problems.en_US
dc.language.isoenen_US
dc.subjectSoftware Product Linesen_US
dc.subjectFeature Modelingen_US
dc.subjectBasic Feature Modelsen_US
dc.subjectCardinality-Based Feature Modelsen_US
dc.subjectModal Logicen_US
dc.subjectMultiset Theoryen_US
dc.subjectFormal Languagesen_US
dc.subjectFaithful Semanticsen_US
dc.titleBEHAVIOURAL FOUNDATIONS OF FEATURE MODELINGen_US
dc.typeThesisen_US
dc.contributor.departmentComputing and Softwareen_US
dc.description.degreetypeThesisen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
safilian_Aliakbar_finalsubmission201603_PhD.pdf
Open Access
PhD Thesis2.82 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue