Index of modules

All these functions find the nodes needed for various kind of annotations.

set of nodes of the graph

Build graphs (PDG) for the function (see module Build.BuildPdg) to represente the dependencies between instructions in order to use it for slicing purposes.

Lexical successors

Edges label for the Program Dependence Graph.

If the marks provided by the user respect some constraints (see Mark), we have that, after the marks propagation, the mark of a node are always smaller than the sum of the marks of its dependencies.

To also use interprocedural propagation, the user can instantiate this functor.

Mapping between the function elements we are interested in and some information.

The graph itself.

The keys can be used to identify an element of a function.

Compute a graph which provide the lexical successor of each statement s, ie.

compute the marks to propagate in the caller nodes from the marks of a function inputs in_marks.

Node.t is the type of the PDG vertex.

set of nodes of the graph

PDG for a function

This module can be useful to store some information about different elements of a function.

This file provides useful things to help to associate an information (called mark) to PDG elements and to propagate it across the dependencies.

This backward dataflow implements a variant of postdominators that verify the property P enunciated in bts 963: a statement postdominates itself if and only it is within the main path of a syntactically infinite loop.

This module defines the types that are used to store the PDG of a function.

DataState is associated with a program point and provide the dependancies for the data, ie.

Register external functions into Db.

Provides function to extract information from the PDG.

What we call a Signature a mapping between keys that represent either a function input or output, and some information.