Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Handbook of mathematics (3rd ed.)
Handbook of mathematics (3rd ed.)
Software Testing Techniques
Introduction to Algorithms
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Using Petri net invariants in state space construction
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Memory efficient state space storage in explicit software model checking
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
| Hi-index | 0.00 |
Formal methods have an unprecedented ability to endorse the correctness of a system. In spite of that, it has been limited to safety-critical and mission-critical systems owing to significant time and memory costs involved. Lately, our ever increasing dependency on software in all walks of our life has necessitated using formal methods for a wider range of softwares. In this paper, we propose an algorithm to make this possible by reducing the memory requirement for model checking, a widely used formal method. A modelchecker stores all explored states in memory to ensure termination. The proposed algorithm slash memory costs by storing these states in compressed form. In compressed form, a state is stored as how different it is from its previous state. Our experiments report a memory reduction of 95% with only doubling of computation delay. Aforesaid reduction allows model checking in a machine with only a fraction of memory needed otherwise. Consequently the advantage is twofold, 1) enormous savings as only a small physical memory is required and 2) as more states can now be stored in a memory of same size, the chances of complete state-space analysis is exceedingly high.