Alex Dekhtyar, Jane Huffman Hayes
This paper summarizes our experience with using Knowledge Discovery in Data (KDD) methodology for automated requirements tracing, and discusses our insights.
Jane Huffman Hayes, Jared Payne, Alex Dekhtyar
This paper presents the REquirements TRacing On target (RETRO).NET dataset. The dataset includes the requirement specification, the source code files (C# and Visual Basic), the gold standard/answer set for tracing the artifacts to each other, as well as the script used to parse the requirements from the specification (to put in RETRO.NET format). The dataset can be used to support tracing and other tasks.
Michael I. Dekhtyar, Alex Dekhtyar, V. S. Subrahmanian
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the program. In this paper, we classify HPPs into three classes called HPP_1,HPP_2 and HPP_r,r>= 3. For these classes, we provide three types of results for HPPs. First, we develop algorithms to compute the set of all ground consequences of an HPP. Then we provide algorithms and complexity results for the problems of entailment ("Given an HPP P and a query Q as input, is Q a logical consequence of P?") and consistency ("Given an HPP P as input, is P consistent?"). Our results provide a fine characterization of when polynomial algorithms exist for the above problems, and when these problems become intractable.