Work

Instance-wise reaching definition analysis for recursive programs using context-free transductions

Year: 2002

Type: conference-paper

Abstract: Automatic parallelization of recursive programs is still an open problem today, lacking suitable and precise static analyses. We present a novel reaching definition framework based on context-free transductions. The technique achieves a global and precise description of the data flow and discovers important semantic properties of programs. Taking the example of a real-world non-derecursivable program, we show the need for a reaching definition analysis able to handle run-time instances of statements separately. A running example sketches our parallelization scheme, and presents our reaching definition analysis. Future fruitful research, at the crossroad of program analysis and formal language theory, is also hinted at.

Source: International Conference on Parallel Architectures and Compilation Techniques (PACT)

DOI: 10.1109/pact.1998.727269

Authors: A. Cohen, J.-F. Collard

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1985517318

FWCI: 1.038

Cites: 22

Cited by: 16

Related to: 10