Name
Abstract | ||
|---|---|---|
This paper presents a graph-based formulation of control-flow analysis using results from game semantics and proof-nets. Control-flow analysis aims to give a conservative prediction of the flow of control in a program. In our analysis, terms are represented by proof-nets and control-flow analysis amounts to the analysis of computation paths in the proof-net. We focus on a context free analysis known in the literature as 0-CFA, and develop an algorithm for the analysis. The algorithm for 0-CFA performs dynamic transitive closure of a graph that is based on the judgement associated with the proof-net. Correctness of the algorithm relies on the correspondence between proof-nets and certain kinds of strategies in game semantics. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-36377-7_7 | The Essence of Computation |
Keywords | Field | DocType |
control-flow analysis amount,graph-based formulation,conservative prediction,certain kind,dynamic transitive closure,context free analysis,game semantics,computation path,control-flow analysis,flow analysis,transitive closure | Computer science,Correctness,Proof theory,Floyd–Warshall algorithm,Artificial intelligence,Game theory,Program analysis,Linear logic,Game semantics,Transitive closure | Conference |
Volume | ISSN | ISBN |
2566 | 0302-9743 | 3-540-00326-6 |
Citations | PageRank | References |
3 | 0.39 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chris Hankin | 1 | 932 | 91.56 |
| Rajagopal Nagarajan | 2 | 283 | 34.63 |
| Prahladavaradan Sampath | 3 | 64 | 7.65 |