| Package | Description |
|---|---|
| analysis | |
| nfa | |
| regexcompiler |
| Modifier and Type | Method and Description |
|---|---|
NFAVertexND |
NFAAnalyserInterface.EdaAnalysisResultsFilter.getEndState() |
NFAVertexND |
NFAAnalyserInterface.EdaAnalysisResultsParallel.getSourceVertex() |
NFAVertexND |
NFAAnalyserInterface.EdaAnalysisResultsFilter.getStartState() |
| Modifier and Type | Method and Description |
|---|---|
static LinkedList<NFAVertexND> |
NFAAnalyserFlattening.dfsFlatten(NFAGraph m,
NFAVertexND startVertex) |
static Map<NFAVertexND,NFAGraph> |
NFAAnalysisTools.mergeStronglyConnectedComponents(NFAGraph m,
boolean epsilon)
Creates a single state for each strongly connected component.
|
static HashMap<NFAVertexND,Integer> |
NFAAnalyserFlattening.numWalksFrom(NFAGraph m,
NFAVertexND s) |
static HashMap<NFAVertexND,Integer> |
NFAAnalysisTools.numWalksFrom(NFAGraph m,
NFAVertexND s)
Determines the number of walks between a vertex and all other vertices in
a given graph.
|
static HashSet<NFAVertexND> |
NFAAnalysisTools.reachableWithEpsilon(NFAGraph n,
NFAVertexND v) |
static HashMap<NFAVertexND,Integer> |
NFAAnalysisTools.topologicalSort(NFAGraph originalM)
A function that uses Kahn's algorithm to find the topological order of the vertices in
the graph.
|
| Modifier and Type | Method and Description |
|---|---|
static String |
ExploitStringBuilder.buildPrefixString(NFAGraph m,
NFAVertexND finish)
Builds the string that takes the NFA to the state that shows EDA.
|
static String |
ExploitStringBuilder.buildPumpIntersect(NFAGraph pcscc,
NFAVertexND p,
NFAVertexND q)
This function builds the exploit string for a vulnerable regular
expression, in the cases where p and q were found in the scc.
|
static String |
ExploitStringBuilder.buildSuffixString(NFAGraph n,
NFAVertexND start) |
static LinkedList<NFAVertexND> |
NFAAnalyserFlattening.dfsFlatten(NFAGraph m,
NFAVertexND startVertex) |
static HashMap<NFAVertexND,Integer> |
NFAAnalyserFlattening.numWalksFrom(NFAGraph m,
NFAVertexND s) |
static HashMap<NFAVertexND,Integer> |
NFAAnalysisTools.numWalksFrom(NFAGraph m,
NFAVertexND s)
Determines the number of walks between a vertex and all other vertices in
a given graph.
|
static HashSet<NFAVertexND> |
NFAAnalysisTools.reachableWithEpsilon(NFAGraph n,
NFAVertexND v) |
static LinkedList<NFAEdge> |
NFAAnalysisTools.shortestPathBetween(NFAGraph m,
NFAVertexND start,
NFAVertexND finish) |
static LinkedList<NFAEdge> |
NFAAnalysisTools.shortestPathTo(NFAGraph m,
NFAVertexND finish)
This function finds the shortest path from the initial state in the NFA
to a certain finish state.
|
| Modifier and Type | Method and Description |
|---|---|
static NFAGraph |
NFAAnalysisTools.convertUpNFAToNFAGraph(NFAGraph m,
HashMap<NFAVertexND,UPNFAState> newStateMap) |
static NFAGraph |
NFAAnalysisTools.determinize(NFAGraph input,
Set<NFAVertexND> reachableFromStart,
Set<TransitionLabel> alphabet) |
| Modifier and Type | Class and Description |
|---|---|
class |
UPNFAState |
| Modifier and Type | Method and Description |
|---|---|
NFAVertexND |
NFAVertexND.copy() |
NFAVertexND |
NFAGraph.getInitialState() |
NFAVertexND |
NFAEdge.getSourceVertex() |
NFAVertexND |
NFAVertexND.getStateByDimension(int dim)
Gets a state at a certain dimension
|
NFAVertexND |
NFAVertexND.getStateByDimensionRange(int fromIndex,
int toIndex)
Constructs a new state formed from the states from the dimensions between
two indices.
|
NFAVertexND |
NFAEdge.getTargetVertex() |
| Modifier and Type | Method and Description |
|---|---|
Set<NFAVertexND> |
NFAGraph.getAcceptingStates() |
Set<NFAVertexND> |
UPNFAState.getP() |
| Modifier and Type | Method and Description |
|---|---|
void |
NFAGraph.addAcceptingState(NFAVertexND acceptingState) |
boolean |
NFAGraph.addVertex(NFAVertexND v) |
int |
NFAVertexND.compareTo(NFAVertexND o) |
boolean |
NFAGraph.isAcceptingState(NFAVertexND state) |
Set<NFAEdge> |
NFAGraph.outgoingEpsilonEdgesOf(NFAVertexND v)
All the edges representing an epsilon transition from a vertex
|
void |
NFAGraph.removeAcceptingState(NFAVertexND acceptingState) |
void |
NFAGraph.setInitialState(NFAVertexND initialState) |
| Constructor and Description |
|---|
FilterEdge(NFAVertexND sourceVertex,
NFAVertexND targetVertex,
String transitionCharacter,
String outGoingTransitionCharacter) |
FilterEdge(NFAVertexND sourceVertex,
NFAVertexND targetVertex,
TransitionLabel transitionCharacter,
TransitionLabel outGoingTransitionCharacter) |
NFAEdge(NFAVertexND sourceVertex,
NFAVertexND targetVertex,
String transitionLabelString) |
NFAEdge(NFAVertexND sourceVertex,
NFAVertexND targetVertex,
TransitionLabel transitionLabel) |
NFAVertexND(NFAVertexND... mStates)
A constructor for creating one multidimensional vertex from
multidimensional vertices
|
| Constructor and Description |
|---|
NFAVertexND(Set<NFAVertexND> states)
A constructor for creating one multidimensional vertex from a set
of multidimensional vertices
|
UPNFAState(Collection<String> q,
Set<NFAVertexND> P) |
| Modifier and Type | Method and Description |
|---|---|
protected NFAVertexND |
ParseTreeToNFAConverter.deriveVertex(NFAGraph m,
NFAVertexND v) |
protected NFAVertexND |
ParseTreeToNFAConverter.nextLookAroundState() |
protected NFAVertexND |
ParseTreeToNFAConverter.nextState() |
| Modifier and Type | Method and Description |
|---|---|
NFAGraph |
ThompsonParseTreeToNFAConverter.createBaseCaseLookAround(NFAVertexND lookAroundState) |
NFAGraph |
JavaParseTreeToNFAConverter.createBaseCaseLookAround(NFAVertexND lookAroundState) |
NFAGraph |
NFACreator.createBaseCaseLookAround(NFAVertexND lookAroundState) |
protected NFAVertexND |
ParseTreeToNFAConverter.deriveVertex(NFAGraph m,
NFAVertexND v) |
Copyright © 2021. All rights reserved.