UNSPECIFIED (2002) Flow analysis: Games and nets. ESSENCE OF COMPUTATION: COMPLEXITY ANALYSIS, TRANSFORMATION, 2566 . pp. 135-156. ISSN 0302-9743

Full text not available from this repository.

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 axe 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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	ESSENCE OF COMPUTATION: COMPLEXITY ANALYSIS, TRANSFORMATION
Publisher:	SPRINGER-VERLAG BERLIN
ISSN:	0302-9743
Date:	2002
Volume:	2566
Number of Pages:	22
Page Range:	pp. 135-156
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/9724

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item