Unifying Theories of Programming
Unifying Theories of Programming
复制标题
统一编程理论
DOI：
10.1007/978-3-642-14521-6_4
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Cavalcanti A
中科院分区：
文献类型：
--
作者：
Cavalcanti A
CSP的失效发散与UTP模型有着密切的联系，但它们并不等价。例如，在失败-分歧模型中没有奇迹; UTP理论更丰富，可以用于为数据丰富的进程代数（如Circus）提供语义。在此之前，我们已经定义了计算CSP过程的故障发散模型的函数，其特征在于UTP关系。在本文中，我们使用这些函数来计算在测试中广泛使用的迹线细化和对比的UTP特征。此外，我们还证明了在Circus中，迹精化和构造的组合对应于过程的精化。这一结果是一个正式的测试技术的基础上onCircus;通常在测试中，我们限制自己的发散自由的过程。
There is a close relation between the failures-divergences and the UTP models of CSP, but they are not equivalent. For example, miracles are not available in the failures-divergences model; the UTP theory is richer and can be used to give semantics to data-rich process algebras likeCircus. Previously, we have defined functions that calculate the failures-divergences model of a CSP process characterised by a UTP relation. In this note, we use these functions to calculate the UTP characterisations of traces refinement and of theconfrelation that is widely used in testing. In addition, we prove that the combination of traces refinement andconfcorresponds to refinement of processes inCircus. This result is the basis for a formal testing technique based onCircus; as usual in testing, we restrict ourselves to divergence-free processes.
影响因子：
1.1
作者：
M. Felleisen;Robert Hieb
通讯作者：
Robert Hieb