Generating counterexamples for multi-valued model-checking

被引:0
作者
Gurfinkel, A [1 ]
Chechik, M [1 ]
机构
[1] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3G4, Canada
来源
FME 2003: FORMAL METHODS, PROCEEDINGS | 2003年 / 2805卷
关键词
model-checking; De Morgan algebras; counterexamples; witnesses; CTL;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model-checking, introduced in [4] is an extension of classical model-checking. Instead of classical logic, it operates on elements of a given De Morgan algebra, e.g. the Kleene algebra [14]. Multi-valued model-checking has been used in a number of applications, primarily when reasoning about partial [2] and inconsistent [10] systems. In this paper we show how to generate counterexamples for multi-valued model-checking. We describe the proof system for a multi-valued variant of CTL, discuss how to use it to generate counterexamples. The techniques presented in this paper have been implemented as part of our symbolic multi-valued model-checker chiChek [3].
引用
收藏
页码:503 / 521
页数:19
相关论文
共 21 条
[1]  
[Anonymous], 1952, INTRO MATH
[2]  
BELNAP N, 1977, MODERN USES MULTIPLE, P30
[3]   Temporal logic query checking [J].
Bruns, G ;
Godefroid, P .
16TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2001, :409-417
[4]  
CHECHIK M, 2003, UNPUB EXPLORING COUN
[5]  
CHECHIK M, 2003, P 15 INT C COMP AID
[6]  
CHECHIK M, 2001, LECT NOTES COMPUTER, V2021, P72
[7]  
Chechik M., 2002, LNCS, V2404, P505, DOI DOI 10.1007/3-540-45657-0
[8]  
CHECHIK M, 2003, UNPUB
[9]   Tree-like counterexamples in model checking [J].
Clarke, E ;
Jha, S ;
Lu, Y ;
Veith, H .
17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2002, :19-29
[10]  
Clarke EM, 1999, MODEL CHECKING, P1