IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Mining Past-Time Temporal Rules: A Dynamic Analysis Approach

Mining Past-Time Temporal Rules: A Dynamic Analysis Approach
View Sample PDF
Author(s): David Lo (Singapore Management University, Singapore), Siau-Cheng Khoo (National University of Singapore, Singapore)and Chao Liu (Microsoft Research - Redmond, USA)
Copyright: 2010
Pages: 19
Source title: Artificial Intelligence Applications for Improved Software Engineering Development: New Prospects
Source Author(s)/Editor(s): Farid Meziane (University of Salford, UK)and Sunil Vadera (University of Salford, UK)
DOI: 10.4018/978-1-60566-758-4.ch013

Purchase

View Mining Past-Time Temporal Rules: A Dynamic Analysis Approach on the publisher's website for pricing and purchasing information.

Abstract

Specification mining is a process of extracting specifications, often from program execution traces. These specifications can in turn be used to aid program understanding, monitoring and verification. There are a number of dynamic-analysis-based specification mining tools in the literature, however none so far extract past time temporal expressions in the form of rules stating: “whenever a series of events occur, previously another series of events happened before”. Rules of this format are commonly found in practice and useful for various purposes. Most rule-based specification mining tools only mine future-time temporal expression. Many past-time temporal rules like “whenever a resource is used, it was allocated before” are asymmetric as the other direction does not holds. Hence, there is a need to mine past-time temporal rules. In this chapter, the authors describe an approach to mine significant rules of the above format occurring above a certain statistical thresholds from program execution traces. The approach start from a set of traces, each being a sequence of events (i.e., method invocations) and resulting in a set of significant rules obeying minimum thresholds of support and confidence. A rule compaction mechanism is employed to reduce the number of reported rules significantly. Experiments on traces of JBoss Application Server and Jeti instant messaging application shows the utility of our approach in inferring interesting past-time temporal rules.

Related Content

Mohammed Adi Al Battashi, Mohamad A. M. Adnan, Asyraf Isyraqi Bin Jamil, Majid Adi Al-Battashi. © 2026. 30 pages.
Potchong M. Jackaria, Al-adzran G. Sali, Hana An L. Alvarado, Rashidin H. Moh. Jiripa, Al-sabrie Y. Sahijuan. © 2026. 26 pages.
Elizabeth Gross. © 2026. 30 pages.
Siti Nazleen Abdul Rabu, Xie Fengli, Ng Man Yi. © 2026. 44 pages.
Mohammed Abdul Wajeed. © 2026. 30 pages.
Aldammien A. Sukarno, Al-adzkhan N. Abdulbarie, Wati Sheena M. Bulkia, Potchong M. Jackaria. © 2026. 24 pages.
Abdulla Sultan Binhareb Almheiri, Humaid Albastaki, Hanadi Alrashdan. © 2026. 26 pages.
Body Bottom