ACM Home Page
Please provide us with feedback. Feedback
Specification mining of symbolic scenario-based models
Full text PdfPdf (391 KB)
Source Workshop on Program Analysis for Software Tools and Engineering archive
Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering table of contents
Atlanta, Georgia
SESSION: Reverse engineering table of contents
Pages 29-35  
Year of Publication: 2008
ISBN:978-1-60558-382-2
Authors
David Lo  Singapore Management University
Shahar Maoz  The Weizmann Institute of Science, Rehovot, Israel
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 61,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1512475.1512482
What is a DOI?

ABSTRACT

Many dynamic analysis approaches to specification mining, which extract behavioral models from execution traces, do not consider object identities. This limits their power when used to analyze traces of general object oriented programs. In this work we present a novel specification mining approach that considers object identities, and, moreover, generalizes from specifications involving concrete objects to their symbolic class-level abstractions. Our approach uses data mining methods to extract significant scenario-based specifications in the form of Damm and Harel's live sequence charts (LSC), a formal and expressive extension of classic sequence diagrams. We guarantee that all mined symbolic LSCs are significant (statistically sound) and all significant symbolic LSCs are mined (statistically complete). The technique can potentially be applied to general object oriented programs to reveal expressive and useful reverse-engineered candidate specifications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Eclipse Test and Performance Tools Platform. http://www.eclipse.org/tptp/.
2
3
 
4
5
 
6
7
 
8
9
10
 
11
 
12
 
13
D. Harel and S. Maoz. Assert and Negate Revisited: Modal Semantics for UML Sequence Diagrams. Software and Systems Modeling, 7(2):237--252, 2008.
 
14
 
15
Ø. Haugen, K. E. Husa, R. K. Runde, and K. Stølen. STAIRS towards Formal Design with Sequence Diagrams. Software and Systems Modeling (SoSyM), 4(4):355--367, 2005.
 
16
J. Klose, T. Toben, B. Westphal, and H. Wittke. Check it out: On the efficient formal verification of Live Sequence Charts. In CAV, 2006.
 
17
H. Kugler, D. Harel, A. Pnueli, Y. Lu, and Y. Bontemps. Temporal Logic for Scenario-Based Specifications. In TACAS, 2005.
 
18
 
19
20
21
 
22
D. Lo, S.-C. Khoo, and C. Liu. Efficient mining of recurrent rules from a sequence database. In Proc. of Int. Conf. on Database Systems for Advanced Applications, 2008.
 
23
D. Lo and S. Maoz. Mining Scenario-Based Triggers and Effects. In ASE, 2008.
 
24
D. Lo and S. Maoz. Specification mining of symbolic scenario-based models (tech. report. version). Technical Report at www.comp.nus.edu.sg/~dlo/symbolicmining.pdf, 2008.
25
26
27
28
 
29
 
30
31
 
32
 
33
 
34
 
35
W. Weimer and G. Necula. Mining temporal specifications for error detection. In TACAS, 2005.
 
36
X. Yan, J. Han, and R. Afhar. CloSpan: Mining closed sequential patterns in large datasets. In Proc. of SIAM Int. Conf. on Data Mining, 2003.
37