Work

Efficient Bounded Model Checking for LTL

Year: 2013
Type: article
Abstract: Bounded Model Checking is an efficient method of finding bugs in system designs. LTL is one of the most frequently used specification languages in model checking. In this paper, We present an linearization encoding for LTL bounded model checking. We use the incremental SAT technology to solve the BMC problem. We implement the new encoding in NuSMV model checker.
Language: English
Open Access status: hybrid
OpenAlex ID: W2092744187
FWCI: 0.307
Cites: 11
Cited by: 2
Related to: 10