X hits on this document

Powerpoint document

Requirements Decomposition Analysis, Model Based Testing of Sequential Code Properties - page 3 / 17

38 views

0 shares

0 downloads

0 comments

3 / 17

20 July, 2004

OSMA Software Assurance Symposium

3

California Institute of Technology

Requirements Decomposition Analysis Task Description (cont’d)

Model Based Testing of Sequential Code Properties

Problem Statement: A common issue with model checking is that the state space to be explored can become too large to search in a reasonable time.  This may prevent the application of model checking techniques in situations where it may be desirable to do so.  Reducing the number of states visited would make it possible to apply model checking to larger systems.

Task: Recent results indicate that checking a small number of states in a system model is as effective as checking a large number of states. We explore this conjecture by comparing the results of applying traditional model checkers, such as SPIN, to the results of applying the LURCH tool, which does not visit all of the system`s states.

Document info
Document views38
Page views38
Page last viewedFri Dec 09 01:55:46 UTC 2016
Pages17
Paragraphs299
Words1977

Comments