Package it.unive.lisa.program.cfg.edge

Class SequentialEdge

java.lang.Object

it.unive.lisa.program.cfg.edge.Edge

it.unive.lisa.program.cfg.edge.SequentialEdge

All Implemented Interfaces:

CodeEdge<CFG,Statement,Edge>, Edge<CFG,Statement,Edge>, java.lang.Comparable<Edge>

public class SequentialEdge
extends Edge

A sequential edge connecting two statement. The abstract analysis state does not get modified when traversing this edge.

Constructor Summary

Constructors

Constructor	Description
SequentialEdge()	Builds an "empty" edge, meaning that it does not have endpoints.
SequentialEdge(Statement source, Statement destination)	Builds the edge.

Method Summary

Modifier and Type	Method	Description
boolean	isUnconditional()	Yields true if and only if this edge represent unconditional execution flow between its bounds.
SequentialEdge	newInstance(Statement source, Statement destination)	Builds a new instance of this edge, connecting the given nodes.
java.lang.String	toString()
<A extends AbstractState<A,H,V,T>,H extends HeapDomain<H>,V extends ValueDomain<V>,T extends TypeDomain<T>> AnalysisState<A,H,V,T>	traverse(AnalysisState<A,H,V,T> sourceState)	Traverses this edge, optionally modifying the given sourceState by applying semantic assumptions.

Methods inherited from class it.unive.lisa.program.cfg.edge.Edge

accept, compareTo, equals, getDestination, getSource, hashCode

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

SequentialEdge

public SequentialEdge()

Builds an "empty" edge, meaning that it does not have endpoints.

SequentialEdge

public SequentialEdge(Statement source,
                      Statement destination)

Builds the edge.

Parameters:

source - the source statement

destination - the destination statement

Method Detail

toString

public java.lang.String toString()

Specified by:

toString in class Edge

traverse

public <A extends AbstractState<A,H,V,T>,H extends HeapDomain<H>,V extends ValueDomain<V>,T extends TypeDomain<T>> AnalysisState<A,H,V,T> traverse(AnalysisState<A,H,V,T> sourceState)

Description copied from class: Edge

Traverses this edge, optionally modifying the given sourceState by applying semantic assumptions.

Specified by:

traverse in class Edge

Type Parameters:

A - the concrete AbstractState instance

H - the concrete HeapDomain instance

V - the concrete ValueDomain instance

T - the concrete TypeDomain instance

Parameters:

sourceState - the AnalysisState computed at the source of this edge

Returns:

the AnalysisState after traversing this edge

isUnconditional

public boolean isUnconditional()

Description copied from interface: CodeEdge

Yields true if and only if this edge represent unconditional execution flow between its bounds. This means that (i) it could be simplified if one of the nodes connected to it is simplified (i.e., removed from the graph), and (ii) the graph containing it can avoid storing the edge if its bounds are subsequent.

Returns:

whether or not this edge can be simplified

newInstance

public SequentialEdge newInstance(Statement source,
                                  Statement destination)

Description copied from interface: CodeEdge

Builds a new instance of this edge, connecting the given nodes.

Parameters:

source - the source node

destination - the destination node

Returns:

a new instance of this edge, connecting the given nodes