Computer Engineering / Bilgisayar Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/10

Browse

Filters

2015 - 20172

Settings

Institution Author: search.filters.institutionAuthor.Ayav, TolgaWoS Q: search.filters.wosQuartile.Q4

Search Results

Now showing 1 - 2 of 2
  • Article
    Citation - WoS: 4
    Citation - Scopus: 8
    Prioritizing Mcdc Test Cases by Spectral Analysis of Boolean Functions
    (John Wiley and Sons Inc., 2017) Ayav, Tolga
    Test case prioritization aims at scheduling test cases in an order that improves some performance goal. One performance goal is a measure of how quickly faults are detected. Such prioritization can be performed by exploiting the Fault Exposing Potential (FEP) parameters associated to the test cases. FEP is usually approximated by mutation analysis under certain fault assumptions. Although this technique is effective, it could be relatively expensive compared to the other prioritization techniques. This study proposes a cost-effective FEP approximation for prioritizing Modified Condition Decision Coverage (MCDC) test cases. A strict negative correlation between the FEP of a MCDC test case and the influence value of the associated input condition allows to order the test cases easily without the need of an extensive mutation analysis. The method is entirely based on mathematics and it provides useful insight into how spectral analysis of Boolean functions can benefit software testing.
  • Article
    Citation - WoS: 3
    Citation - Scopus: 4
    Full-Exact Approach for Frequent Itemset Hiding
    (IGI Global Publishing, 2015) Ayav, Tolga; Ergenç, Belgin
    This paper proposes a novel, exact approach that relies on integer programming for association rule hiding. A large panorama of solutions exists for the complex problem of itemset hiding: from practical heuristic approaches to more accurate exact approaches. Exact approaches provide better solutions while suffering from the lack of performance and existing exact approaches still augment their methods with heuristics to make the problem solvable. In this case, the solution may not be optimum. This work present a full-exact method, without any need for heuristics. Extensive tests are conducted on 10 real datasets to analyze distance and information loss performances of the algorithm in comparison to a former similar algorithm. Since the approach provides the optimum solution to the problem, it should be considered as a reference method.