An improvement in partial-order model-checking with ample sets
نویسندگان
چکیده
In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking.
منابع مشابه
Confluence versus Ample Sets in Probabilistic Branching Time
To improve the efficiency of model checking in general, and probabilistic model checking in particular, several reduction techniques have been introduced. Two of these, confluence reduction and partial-order reduction by means of ample sets, are based on similar principles, and both preserve branching-time properties for probabilistic models. Confluence reduction has been introduced for probabi...
متن کاملGuard - based Partial - Order Reduction ( Extended Version )
This paper aims at making partial-order reduction independent of the modeling language. To this end, we present a guard-based method which is a generalpurpose implementation of the stubborn set method. We approach the implementation through so-called necessary enabling sets and do-not-accord sets, and give an algorithm suitable for an abstract model checking interface. We also introduce necessa...
متن کاملA comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This paper provides an extensive comparison between these two methods, and answers the question how they relate in terms of reduction power when preserving branching time properties. We prove that, while both preserv...
متن کاملWhy Confluence is More Powerful than Ample Sets in Probabilistic and Non-Probabilistic Branching Time
Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This presentation provides an extensive comparison between these two methods, answering the long-standing question of how they relate. We show that, while both preserve branching time properties, confluence reduction...
متن کاملSound Transaction-Based Reduction Without Cycle Detection
Partial order reduction is widely used to alleviate state space explosion in model checkers for concurrent programs. Traditional approaches to partial order reduction are based on ample sets. Natural ample sets can be computed for threads that communicate with each other predominantly through message queues. For threads that communicate with shared memory using locks for synchronization, Lipton...
متن کامل