Loading...
Please wait, while we are loading the content...
Similar Documents
Flow analysis: games and nets (extended abstract) (2002).
| Content Provider | CiteSeerX |
|---|---|
| Author | Hankin, Chris Nagarajan, Rajagopal Sampath, Prahladavaradan |
| 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 controlflow 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. |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Extended Abstract Flow Analysis Game Semantics Conservative Prediction 0-cfa Performs Dynamic Transitive Closure Graph-based Formulation Certain Kind Control-flow Analysis Aim Computation Path Control-flow Analysis Context Free Analysis Controlflow Analysis Amount Algorithm Relies |
| Content Type | Text |
| Resource Type | Article |