Abstract
The aim of this paper is to propose a new method for the static analysis of concurrent software systems. We introduce a new model, a communicating rewriting system (CRS) for the modeling of programs. We show that the reachability problem for this model is undecidable, we reduce this problem to the emptiness problem for the intersection of context-free languages, which is also undecidable. Counter example-guided abstraction refinement (CEGAR) technique is used to deal with this problem. The key idea of our CEGAR algorithm is to over-approximate the intersection by a regular language in the abstraction step, and to compute another regular language from the over-approximation in the refinement step. If the over-approximation is non-empty, we report a bug. We give a procedure to approximate context-free languages using regular languages and we generate bounded languages for a set of counter examples for test membership of the intersection of context-free languages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
