TY - GEN
T1 - Mining modal scenario-based specifications from execution traces of reactive systems
AU - Lo, David
AU - Maoz, Shahar
AU - Khoo, Siau Cheng
PY - 2007
Y1 - 2007
N2 - Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a novel method, framework, and tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harels Live Sequence Charts (LSC). LSC extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. The output of our algorithm is a sound and complete set of statistically significant LSCs (i.e., satisfying given thresholds of support and confidence), mined from an input execution trace. We locate statistically significant LSCs by exploring the search space of possible LSCs and checking for their statistical significance. In addition, we use an effective search space pruning strategy, specifically adapted to LSCs, which enables efficient mining of scenarios of arbitrary size. We demonstrate and evaluate the utility of our work in mining informative specifications using a case study on Jeti, a popular, full featured messaging application.
AB - Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a novel method, framework, and tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harels Live Sequence Charts (LSC). LSC extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. The output of our algorithm is a sound and complete set of statistically significant LSCs (i.e., satisfying given thresholds of support and confidence), mined from an input execution trace. We locate statistically significant LSCs by exploring the search space of possible LSCs and checking for their statistical significance. In addition, we use an effective search space pruning strategy, specifically adapted to LSCs, which enables efficient mining of scenarios of arbitrary size. We demonstrate and evaluate the utility of our work in mining informative specifications using a case study on Jeti, a popular, full featured messaging application.
KW - UML sequence diagrams
KW - dynamic analysis
KW - live sequence charts
KW - specification mining
UR - http://www.scopus.com/inward/record.url?scp=49949117821&partnerID=8YFLogxK
U2 - 10.1145/1321631.1321710
DO - 10.1145/1321631.1321710
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:49949117821
SN - 9781595938824
T3 - ASE'07 - 2007 ACM/IEEE International Conference on Automated Software Engineering
SP - 465
EP - 468
BT - ASE'07 - 2007 ACM/IEEE International Conference on Automated Software Engineering
T2 - 22nd IEEE/ACM International Conference on Automated Software Engineering, ASE'07
Y2 - 5 November 2007 through 9 November 2007
ER -