Change search
Refine search result
1 - 4 of 4
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Ahmed, Bestoun S.
    et al.
    Ist Dalle Molle Studi sullIntelligenza Artificial, CH-6928 Manno Lugano, Switzerland.;Czech Tech Univ, Fac Elect Engn, Dept Comp Sci, Karlovo Nam 13, Prague 12135 2, Czech Republic. CZE.
    Gambardella, Luca M.
    Ist Dalle Molle Studi sullIntelligenza Artificial, CH-6928 Manno Lugano, Switzerland. CHE.
    Afzal, Wasif
    Mlardalen Univ, Sch Innovat Design & Engn, Vasteras, Sweden..
    Zamli, Kamal Z.
    Univ Malaysia Pahang, Fac Comp Syst & Software Engn, Gambang, Malaysia. MYS.
    Handling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading2017In: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 86, p. 20-36Article in journal (Refereed)
    Abstract [en]

    Context: Combinatorial testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their interaction (or combination). In practice, the input configurations of software systems are subjected to constraints, especially in case of highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial interaction testing strategies nowadays, few of them support constraints. Objective: This paper presents a new strategy, to construct combinatorial interaction test suites in the presence of constraints. Method: The design and algorithms are provided in detail. To overcome the multi-judgement criteria for an optimal solution, the multi-objective particle swarm optimisation and multithreading are used. The strategy and its associated algorithms are evaluated extensively using different benchmarks and comparisons. Results: Our results are promising as the evaluation results showed the efficiency and performance of each algorithm in the strategy. The benchmarking results also showed that the strategy can generate constrained test suites efficiently as compared to state-of-the-art strategies. Conclusion: The proposed strategy can form a new way for constructing of constrained combinatorial interaction test suites. The strategy can form a new and effective base for future implementations. (C) 2017 Elsevier B.V. All rights reserved.

  • 2.
    Buckley, Jim
    et al.
    Ireland.
    Ali, Nour
    UK.
    English, Michael
    Ireland.
    Rosik, Jacek
    Ireland.
    Herold, Sebastian
    Lero - The Irish Software Research Centre, Ireland.
    Real-Time Reflexion Modelling in architecture reconciliation: A multi case study2015In: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 61, p. 107-123Article in journal (Refereed)
    Abstract [en]

    Reflexion Modelling is considered one of the more successful approaches to architecture reconciliation. Empirical studies strongly suggest that professional developers involved in real-life industrial projects find the information provided by variants of this approach useful and insightful, but the degree to which it resolves architecture conformance issues is still unclear.

    Objective

    This paper aims to assess the level of architecture conformance achieved by professional architects using Reflexion Modelling, and to determine how the approach could be extended to improve its suitability for this task.

  • 3.
    Bures, Miroslav
    et al.
    Czech Technical University, Czech Republic.
    Ahmed, Bestoun S.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). Czech Technical University, Czech Republic.
    Employment of multiple algorithms for optimal path-based test selection strategy2019In: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 114, p. 21-36Article in journal (Refereed)
    Abstract [en]

    Context

    Executing various sequences of system functions in a system under test represents one of the primary techniques in software testing. The natural method for creating effective, consistent and efficient test sequences is to model the system under test and employ an algorithm to generate tests that satisfy a defined test coverage criterion. Several criteria for preferred test set properties can be defined. In addition, to optimize the test set from an economic viewpoint, the priorities of the various parts of the system model under test must be defined.

    Objective

    Using this prioritization, the test cases exercise the high-priority parts of the system under test by more path combinations than those with low priority (this prioritization can be combined with the test coverage criterion that determines how many path combinations of the individual parts of the system are tested). Evidence from the literature and our observations confirm that finding a universal algorithm that produces a test set with preferred properties for all test coverage criteria is a challenging task. Moreover, for different individual problem instances, different algorithms provide results with the best value of a preferred property. In this paper, we present a portfolio-based strategy to perform the best test selection.

    Method

    The proposed strategy first employs a set of current algorithms to generate test sets; then, a preferred property of each test set is assessed in terms of the selected criterion, and finally, the test set with the best value of a preferred property is chosen.

    Results

    The experimental results confirm the validity and usefulness of this strategy. For individual instances of 50 system under test models, different algorithms provided results having the best preferred property value; these results varied by the required test coverage level, the size of the priority parts of the model, and the selected test set preferred property criteria.

    Conclusion

    In addition to the used algorithms, the proposed strategy can be used to assess the optimality of different path-based testing algorithms and choose a suitable algorithm for the testing.

  • 4.
    Frattini, Julian
    et al.
    Blekinge Tekniska Högskola.
    Fucci, Davide
    Blekinge Tekniska Högskola.
    Mendez, Daniel
    Blekinge Tekniska Högskola; fortiss GmbH, DEU.
    Spínola, Rodrigo
    Virginia Commonwealth University, USA; Salvador University, BRA.
    Mandić, Vladimir
    University of Novi Sad, SRB.
    Taušan, Nebojša
    University of Novi Sad, SRB.
    Ahmad, Muhammad Ovais
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Gonzalez-Huerta, Javier
    Blekinge Tekniska Högskola.
    An initial theory to understand and manage requirements engineering debt in practice2023In: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 159, article id 107201Article in journal (Refereed)
    Abstract [en]

    Context: Advances in technical debt research demonstrate the benefits of applying the financial debt metaphor to support decision-making in software development activities. Although decision-making during requirements engineering has significant consequences, the debt metaphor in requirements engineering is inadequately explored. Objective: We aim to conceptualize how the debt metaphor applies to requirements engineering by organizing concepts related to practitioners’ understanding and managing of requirements engineering debt (RED). Method: We conducted two in-depth expert interviews to identify key requirements engineering debt concepts and construct a survey instrument. We surveyed 69 practitioners worldwide regarding their perception of the concepts and developed an initial analytical theory. Results: We propose a RED theory that aligns key concepts from technical debt research but emphasizes the specific nature of requirements engineering. In particular, the theory consists of 23 falsifiable propositions derived from the literature, the interviews, and survey results. Conclusions: The concepts of requirements engineering debt are perceived to be similar to their technical debt counterpart. Nevertheless, measuring and tracking requirements engineering debt are immature in practice. Our proposed theory serves as the first guide toward further research in this area. 

    Download full text (pdf)
    fulltext
1 - 4 of 4
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf