Please use this identifier to cite or link to this item:
|Title:||TzuYu: Learning stateful typestates|
|Citation:||Xiao, H.,Sun, J.,Liu, Y.,Lin, S.-W.,Sun, C. (2013). TzuYu: Learning stateful typestates. 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings : 432-442. ScholarBank@NUS Repository. https://doi.org/10.1109/ASE.2013.6693101|
|Abstract:||Behavioral models are useful for various software engineering tasks. They are, however, often missing in practice. Thus, specification mining was proposed to tackle this problem. Existing work either focuses on learning simple behavioral models such as finite-state automata, or relies on techniques (e.g., symbolic execution) to infer finite-state machines equipped with data states, referred to as stateful typestates. The former is often inadequate as finite-state automata lack expressiveness in capturing behaviors of data-rich programs, whereas the latter is often not scalable. In this work, we propose a fully automated approach to learn stateful typestates by extending the classic active learning process to generate transition guards (i.e., propositions on data states). The proposed approach has been implemented in a tool called TzuYu and evaluated against a number of Java classes. The evaluation results show that TzuYu is capable of learning correct stateful typestates more efficiently. © 2013 IEEE.|
|Source Title:||2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 8, 2018
checked on Oct 26, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.