The existence of finite abstractions for branching time model checking

@article{Dams2004TheEO,
  title={The existence of finite abstractions for branching time model checking},
  author={Dennis Dams and Kedar S. Namjoshi},
  journal={Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.},
  year={2004},
  pages={335-344}
}
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or finite, but large) state space is reduced to a small, finite state, abstract program on which a correctness property can be checked. The fundamental question we investigate in this paper is whether such a reduction to finite state programs is always possible, for arbitrary branching time temporal properties. We begin by showing that existing abstraction frameworks… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS

Citations

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

74 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…