Publication details
Can Flash Memory Help in Model Checking?
| Basic information | |
|---|---|
| Original title: | Can Flash Memory Help in Model Checking? |
| Authors: | Jiří Barnat, Luboš Brim, Stefan Edelkamp, Damian Sulewski, Pavel Šimeček |
| Further information | |
|---|---|
| Citation: | BARNAT, Jiří  - BRIM, Luboš - EDELKAMP, Stefan - SULEWSKI, Damian - ŠIMEČEK, Pavel. Can Flash Memory Help in Model Checking?. In Formal Methods for Industrial Critical Systems. Neuveden : Springer Berlin / Heidelberg, 2009. ISBN 978-3-642-03239-4, pp. 150-165. 2008, L'Aquila, Italy. |
| Original language: | English |
| Field: | Informatika |
| WWW: |  http://dx.doi.org/10.1007/978-3-642-03240-0_14 |
| Type: | Article in Proceedings |
| Keywords: | Flash memory; SSD disks; Model Checking |
As flash media become common and their capacities and speed grow, they are becoming a practical alternative for standard mechanical drives. So far, external memory model checking algorithms have been optimized for mechanical hard disks corresponding to the model of Aggarwal and Vitter. Since flash memories are essentially different, the model of Aggarwal and Vitter no longer describes their typical behavior. On such a different device, algorithms can have different complexity, which may lead to the design of completely new flash-memory-efficient algorithms. We provide a model for computation of I/O complexity on the model of Aggarwal and Vitter modified for flash memories. We discuss verification algorithms optimized for this model and compare the performance of these algorithms with approaches known from I/O efficient model checking on mechanical hard disks. We also give an answer, when the usage of flash devices pays off and whether their further evolution in speed and capacity could broaden a range, where new algorithms outperform the old ones.
Related projects:
- Techniques for automatic verification and validation of software nad hardware systems
- Highly Parallel and Distributed Computing Systems
- Automated software verification
