DeepAI AI Chat
Log In Sign Up

A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks

by   Jasine Babu, et al.
The Fleet Street

The problem of determining Herbrand equivalence of terms at each program point in a data flow framework is a central and well studied question in program analysis. Most of the well-known algorithms for the computation of Herbrand equivalence in data flow frameworks proceed via iterative fix-point computation on some abstract lattice of short expressions relevant to the given flow graph. However the mathematical definition of Herbrand equivalence is based on a meet over all path characterization over the (infinite) set of all possible expressions. The aim of this paper is to develop a lattice theoretic fix-point formulation of Herbrand equivalence on the (infinite) concrete lattice defined over the set of all terms constructible from variables, constants and operators of a program. The present characterization uses an axiomatic formulation of the notion of Herbrand congruence and defines the (infinite) concrete lattice of Herbrand congruences. Transfer functions and non-deterministic assignments are formulated as monotone functions over this concrete lattice. Herbrand equivalence is defined as the maximum fix point of a composite transfer function defined over an appropriate product lattice of the above concrete lattice. A re-formulation of the classical meet-over-all-paths definition of Herbrand equivalence in the above lattice theoretic framework is also presented and is proven to be equivalent to the new lattice theoretic fix-point characterization.


page 1

page 2

page 3

page 4


Abstract Interpretation on E-Graphs

Recent e-graph applications have typically considered concrete semantics...

A Data Flow Analysis Framework for Data Flow Subsumption

Data flow testing creates test requirements as definition-use (DU) assoc...

Defining Functions on Equivalence Classes

A quotient construction defines an abstract type from a concrete type, u...

Reconciling Shannon and Scott with a Lattice of Computable Information

This paper proposes a reconciliation of two different theories of inform...

Bisimilarity of Open Terms in Stream GSOS

Stream GSOS is a specification format for operations and calculi on infi...

Conceptua: Institutions in a Topos

Tarski's semantic definition of truth is the composition of its extensio...

Highly irregular separated nets

In 1998 Burago and Kleiner and (independently) McMullen gave examples of...