TY - GEN
T1 - From model checking to a temporal proof
AU - Peled, Doron
AU - Zuck, Lenore
PY - 2001
Y1 - 2001
N2 - Model checking is used to automatically verify temporal properties of finite state systems. It is usually considered to be 'successful', when an error, in the form of a counterexample to the checked property, is found. We present the dual approach, where, in the presence of no counterexample, we automatically generate a proof that the checked property is satisfied by the given system. Such a proof can be used to obtain intuition about the verified system. This approach can be added as a simple extension to existing model checking tools.
AB - Model checking is used to automatically verify temporal properties of finite state systems. It is usually considered to be 'successful', when an error, in the form of a counterexample to the checked property, is found. We present the dual approach, where, in the presence of no counterexample, we automatically generate a proof that the checked property is satisfied by the given system. Such a proof can be used to obtain intuition about the verified system. This approach can be added as a simple extension to existing model checking tools.
UR - https://www.scopus.com/pages/publications/84894622143
U2 - 10.1007/3-540-45139-0_1
DO - 10.1007/3-540-45139-0_1
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84894622143
SN - 3540421246
SN - 9783540421245
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 14
BT - Model Checking Software - 8th International SPIN Workshop, Proceedings
A2 - Dwyer, Matthew
PB - Springer Verlag
T2 - 8th International SPIN Workshop on Model Checking Software, SPIN 2001
Y2 - 19 May 2001 through 20 May 2001
ER -