2010•Jisuanji gongchengRequires access

Study on Fast Automatic Program Flow Analysis Method

Houhua Cao

Open publisher page 0 citations

Abstract

An automatic program flow analysis method is presented,which uses static single assignment to simplify data dependence relation in program slicing,and uses a simple and fast program slicing algorithm to delete statements and control predicate which has no effect on loop control,and uses abstract interpretation to get precise program flow information automatically.Experimental results show this method is more fast than the normal method up to 25%,while keeping precision.Moreover,there is no any assume on program form,so the flow analysis method is suitable for any program form.

About this research paper

What this paper is about

An automatic program flow analysis method is presented,which uses static single assignment to simplify data dependence relation in program slicing,and uses a simple and fast program slicing algorithm to delete statements and control predicate which has no effect on loop control,and uses abstract interpretation to get precise program flow information automatically.Experimental results show this method is more fast than the normal method up to 25%,while keeping precision.Moreover,there is no any assume on program form,so the flow analysis method is suitable for any program form.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

An automatic program flow analysis method is presented,which uses static single assignment to simplify data dependence relation in program slicing,and uses a simple and fast program slicing algorithm to delete statements and control predicate which has no effect on loop control,and uses abstract interpretation to get precise program flow information automatically.Experimental results show this method is more fast than the normal method up to 25%,while keeping precision.Moreover,there is no any assume on program form,so the flow analysis method is suitable for any program form.

Key concepts: Program slicing, Computer science, Slicing, Abstract interpretation, Program analysis, Control flow, Control flow graph, Static analysis

Related papers

Back to paper searchBrowse research topicsOriginal source
Study on Fast Automatic Program Flow Analysis Method — Research Paper | ScholarLens