<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Software Engineering, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 32 </description>
		<year>2013</year>
		<month>May      </month>
		<day>21</day>
		<item>
			<title><![CDATA[Editorial [new associate editors]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6509892]]></link>
			<description><![CDATA[It is the Editor-in-Chief's (EiC's) pleasure to welcome a number of new associate editors to the editorial board of the IEEE Transactions on Software Engineering. They are: Luciano Baresi, Daniela Damian, Robert DeLine, Audris Mockus, Gail Murphy, Mauro Pezze, Gian Pietro Pico, Helen Sharp, and Paolo Tonella. They bring a wealth of expertise in a broad range of research areas within software engineering, consolidating traditional strengths in areas such as software testing, and strengthening areas such as empirical studies of software development, mobile computing, and adaptive systems. Short professional biographies are included. At the same time, the EiC would like to bid farewell to those associate editors whose terms of service have ended: Martin Robillard, Peggy Storey, and Tetsuo Tamai. He thanks them for their distinguished contributions over a number of years, and for continuing to handle submitted manuscripts already on their editorial stack.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6509892]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>588</startPage>
			<endPage>590</endPage>
			<fileSize>198</fileSize>
			<authors><![CDATA[Nuseibeh, B.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Decentralized Self-Adaptation Mechanism for Service-Based Applications in the Cloud]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6249687]]></link>
			<description><![CDATA[Cloud computing, with its promise of (almost) unlimited computation, storage, and bandwidth, is increasingly becoming the infrastructure of choice for many organizations. As cloud offerings mature, service-based applications need to dynamically recompose themselves to self-adapt to changing QoS requirements. In this paper, we present a decentralized mechanism for such self-adaptation, using market-based heuristics. We use a continuous double-auction to allow applications to decide which services to choose, among the many on offer. We view an application as a multi-agent system and the cloud as a marketplace where many such applications self-adapt. We show through a simulation study that our mechanism is effective for the individual application as well as from the collective perspective of all applications adapting at the same time.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6249687]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>591</startPage>
			<endPage>612</endPage>
			<fileSize>4157</fileSize>
			<authors><![CDATA[Nallur, Vivek;Bahsoon, Rami;]]></authors>
		</item>
		<item>
			<title><![CDATA[Automated API Property Inference Techniques]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6311409]]></link>
			<description><![CDATA[Frameworks and libraries offer reusable and customizable functionality through Application Programming Interfaces (APIs). Correctly using large and sophisticated APIs can represent a challenge due to hidden assumptions and requirements. Numerous approaches have been developed to infer properties of APIs, intended to guide their use by developers. With each approach come new definitions of API properties, new techniques for inferring these properties, and new ways to assess their correctness and usefulness. This paper provides a comprehensive survey of over a decade of research on automated property inference for APIs. Our survey provides a synthesis of this complex technical field along different dimensions of analysis: properties inferred, mining techniques, and empirical results. In particular, we derive a classification and organization of over 60 techniques into five different categories based on the type of API property inferred: unordered usage patterns, sequential usage patterns, behavioral specifications, migration mappings, and general information.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6311409]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>613</startPage>
			<endPage>637</endPage>
			<fileSize>1687</fileSize>
			<authors><![CDATA[Robillard, Martin P.;Bodden, Eric;Kawrykow, David;Mezini, Mira;Ratchford, Tristan;]]></authors>
		</item>
		<item>
			<title><![CDATA[Compositional Verification for Hierarchical Scheduling of Real-Time Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6264049]]></link>
			<description><![CDATA[Hierarchical Scheduling (HS) techniques achieve resource partitioning among a set of real-time applications, providing reduction of complexity, confinement of failure modes, and temporal isolation among system applications. This facilitates compositional analysis for architectural verification and plays a crucial role in all industrial areas where high-performance microprocessors allow growing integration of multiple applications on a single platform. We propose a compositional approach to formal specification and schedulability analysis of real-time applications running under a Time Division Multiplexing (TDM) global scheduler and preemptive Fixed Priority (FP) local schedulers, according to the ARINC-653 standard. As a characterizing trait, each application is made of periodic, sporadic, and jittering tasks with offsets, jitters, and nondeterministic execution times, encompassing intra-application synchronizations through semaphores and mailboxes and interapplication communications among periodic tasks through message passing. The approach leverages the assumption of a TDM partitioning to enable compositional design and analysis based on the model of preemptive Time Petri Nets (pTPNs), which is expressly extended with a concept of Required Interface (RI) that specifies the embedding environment of an application through sequencing and timing constraints. This enables exact verification of intra-application constraints and approximate but safe verification of interapplication constraints. Experimentation illustrates results and validates their applicability on two challenging workloads in the field of safety-critical avionic systems.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6264049]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>638</startPage>
			<endPage>657</endPage>
			<fileSize>2537</fileSize>
			<authors><![CDATA[Carnevali, Laura;Pinzuti, Alessandro;Vicario, Enrico;]]></authors>
		</item>
		<item>
			<title><![CDATA[Software Architecture Optimization Methods: A Systematic Literature Review]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6311410]]></link>
			<description><![CDATA[Due to significant industrial demands toward software systems with increasing complexity and challenging quality requirements, software architecture design has become an important development activity and the research domain is rapidly evolving. In the last decades, software architecture optimization methods, which aim to automate the search for an optimal architecture design with respect to a (set of) quality attribute(s), have proliferated. However, the reported results are fragmented over different research communities, multiple system domains, and multiple quality attributes. To integrate the existing research results, we have performed a systematic literature review and analyzed the results of 188 research papers from the different research communities. Based on this survey, a taxonomy has been created which is used to classify the existing research. Furthermore, the systematic analysis of the research literature provided in this review aims to help the research community in consolidating the existing research efforts and deriving a research agenda for future developments.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6311410]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>658</startPage>
			<endPage>683</endPage>
			<fileSize>7601</fileSize>
			<authors><![CDATA[Aleti, Aldeida;Buhnova, Barbora;Grunske, Lars;Koziolek, Anne;Meedeniya, Indika;]]></authors>
		</item>
		<item>
			<title><![CDATA[Test Case-Aware Combinatorial Interaction Testing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6311411]]></link>
			<description><![CDATA[The configuration spaces of modern software systems are too large to test exhaustively. Combinatorial interaction testing (CIT) approaches, such as covering arrays, systematically sample the configuration space and test only the selected configurations by using a battery of test cases. Traditional covering arrays, while taking system-wide interoption constraints into account, do not provide a systematic way of handling test case-specific interoption constraints. The basic justification for $(t)$-way covering arrays is that they can cost effectively exercise all system behaviors caused by the settings of $(t)$ or fewer options. In this paper, we hypothesize, however, that in the presence of test case-specific interoption constraints, many such behaviors may not be tested due to masking effects caused by the overlooked test case-specific constraints. For example, if a test case refuses to run in a configuration due to an unsatisfied test case-specific constraint, none of the valid option setting combinations appearing in the configuration will be tested by that test case. To account for test case-specific constraints, we introduce a new combinatorial object, called a test case-aware covering array. A $(t)$-way test case-aware covering array is not just a set of configurations, as is the case in traditional covering arrays, but a set of configurations, each of which is associated with a set of test cases such that all test case-specific constraints are satisfied and that, for each test case, each valid combination of option settings for every combination of $(t)$ options appears at least once in the set of configurations that the test case is associated with. We furthermore present three algorithms to compute test case-aware covering arrays. Two of the algorithms aim to minimize the number of configurations required (one is fast, but produces larger arrays, the other is slower, but produces smaller arrays), whereas the remaining algorithm aims to minimize the number o-
 test runs required. The results of our empirical studies conducted on two widely used highly configurable software systems suggest that test case-specific constraints do exist in practice, that traditional covering arrays suffer from masking effects caused by ignorance of such constraints, and that test case-aware covering arrays are better than other approaches in handling test case-specific constraints, thus avoiding masking effects.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6311411]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>684</startPage>
			<endPage>706</endPage>
			<fileSize>3604</fileSize>
			<authors><![CDATA[Yilmaz, Cemal;]]></authors>
		</item>
		<item>
			<title><![CDATA[The Role of the Tester's Knowledge in Exploratory Software Testing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6298893]]></link>
			<description><![CDATA[We present a field study on how testers use knowledge while performing exploratory software testing (ET) in industrial settings. We video recorded 12 testing sessions in four industrial organizations, having our subjects think aloud while performing their usual functional testing work. Using applied grounded theory, we analyzed how the subjects performed tests and what type of knowledge they utilized. We discuss how testers recognize failures based on their personal knowledge without detailed test case descriptions. The knowledge is classified under the categories of domain knowledge, system knowledge, and general software engineering knowledge. We found that testers applied their knowledge either as a test oracle to determine whether a result was correct or not, or for test design, to guide them in selecting objects for test and designing tests. Interestingly, a large number of failures, windfall failures, were found outside the actual focus areas of testing as a result of exploratory investigation. We conclude that the way exploratory testers apply their knowledge for test design and failure recognition differs clearly from the test-case-based paradigm and is one of the explanatory factors of the effectiveness of the exploratory testing approach.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6298893]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>707</startPage>
			<endPage>724</endPage>
			<fileSize>1389</fileSize>
			<authors><![CDATA[Itkonen, Juha;M&#x00E4;ntyl&#x00E4;, Mika V.;Lassenius, Casper;]]></authors>
		</item>
		<item>
			<title><![CDATA[Trustrace: Mining Software Repositories to Improve the Accuracy of Requirement Traceability Links]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6341764]]></link>
			<description><![CDATA[Traceability is the only means to ensure that the source code of a system is consistent with its requirements and that all and only the specified requirements have been implemented by developers. During software maintenance and evolution, requirement traceability links become obsolete because developers do not/cannot devote effort to updating them. Yet, recovering these traceability links later is a daunting and costly task for developers. Consequently, the literature has proposed methods, techniques, and tools to recover these traceability links semi-automatically or automatically. Among the proposed techniques, the literature showed that information retrieval (IR) techniques can automatically recover traceability links between free-text requirements and source code. However, IR techniques lack accuracy (precision and recall). In this paper, we show that mining software repositories and combining mined results with IR techniques can improve the accuracy (precision and recall) of IR techniques and we propose Trustrace, a trust--based traceability recovery approach. We apply Trustrace on four medium-size open-source systems to compare the accuracy of its traceability links with those recovered using state-of-the-art IR techniques from the literature, based on the Vector Space Model and Jensen-Shannon model. The results of Trustrace are up to 22.7 percent more precise and have 7.66 percent better recall values than those of the other techniques, on average. We thus show that mining software repositories and combining the mined data with existing results from IR techniques improves the precision and recall of requirement traceability links.]]></description>
			<pubDate><![CDATA[May  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6341764]]></guid>
			<volume>39</volume>
			<issue>5</issue>
			<startPage>725</startPage>
			<endPage>741</endPage>
			<fileSize>1197</fileSize>
			<authors><![CDATA[Ali, Nasir;Gu&#x00E9;h&#x00E9;neuc, Yann-Ga&#x00EB;l;Antoniol, Giuliano;]]></authors>
		</item>
	</channel>
</rss>