ACM Home Page
Please provide us with feedback. Feedback
Mining scenario-based specifications with value-based invariants
Full text PdfPdf (307 KB)
Source
Conference on Object Oriented Programming Systems Languages and Applications archive
Proceeding of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications table of contents
Orlando, Florida, USA
POSTER SESSION: Posters & student research competition table of contents
Pages 755-756  
Year of Publication: 2009
ISBN:978-1-60558-768-4
Authors
David Lo  School of Information Systems, Singapore Management University, Singapore, Singapore
Shahar Maoz  The Weizmann Institute of Science, Rehovot, Israel
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

abstract   references   index terms  

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

ABSTRACT

There have been a number of studies on mining candidate specifications from execution traces. Some extract specifications corresponding to value-based invariants, while others work on inferring ordering constraints. In this work, we merge our previous work on mining scenario-based specifications, extracting ordering constraints in the form of live sequence charts (LSC), a visual specification language, with Daikon, a tool for mining value-based invariants. The resulting approach strengthens the expressive power of the mined scenarios by enriching them with scenario-specific value-based invariants. The concept is illustrated using a preliminary case study on a real application.


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
CrossFTPServer. sourceforge.net/projects/crossftpserver/.
 
2
W. Damm and D. Harel. LSCs: Breathing Life into Message Sequence Charts. J. on Formal Methods in System Design, 19(1):45--80, 2001.
 
3
M. Ernst, J. Cockrell, W. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. TSE, 27(2):99--123, 2001.
 
4
D. Harel and S. Maoz. Assert and Negate Revisited: Modal Semantics for UML Sequence Diagrams. Software and Systems Modeling, 7(2):237--252, 2008.
 
5
D. Lo and S. Maoz. Mining Symbolic Scenario-Based Specifications. In PASTE, 2008.
 
6
D. Lo, S. Maoz, and S.-C. Khoo. Mining Modal Scenario-Based Specifications from Execution Traces of Reactive Systems. In ASE'07, 2007.
 
7
D. Lorenzoli, L. Mariani, and M. Pezzè. Automatic Generation of Software Behavioral Models. In ICSE, 2008.
 
8
S. Maoz and D. Harel. From Multi-Modal Scenarios to Code: Compiling LSCs into AspectJ. In FSE, 2006.