Predicate diagrams for the verification of reactive systems

被引:0
|
作者
Cansell, D [1 ]
Méry, D
Merz, S
机构
[1] Univ Metz, Metz, France
[2] Univ Henri Poincare, Vandoeuvre Les Nancy, France
[3] Univ Munich, Inst Informat, D-8000 Munich, Germany
来源
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We define a class of diagrams that represent abstractions of-possibly infinite-state-reactive systems described by specifications written in temporal logic. Our diagrams are intended as the basis for the verification of both safety and liveness properties of such systems. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking can be used to verify properties over finite-state abstractions. We describe the use of abstract interpretation techniques to generate proof diagrams from a given specification and user-defined predicates that represent sets of states.
引用
收藏
页码:380 / 397
页数:18
相关论文
共 50 条