Combining State Space Caching and Hash Compaction

@inproceedings{Stern1996CombiningSS,
  title={Combining State Space Caching and Hash Compaction},
  author={Ulrich Stern and David L. Dill},
  year={1996}
}
In veri cation by explicit state enumeration, for each reachable state the full state descriptor is stored in a state table. Two methods { state space caching and hash compaction { that reduce the memory requirements for this table have been proposed in the literature. In state space caching, \old" states are replaced by newly reached ones once the table lls up, which might increase the run-time requirements for veri cation. In hash compaction, introduced by Wolper and Leroy and improved upon… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Reliable hashing without collision detection

  • D. Leroy
  • ComputerAided Veri cation . 5 th International…
  • 1993

New techniques for e  cient veri cation withimplicitly conjoined BDDs

  • A. J. Hu, D. L. Dill.
  • Design and Validation of Computer Protocols
  • 1991

Similar Papers

Loading similar papers…