期刊
ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY
卷 22, 期 2, 页码 -出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2430545.2430549
关键词
Documentation; Algorithms; Measurement; Labeled transition systems; accuracy; comparison
资金
- ESPRC REGI grant [EP/F065825/1]
- EPSRC STAMINA grant [EP/H002456/2]
- EPSRC [EP/F065825/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/F065825/1] Funding Source: researchfish
State machines capture the sequential behavior of software systems. Their intuitive visual notation, along with a range of powerful verification and testing techniques render them an important part of the model-driven software engineering process. There are several situations that require the ability to identify and quantify the differences between two state machines (e. g. to evaluate the accuracy of state machine inference techniques is measured by the similarity of a reverse-engineered model to its reference model). State machines can be compared from two complementary perspectives: (1) In terms of their language - the externally observable sequences of events that are permitted or not, and (2) in terms of their structure - the actual states and transitions that govern the behavior. This article describes two techniques to compare models in terms of these two perspectives. It shows how the difference can be quantified and measured by adapting existing binary classification performance measures for the purpose. The approaches have been implemented by the authors, and the implementation is openly available. Feasibility is demonstrated via a case study to compare two real state machine inference approaches. Scalability and accuracy are assessed experimentally with respect to a large collection of randomly synthesized models.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据