Proceedings IEEE International Conference on Software Maintenance. ICSM 2001
DOI: 10.1109/icsm.2001.972712
|View full text |Cite
|
Sign up to set email alerts
|

Flow analysis to detect blocked statements

Abstract: In the context of quality assessment, this paper proposes two new kinds of data which can be extracted from source code. The first, definitely blocked statements, can never be executed because preceding code prevents the execution of the program. The other data, called possibly blocked statements, may be blocked by blocking code. This paper presents original flow equations to compute definitely and possibly blocked statements in source code. The experimental context is described and results are shown and discu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Slicing tends to follow one of two strategies. First, static slicing identifies all candidate dependencies of a given statement, relying purely on analysis of the source code . The static approach tends to create very large slices, between 30 and 60% of the program .…”
Section: Related Workmentioning
confidence: 99%
“…Slicing tends to follow one of two strategies. First, static slicing identifies all candidate dependencies of a given statement, relying purely on analysis of the source code . The static approach tends to create very large slices, between 30 and 60% of the program .…”
Section: Related Workmentioning
confidence: 99%
“…This article presents new and original flow equations used to perform the data flow analysis that extracts "blocked levels" information and which is based on a previously defined boolean blocked statements analysis [10]. A standard exchange format is used for input and output of the software: GXL (Graph eXchange Language), an XML standard for graph representation [5].…”
Section: Introductionmentioning
confidence: 99%