The input/output complexity of sorting and related problems
Communications of the ACM
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
An Analysis of Bitstate Hashing
Formal Methods in System Design
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Model checking
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Symbolic Model Checking
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Efficient reduction of finite state model checking to reachability analysis
International Journal on Software Tools for Technology Transfer (STTT)
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
STXXL: standard template library for XXL data sets
Software—Practice & Experience
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Storing a sparse table with O(1) worst case access time
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Dynamic perfect hashing: upper and lower bounds
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Evolution of NAND Flash Memory Interface
ACSAC '07 Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture
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
Layered Duplicate Detection in External-Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Flash-Efficient LTL Model Checking with Minimal Counterexamples
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Mechanising a formal model of flash memory
Science of Computer Programming
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
On Computational Models for Flash Memory Devices
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Best-first frontier search with delayed duplicate detection
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Can Flash Memory Help in Model Checking?
Formal Methods for Industrial Critical Systems
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Cluster-Based I/O-Efficient LTL Model Checking
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
"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
Minimal counterexample generation for SPIN
Proceedings of the 14th international SPIN conference on Model checking software
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
Characterizing the performance of flash memory storage devices and its impact on algorithm design
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Revisiting resistance speeds up I/O-efficient LTL model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Perfect hashing for state spaces in BDD representation
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
DiVinE: a tool for distributed verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A note on on-the-fly verification algorithms
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
| Hi-index | 0.00 |
As the capacity and speed of flash memories in form of solid state disks grow, they are becoming a practical alternative for standard magnetic drives. Currently, most solid-state disks are based on NAND technology and much faster than magnetic disks in random reads, while in random writes they are generally not. So far, large-scale LTL model checking algorithms have been designed to employ external memory optimized for magnetic disks. We propose algorithms optimized for flash memory access. In contrast to approaches relying on the delayed detection of duplicate states, in this work, we design and exploit appropriate hash functions to re-invent immediate duplicate detection. For flash memory efficient on-the-fly LTL model checking, which aims at finding any counter-example to the specified LTL property, we study hash functions adapted to the two-level hierarchy of RAM and flash memory. For flash memory efficient off-line LTL model checking, which aims at generating a minimal counterexample and scans the entire state space at least once, we analyze the effect of outsourcing a memory-based perfect hash function from RAM to flash memory. Since the characteristics of flash memories are different to magnetic hard disks, the existing I/O complexity model is no longer sufficient. Therefore, we provide an extended model for the computation of the I/O complexity adapted to flash memories that has a better fit to the observed behavior of our algorithms.