
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-4.xsd">
    
    <titleInfo>
        <title>Constructing Subtle Concurrency Bugs Using Synchronization-Centric
Second-Order Mutation Operators</title>
    </titleInfo>
    <name type="personal" ID="llw2107">
        <namePart type="family">Wu</namePart>
        <namePart type="given">Leon Li</namePart>
        <role>
            <roleTerm type="text">author</roleTerm>
        </role>
        <affiliation>Columbia University. Computer Science</affiliation>
        <affiliation>Columbia University. Center for Computational Learning Systems</affiliation>
    </name>
    <name type="personal" ID="gek1">
        <namePart type="family">Kaiser</namePart>
        <namePart type="given">Gail E.</namePart>
        <role>
            <roleTerm type="text">author</roleTerm>
        </role>
        <affiliation>Columbia University. Computer Science</affiliation>
    </name>
    <name type="corporate">
        <namePart>Columbia University. Computer Science</namePart>
        <role>
            <roleTerm type="text">originator</roleTerm>
        </role>
        <role>
            <roleTerm type="text">contributor</roleTerm>
        </role>
    </name>
    <typeOfResource>text</typeOfResource>
    <genre>Technical reports</genre>
    
    <originInfo>
        <place>
            <placeTerm type="text">New York</placeTerm>
        </place>
        <publisher>Department of Computer Science, Columbia University</publisher>
        <dateIssued encoding="w3cdtf" keyDate="yes">2011</dateIssued>
    </originInfo>
    <abstract>Mutation testing applies mutation operators to modify program source code or byte code in small ways, and then runs these modified programs (i.e., mutants) against a test suite in order to evaluate the quality of the test suite. In this paper, we first describe a general fault model for con- current programs and some limitations of previously developed sets of first-order concurrency mutation operators. We then present our new mutation testing approach, which employs synchronization-centric second-order mutation operators that are able to generate subtle concurrency bugs not represented by the first-order mutation. These operators are used in addition to the synchronization-centric first-order mutation operators to form a small set of effective concurrency mutation operators for mutant generation. Our empirical study shows that our set of operators is effective in mutant generation with limited cost and demonstrates that this new approach is easy to implement.</abstract>
    <subject>
        <topic>Computer science</topic>
    </subject>
    <relatedItem type="series" ID="r.1">
        <titleInfo>
            <title>Columbia University Computer Science Technical Reports</title>
            <partNumber>CUCS-023-11</partNumber>
        </titleInfo>
    </relatedItem>
    <identifier type="hdl">http://hdl.handle.net/10022/AC:P:13131</identifier>

    <language>
        <languageTerm type="text">English</languageTerm>
    </language>
    
    <location>
        <physicalLocation authority="marcorg">NNC</physicalLocation>
    </location>
    
    <recordInfo>
        <recordContentSource authority="marcorg">NNC</recordContentSource>
        <recordCreationDate encoding="w3cdtf">2012-05-03 16:18:36 -0400</recordCreationDate>
        <recordChangeDate encoding="w3cdtf">2012-05-03 16:23:04 -0400</recordChangeDate>
        <recordIdentifier>7134</recordIdentifier>
        <languageOfCataloging>
            <languageTerm authority="iso639-2b">eng</languageTerm>
        </languageOfCataloging>
    </recordInfo>
    
</mods>
