Flash memory efficient LTL model checking

DOI10.1016/j.scico.2010.03.005zbMath1213.68372OpenAlexW2004616983MaRDI QIDQ617930

D. Sulewski, P. Šimeček, Luboš Brim, Stefan Edelkamp, Jiří Barnat

Publication date: 14 January 2011

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2010.03.005

zbMATH Keywords

model checkingexternal memory algorithmsalgorithm engineering

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Flash memory efficient LTL model checking

Uses Software

• DiVinE
• STXXL
• BEEM
• Murphi
• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flash memory efficient LTL model checking
• Mechanising a formal model of flash memory
• Algorithms for memory hierarchies. Advanced lectures
• A minimized automaton representation of reachable states
• Storing a sparse table
• The Spatial Complexity of Oblivious k-Probe Hash Functions
• Semi-external LTL Model Checking
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Survey on Directed Model Checking
• Hash, Displace, and Compress
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Dynamic Perfect Hashing: Upper and Lower Bounds
• KI 2004: Advances in Artificial Intelligence
• Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
• Formal Methods in Computer-Aided Design
• Space/time trade-offs in hash coding with allowable errors
• Tools and Algorithms for the Construction and Analysis of Systems
• Model Checking Software

This page was built for publication: Flash memory efficient LTL model checking