<![CDATA[ IEEE Transactions on Software Engineering - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 32 2017November 23<![CDATA[Language Inclusion Checking of Timed Automata with Non-Zenoness]]>$mathcal P$ modeling an implementation and a timed automaton $mathcal S$ as a specification, the problem of language inclusion checking is to decide whether the language of $mathcal P$ is a subset of that of $mathcal S$. It is known to be undecidable. The problem gets more complicated if non-Zenoness is taken into consideration. A run is Zeno if it permits infinitely many actions within finite time. Otherwise it is non-Zeno. Zeno runs might present in both $mathcal P$ and $mathcal S$. It is necessary to check whether a run is Zeno or not so as to avoid presenting Zeno runs as counterexamples of language inclusion checking. In this work, we propose a zone-based semi-algorithm for language inclusion checking with non-Zenoness. It is further improved with simulation reduction based on LU-simulation. Though our approach is not guaranteed to terminate, we show that it does in many cases through empirical study. Our approach has been incorporated into the PAT model checker, and applied to multiple systems to show its usefulness.]]>431199510081028<![CDATA[Model Transformation Modularization as a Many-Objective Optimization Problem]]>4311100910322301<![CDATA[Testing from Partial Finite State Machines without Harmonised Traces]]>${mathcal S}$. Two notions of correctness (quasi-reduction and quasi-equivalence) have previously been defined for partial FSMs but these, and the corresponding test generation techniques, only apply to FSMs that have harmonised traces. We show how quasi-reduction and quasi-equivalence can be generalised to all partial FSMs. We also consider the problem of generating an $m$-complete test suite from a partial FSM ${mathcal S}$: a test suite that is guaranteed to determine correctness as long as the system under test has no more than $m$ states. We prove that we can complete ${mathcal S}$ to form a completely-specified non-deterministic FSM ${mathcal S}^{prime}$ such that any $m$-complete test suite generated from ${mathcal S}^{prim-
}$ can be converted into an $m$-complete test suite for ${mathcal S}$. We also show that there is a correspondence between test suites that are reduced for ${mathcal S}$ and ${mathcal S}^{prime}$ and also that are minimal for ${mathcal S}$ and ${mathcal S}^{prime}$.]]>431110331043365<![CDATA[Using Natural Language Processing to Automatically Detect Self-Admitted Technical Debt]]>431110441062657<![CDATA[When and Why Your Code Starts to Smell Bad (and Whether the Smells Go Away)]]>when and why bad smells are introduced, what is their survivability, and how they are removed by developers. To empirically corroborate such anecdotal evidence, we conducted a large empirical study over the change history of 200 open source projects. This study required the development of a strategy to identify smell-introducing commits, the mining of over half a million of commits, and the manual analysis and classification of over 10K of them. Our findings mostly contradict common wisdom, showing that most of the smell instances are introduced when an artifact is created and not as a result of its evolution. At the same time, 80 percent of smells survive in the system. Also, among the 20 percent of removed instances, only 9 percent are removed as a direct consequence of refactoring operations.]]>4311106310882238<![CDATA[Clarifications on the Construction and Use of the ManyBugs Benchmark]]>431110891090205<![CDATA[Comments on ScottKnottESD in Response to “An Empirical Comparison of Model Validation Techniques for Defect Prediction Models”]]>431110911094203