The Internet Archive has a preservation copy of this work in our general collections.
The file type is
In this article, we discuss a flow--sensitive analysis of equality relationships for imperative programs. We describe its semantic domains, general purpose operations over abstract computational states (term evaluation and identification, semantic completion, widening operator, etc.) and semantic transformers corresponding to program constructs. We summarize our experiences from the last few years concerning this analysis and give attention to applications of analysis of automatically generatedarXiv:cs/0609092v1 fatcat:mvqrweicbjeqnkjbwwr2cfovr4