Package de.breakpointsec.pushdown

Class WPDS<L,S,W extends Semiring>

java.lang.Object

de.breakpointsec.pushdown.WPDS<L,S,W>

Type Parameters:

L - Control location

S - State

W - Semiring

public abstract class WPDS<L,S,W extends Semiring>
extends Object

Implementation of a Weighted Pushdown System. This is the main class you may want to use for constructing a WPDS.

Field Summary

Fields

Modifier and Type	Field	Description
protected Set<NormalRule<L,S,W>>	normalRules
protected Set<PopRule<L,S,W>>	popRules
protected Set<PushRule<L,S,W>>	pushRules
protected Set<S>	states

Constructor Summary

Constructors

Constructor	Description
WPDS()

Method Summary

Modifier and Type	Method	Description
boolean	addRule(Rule<L,S,W> rule)
abstract L	epsilon()
Set<Rule<L,S,W>>	getAllRules()
Set<NormalRule<L,S,W>>	getNormalRules()
Set<NormalRule<L,S,W>>	getNormalRulesEnding(S start, L string)
Set<PopRule<L,S,W>>	getPopRules()
Set<PushRule<L,S,W>>	getPushRules()
Set<PushRule<L,S,W>>	getPushRulesEnding(S start, L string)
Set<Rule<L,S,W>>	getRulesStarting(S start, L string)	Deprecated.
Set<S>	getStates()	Deprecated.
void	poststar(WeightedAutomaton<L,S,W> fa)	Implementation of post*, according to Reps, T., Schwoon, S., Jha, S., & Melski, D.
WeightedAutomaton<L,S,W>	prestar(WeightedAutomaton<L,S,W> fa)	pre*-saturation algorithm returns a finite automaton representing the backwards reachable set of the configuration represented by the initial automaton.
String	toString()
protected boolean	updatePostStar(Transition<L,S> t, W w, Rule rule, WeightedAutomaton<L,S,W> fa, LinkedList<Transition<L,S>> worklist)
protected void	updatePrestar(LinkedList<Transition<L,S>> worklist, Transition<L,S> t, W w, WeightedAutomaton<L,S,W> fa)	Add transition trans to fa, assign a weight to it that is computed of the rule's weight with that of the previous transitions.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

pushRules

protected final Set<PushRule<L,S,W extends Semiring>> pushRules

popRules

protected final Set<PopRule<L,S,W extends Semiring>> popRules

states

protected Set<S> states

normalRules

protected final Set<NormalRule<L,S,W extends Semiring>> normalRules

Constructor Detail

WPDS

public WPDS()

Method Detail

addRule

public boolean addRule(Rule<L,S,W> rule)

getNormalRules

public Set<NormalRule<L,S,W>> getNormalRules()

getPopRules

public Set<PopRule<L,S,W>> getPopRules()

getPushRules

public Set<PushRule<L,S,W>> getPushRules()

getAllRules

public Set<Rule<L,S,W>> getAllRules()

getRulesStarting

@Deprecated
public Set<Rule<L,S,W>> getRulesStarting(S start,
                                                     L string)

Deprecated.

getNormalRulesEnding

public Set<NormalRule<L,S,W>> getNormalRulesEnding(S start,
                                                               L string)

getPushRulesEnding

public Set<PushRule<L,S,W>> getPushRulesEnding(S start,
                                                           L string)

getStates

@Deprecated
public Set<S> getStates()

Deprecated.

updatePostStar

protected boolean updatePostStar(Transition<L,S> t,
                                 W w,
                                 Rule rule,
                                 WeightedAutomaton<L,S,W> fa,
                                 LinkedList<Transition<L,S>> worklist)
                          throws IllegalTransitionException

Throws:

IllegalTransitionException

poststar

public void poststar(WeightedAutomaton<L,S,W> fa)
              throws IllegalTransitionException

Implementation of post*, according to Reps, T., Schwoon, S., Jha, S., & Melski, D. (2005). Weighted pushdown systems and their application to interprocedural dataflow analysis. In Science of Computer Programming. https://doi.org/10.1016/j.scico.2005.02.009 Algorithm 3, Figure 17

Parameters:

fa - initial P-automaton

Throws:

IllegalTransitionException

prestar

public WeightedAutomaton<L,S,W> prestar(WeightedAutomaton<L,S,W> fa)
                                             throws IllegalTransitionException

pre*-saturation algorithm returns a finite automaton representing the backwards reachable set of the configuration represented by the initial automaton. Implementation according to Reps, T., Lal, A., & Kidd, N. (2007). Program Analysis Using Weighted Pushdown Systems, 23–51. https://doi.org/10.1007/978-3-540-77050-3_4 Algorithm 1 (Figure 9).

Parameters:

fa - initial P-automaton

Returns:

Throws:

IllegalTransitionException

updatePrestar

protected void updatePrestar(LinkedList<Transition<L,S>> worklist,
                             Transition<L,S> t,
                             W w,
                             WeightedAutomaton<L,S,W> fa)
                      throws IllegalTransitionException

Add transition trans to fa, assign a weight to it that is computed of the rule's weight with that of the previous transitions.

Parameters:

worklist -

t -

w -

fa -

Throws:

IllegalTransitionException

toString

public String toString()

Overrides:

toString in class Object

epsilon

public abstract L epsilon()