Loading...
Please wait, while we are loading the content...
Similar Documents
An Approach to Slicing Concurrent Ada Programs Based on Program Reachability Graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Qi, Xiaofang Xu, Baowen |
| Copyright Year | 2006 |
| Abstract | Summary Program slicing is an important technique applied in many software engineering activities, such as program debugging, testing, maintenance, measurement, reengineering and etc. This paper presents an effective representation for concurrent Ada programs, which is called task communication reachability graph (TCRG). Based on TCRG, we can precisely determine various dependences in concurrent Ada programs and construct a new dependence graph (MSPDG) which vertex is a pair composed of program state and statement. Dependence relation in MSPDG is precise and transitive. By traversing MSPDG, we can obtain high-precision slice for concurrent Ada programs. Compared with other highprecision slicing methods, the slice based on MSDG is more precise and its efficiency is higher in worst case. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://paper.ijcsns.org/07_book/200601/200601A05.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
