Path Dependent Analysis of Logic Programs

  • Authors:
  • Lunjin Lu

  • Affiliations:
  • Oakland University, Rochester, MI 48309, USA. lunjin@acm.org

  • Venue:
  • Higher-Order and Symbolic Computation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an abstract semantics that uses information about execution paths to improve precision of data flow analyses of logic programs. The abstract semantics is illustrated by abstracting execution paths using call strings of fixed length and the last transfer of control. Abstract domains that have been developed for logic program analyses can be used with the new abstract semantics without modification.