| Package | Description |
|---|---|
| de.rwth.i2.attestor.graph |
Abstractions and implementations of various labeled graphs and heap configurations.
|
| de.rwth.i2.attestor.graph.digraph |
Implementation of a directed graph in which nodes are labeled with objects implementing NodeLabel
and edges are labeled with arbitrary objects.
|
| de.rwth.i2.attestor.graph.heap |
All abstractions needed to work with HeapConfigurations.
|
| de.rwth.i2.attestor.graph.heap.internal |
All the messy details to implement a
HeapConfiguration
as a bipartite directed labeled graph. |
| de.rwth.i2.attestor.graph.morphism |
This package implements algorithms to compute various kinds of graph morphisms.
|
| de.rwth.i2.attestor.phases.counterexamples.counterexampleGeneration.heapConfigurationPair | |
| de.rwth.i2.attestor.programState.defaultState | |
| de.rwth.i2.attestor.programState.indexedState | |
| de.rwth.i2.attestor.refinement | |
| de.rwth.i2.attestor.types |
Base type for all notions of types, i.e.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
Nonterminal
General interface for nonterminal symbols.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BasicNonterminal
A simple standard implementation of nonterminal symbols.
|
| Modifier and Type | Method and Description |
|---|---|
NodeLabel |
LabeledDigraph.nodeLabelOf(int node) |
| Modifier and Type | Method and Description |
|---|---|
void |
LabeledDigraph.addNode(NodeLabel label,
int successorCapacity,
int predecessorCapacity)
Adds a new node with the provided label.
|
default boolean |
NodeLabel.matches(NodeLabel other) |
void |
LabeledDigraph.replaceNodeLabel(int node,
NodeLabel newLabel)
Sets the label of a node to newLabel.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Variable
Wrapper for a String such that Strings can be used as
NodeLabel in
LabeledDigraph. |
| Modifier and Type | Method and Description |
|---|---|
NodeLabel |
InternalHeapConfiguration.getNodeLabel(int privateNodeId)
This method directly access the
LabeledDigraph
underlying an InternalHeapConfiguration through private IDs. |
| Modifier and Type | Method and Description |
|---|---|
NodeLabel |
Graph.getNodeLabel(int node) |
| Modifier and Type | Method and Description |
|---|---|
NodeLabel |
HeapConfigurationPair.getNodeLabel(int node) |
| Modifier and Type | Class and Description |
|---|---|
class |
RefinedDefaultNonterminal
A nonterminal symbol that is additionally annotated with a state of a heap automaton.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
IndexedNonterminal |
| Modifier and Type | Class and Description |
|---|---|
class |
IndexedNonterminalImpl |
| Modifier and Type | Method and Description |
|---|---|
boolean |
IndexedNonterminalImpl.matches(NodeLabel obj) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
RefinedNonterminal
A symbol that is annotated with a heap automaton state.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
Type
General interface for possible classes of an object
modeled by a node in a
HeapConfiguration
or a Value. |
| Modifier and Type | Class and Description |
|---|---|
class |
GeneralType
A simple implementation of types.
|
Copyright © 2018. All rights reserved.