Symbolic Model Checking of Infinite-State Systems Using Narrowing

@inproceedings{Escobar2007SymbolicMC,
  title={Symbolic Model Checking of Infinite-State Systems Using Narrowing},
  author={Santiago Escobar and Jos{\'e} Meseguer},
  booktitle={RTA},
  year={2007}
}
Rewriting is a general and expressive way of specifying concurrent systems, where concurrent transitions are axiomatized by rewrite rules. Narrowing is a complete symbolic method for model checking reachability properties. We show that this method can be reinterpreted as a lifting simulation relating the original system and the symbolic system associated to the narrowing transitions. Since the narrowing graph can be infinite, this lifting simulation only gives us a semi-decision procedure for… CONTINUE READING
31 Citations
41 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 41 references

Symbolic model checking of infinite-state systems using narrowing

  • S. Escobar, J. Meseguer
  • Technical Report No. 2814, Department of Computer…
  • 2007
Highly Influential
4 Excerpts

Model Checking

  • E. M. Clarke, O. Grumberg, D. A. Peled
  • MIT Press,
  • 2001
Highly Influential
3 Excerpts

N

  • M. Clavel, F. Durán, S. Eker, P. Lincoln
  • Mart́ı-Oliet, J. Meseguer, and C. Talcott. All…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…