Protocol validation in complex systems
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Journal of the ACM (JACM)
Characterizations of Reducible Flow Graphs
Journal of the ACM (JACM)
An efficient search algorithm to find the elementary circuits of a graph
Communications of the ACM
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Generic Method for Statistical Testing
ISSRE '04 Proceedings of the 15th International Symposium on Software Reliability Engineering
Enhancing random walk state space exploration
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Uniform random sampling of traces in very large models
Proceedings of the 1st international workshop on Random testing
Parallel Randomized State-Space Search
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Uniform random walks in very large models
Proceedings of the 2nd international workshop on Random testing: co-located with the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007)
Resource-Aware Verification Using Randomized Exploration of Large State Spaces
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Coverage-biased Random Exploration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Slicing communicating automata specifications: polynomial algorithms for model reduction
Formal Aspects of Computing
Generating counter-examples through randomized guided search
Proceedings of the 14th international SPIN conference on Model checking software
Systems and Software Verification: Model-Checking Techniques and Tools
Systems and Software Verification: Model-Checking Techniques and Tools
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Checking models, proving programs, and testing systems
TAP'11 Proceedings of the 5th international conference on Tests and proofs
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
| Hi-index | 0.00 |
Grosu and Smolka have proposed a randomised Monte-Carlo algorithm for LTL model-checking. Their method is based on random exploration of the intersection of the model and of the Büchi automaton that represents the property to be checked. The targets of this exploration are so-called lassos, i.e. elementary paths followed by elementary circuits. During this exploration outgoing transitions are chosen uniformly at random. Grosu and Smolka note that, depending on the topology, the uniform choice of outgoing transitions may lead to very low probabilities of some lassos. In such cases, very big numbers of random walks are required to reach an acceptable coverage of lassos, and thus a good probability either of satisfaction of the property or of discovery of a counter-example. In this paper, we propose an alternative sampling strategy for lassos in the line of the uniform exploration of models presented in some previous work. The problem of finding all elementary cycles in a directed graph is known to be difficult: there is no hope for a polynomial time algorithm. Therefore, we consider a well-known sub-class of directed graphs, namely the reducible flow graphs, which correspond to well-structured programs and most control-command systems. We propose an efficient algorithm for counting and generating uniformly lassos in reducible flowgraphs. This algorithm has been implemented and experimented on a pathological example. We compare the lasso coverages obtained with our new uniform method and with uniform choice among the outgoing transitions.