The input/output complexity of sorting and related problems
Communications of the ACM
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Is There a Best Symbolic Cycle-Detection Algorithm?
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient reduction of finite state model checking to reachability analysis
International Journal on Software Tools for Technology Transfer (STTT)
Best-first frontier search with delayed duplicate detection
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
"To store or not to store" reloaded: reclaiming memory on demand
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Distributed explicit fair cycle detection: set based approach
SPIN'03 Proceedings of the 10th international conference on Model checking software
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
STXXL: standard template library for XXL data sets
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Semi-external LTL Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Dynamic Delayed Duplicate Detection for External Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
Efficient Probabilistic Model Checking on General Purpose Graphics Processors
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Flash memory efficient LTL model checking
Science of Computer Programming
Efficient explicit-state model checking on general purpose graphics processors
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
External memory breadth-first search with delayed duplicate detection on the GPU
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
The sweep-line state space exploration method
Theoretical Computer Science
Combining the sweep-line method with the use of an external-memory priority queue
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Hybrid on-the-fly LTL model checking with the sweep-line method
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Dynamic state space partitioning for external memory state space exploration
Science of Computer Programming
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
Revisiting resistant graph algorithms are those, whose correctness is not vulnerable to repeated edge exploration. Revisiting resistant I/O efficient graph algorithms exhibit considerable speed-up in practice in comparison to nonrevisiting resistant algorithms. In the paper we present a new revisiting resistant I/O efficient LTL model checking algorithm. We analyze its theoretical I/O complexity and we experimentally compare its performance to already existing I/O efficient LTL model checking algorithms.