Compositional SCC Analysis for Language Emptiness

@article{Wang2006CompositionalSA,
  title={Compositional SCC Analysis for Language Emptiness},
  author={Chao Wang and Roderick Bloem and Gary D. Hachtel and Kavita Ravi and Fabio Somenzi},
  journal={Formal Methods in System Design},
  year={2006},
  volume={28},
  pages={5-36}
}
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our algorithm is compositional: It performs as much computation as possible on the abstract systems, and prunes uninteresting part of the search space as early as possible. It decomposes the state space disjunctively so that each state subset can be checked in isolation to decide language emptiness for the given system. We… CONTINUE READING

References

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

An algorithm for strongly connected component analysis in n log n symbolic steps

W. A. Hunt, S. D. Johnson, H. N. Gabow, F. Somenzi
Formal Methods in System Design • 2005

Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure

International Journal on Software Tools for Technology Transfer • 2004
View 1 Excerpt

Computer Aided Verification

Lecture Notes in Computer Science • 2004
View 3 Excerpts

Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems • 2003
View 2 Excerpts

Similar Papers

Loading similar papers…