Skip to main content
SpringerLink
Log in

A fine-grained data-flow analysis framework

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

 A fine-grained data-flow analysis framework (L, F) where the elements of the semilattice L are mappings from a set of items I to a semilattice of values V is introduced, and an algorithm is presented to solve this framework by considering the elements of I and V individually, rather than regarding the elements of L as atomic values. It is shown that a variety of useful data-flow problems fit into the fine-grained data-flow analysis framework, and can be solved in O(∣I∣×∣N∣) time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Computer Science Department, Southwestern Oklahoma State University, Weatherford, OK 73096, USA, , , , , , US

    C. Samuel Hsieh

Authors
  1. C. Samuel Hsieh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received 20 August, 1991/ 3 June, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hsieh, C. A fine-grained data-flow analysis framework. Acta Informatica 34, 653–665 (1997). https://doi.org/10.1007/s002360050101

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050101

Keywords

Search

Navigation