在DSLTrans模型转换中通过结合符号执行和基于频谱的分析来定位故障
Bentley James Oakes1,2, Javier Troya3, Jessie Galasso1,4
1DIRO, Université de Montréal, Montréal, Canada.
概括
本研究引入了一种新的故障定位方法,用于使用符号执行和基于频谱的分析进行模型转换. 它有效地识别出有缺陷的规则,而不需要测试案例,提高基于模型的工程质量.
科学领域:
- 软件工程 软件工程 软件工程
- 模型驱动工程是指模型驱动的工程.
- 正式方法 正式方法
背景情况:
- 模型转换验证对于强大的模型驱动工程和自动化质量保证至关重要.
- 现有的合同检查方法可以有效地检测财产违规行为,但难以准确地定位故障.
- 目前的故障定位技术需要繁的测试案例创建和维护.
研究的目的:
- 开发一种故障定位方法,用于识别DSLTrans模型转换中的故障规则.
- 将符号执行与基于频谱的故障定位相结合,消除了对测试输入模型的需求.
- 评估这种综合方法的有效性,以改善模型转换验证.
主要方法:
- 使用符号执行来验证模型转换和评估合同满意度.
- 利用符号执行的路径条件输出用于故障本地化.
- 应用基于频谱的分析技术来追踪和排名有缺陷的转换规则.
主要成果:
- 最好的基于频谱的分析技术平均EXAM分数低于0.30,表明本地化效率高.
- 该方法在70%的评估案例中成功地将错误的规则定位在排名前三的规则中.
- 分析涵盖了转换复杂性,突变类型和合同类型对本地化准确性的影响.
结论:
- 将符号执行与基于频谱的故障定位相结合,为识别有缺陷的模型转换规则提供了一种有效的,无测试案例的方法.
- 拟议的技术大大减少了调试模型转换所需的精力.
- 为了更广泛的适用性,建议进一步调查限制和潜在的预先检查.
相关概念视频
Translesion DNA Polymerases
9.9K
Translesion (TLS) polymerases rescue stalled DNA polymerases at sites of damaged bases by replacing the replicative polymerase and installing a nucleotide across the damaged site. Doing so, TLS allows additional time for the cell to repair the damage before resuming regular DNA replication.
TLS polymerases are found in all three domains of life - archaea, bacteria, and eukaryotes. Of the different classes of TLS polymerases, members of the Y family are fitted with specialized structures that...
TLS polymerases are found in all three domains of life - archaea, bacteria, and eukaryotes. Of the different classes of TLS polymerases, members of the Y family are fitted with specialized structures that...
9.9K
Block Diagram Reduction
194
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
194
Signal Flow Graphs
206
Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
206
SFG Algebra
115
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
115
State Space to Transfer Function
196
The conversion of state-space representation to a transfer function is a fundamental process in system analysis. It provides a method for transitioning from a time-domain description to a frequency-domain representation, which is crucial for simplifying the analysis and design of control systems.
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
196
Linear Approximation in Time Domain
81
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
81


