Testing and proving distributed algorithms in constructive type theory

被引:0
|
作者
Haiyan, Qiao [1 ]
机构
[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Peoples R China
来源
TESTS AND PROOFS | 2007年 / 4454卷
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We report our experiences to verify distributed algorithms in constructive type theory by testing and proving. Properties can be tested to eliminate bugs before proving, thus saving expensive proof effort. Both deadlock property and liveness property are proven after testing. The verified algorithm can be executed in Cayenne, a functional programming language with dependent types.
引用
收藏
页码:79 / 94
页数:16
相关论文
共 50 条