Mosel: A sound and efficient tool for M2L(Str)

Kelb, Peter; Margaria, Tiziana; Mendler, Michael; Gsottberger, Claudia

doi:10.1007/3-540-63166-6_45

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite their atrocious complexity, the decision procedures for M2L-Str and WS1S have been implemented in numerous tools, e.g., Mona [14], Mosel [18], MOSEL [12], and the STEP system [15], and have been successfully applied to problems in diverse domains including hardware [2] and protocol [11] verification. Not surprisingly though, many large systems cannot be verified due to state explosion.…”

Section: Introductionmentioning

confidence: 99%

Bounded Model Construction for Monadic Second-Order Logics

Ayari

Basin

2000

Computer Aided Verification

View full text Add to dashboard Cite

The monadic logics M2L-Str and WS1S have been successfully used for verification, although they are nonelementary decidable. Motivated by ideas from bounded model checking, we investigate procedures for bounded model construction for these logics. The problem is, given a formula φ and a bound k, does there exist a word model for φ of length k. We give a bounded model construction algorithm for M2L-Str that runs in a time exponential in k. For WS1S, we prove a negative result: bounded model construction is as hard as validity checking, i.e., it is nonelementary. From this, negative results for other monadic logics, such as S1S, follow. We present too preliminary tests using a SAT-based implementation of bounded model construction; for certain problem classes it can find counterexamples substantially faster than automata-based decision procedures.

show abstract

Section: Introductionmentioning

confidence: 99%