 std | |
  hash< unordered_set< T > > | Defines the hash of an unordered_set as the xor of all elements of the set |
 uncover | The main namespace for the Uncover tool |
  analysis | This namespace is a collection of all classes specifically used for the (backwards) analysis |
   BackwardAnalysis | This class performs a backward search to solve the coverability problem with respect to a given Order |
   BackwardResultHandler | The BackwardResultHandler is an interface to handle intermediate results produced by the backward search |
   InstantWriterResultHandler | The InstantWriterResultHandler implements the BackwardResultHandler by writing the given information as soon as possible to the filesystem |
   MinPOCEnumerator | This abstract class serves as a schema of an enumerator taking a rule and a graph and enumerating all minimal pushout complements wrt |
   NoRulePreparer | This RulePreparer returns all rules unprepared |
   PreparedGTS | Graph transformation system that was prepared for use in the backward procedure |
    StdRuleMapCB | The StdRuleMapCB is a helper class defining a CollectionCallback to a PreparedGTS standard rule map |
    uqinst_iterator | The uqinst_iterator generates UQRuleInstances for backward application |
   RulePreparer | This class takes a rule and prepares it such that no special case handling is necessary while performing the analysis |
  basic_types | Contains a collection of general classes used through out the tool |
   CollectionCallback | This template provides a possibility to add elements to a collection without having a reference to the collection of knowing its type |
   GenericMessageException | This class serves as a superclass of all Exceptions |
   IDPartitionPointerHasher | A hasher for pointers to IDPartions |
   IDPartitionPointerEquality | An equality checker for pointers to IDPartitions |
   IDPartitionEnumerator | Provides a possibility to enumerate all partitions on a given set of IDs |
   InitialisationException | This exception is thrown if an object could not be initialized successfully |
   InvalidInputException | This exception is thrown whenever a function is called with invalid inputs |
   InvalidStateException | This exception is thrown if a function of an object was called, but the object was not in a valid state to call this function |
   Order | This class presents a generic ordering relation on Hypergraphs |
   OutOfIDsException | This exception is thrown if an object was about to be created, but the programm has run out of unique IDs |
   RunException | This exception is thrown if an algorithm or Scenario was executed, but encountered and error |
   Scenario | A scenario is a subprogram using a set of input parameters to execute some algorithms, producing desired output |
   Streamable | Streamable provides a streaming function which must be implemented by any deriving class |
   Timer | Provides a timer, which can be started and used to measure elapsed time |
   VectorCallback | This template class implements a CollectionCallback to a vector |
  graphs | Contains all classes and definitions for graphs, mappings between graphs, rules and graph transformation systems |
   AnonHypergraph | An AnonHypergraph is a data structure storing a hypergraph |
   AnonRule | AnonRule serves as a data structure of a rule object |
   Edge | This class represents an edge in a Hypergraph |
   GTS | Data structure for a graph transformation system |
   Hypergraph | A Hypergraph represents a graph with a unique identifier |
   IsomorphismChecker | Checks whether two given Hypergraphs are isomorphic or not |
   Mapping | This is the data structure representing a morphism mapping from a graph to another graph |
   MinGraphList | This data structure stores a collection of graphs minimal to some given order |
   PathChecker | Functions to compute whether given graphs have paths of a defined length |
   Rule | Represents the data structure for a rule including a unique identifier |
   SignatureCreater | The SignatureCreater provides functions to generate signatures for Hypergraphs |
   UQRule | This class serves as data structure of a universally quantified rule |
   UQRuleInstance | The UQRuleInstance is a rule which is generated when UQRules are instantiated |
   Vertex | Vertex stores all data of a vertex in a Hypergraph |
  io | Contains all classes and definitions used for importing and exporting graphs and graph transformation systems in any way |
   GraphDrawer | This class provides static methods for Converting GXL files to the 'dot' format |
   GTXLReader | This class imports GXL or GTXL XML files and converts them to Hypergraph and GTS objects respectively |
   GTXLReaderXerces | This class imports GXL or GTXL XML files and converts them to Hypergraph and GTS objects respectively |
   GTXLWriter | This class exports GXL or GTXL XML files by converting them from Hypergraph and GTS objects respectively |
   GTXLWriterXerces | This class exports GXL or GTXL XML files by converting them from Hypergraph and GTS objects respectively |
   LatexExporter | Provides a possibility to generate Latex files from GTS objects or graph sets |
   SafeXTString | This template provides a container which automatically releases a transcoded string, when the pointer runs out of scope |
   SafeXRes | This template provides a container which automatically release a given Xerces resource, when the pointer runs out of scope |
   XercesLoggingErrorHandler | Prints errors generated by the Xerces framework |
   XMLioException | This exception is thrown if an error occurred while importing or exporting XML documents |
  logging | Contains classes used for handling logging |
   DelayedLogMessage | This class stores a log message and sends it at the end of the scope in which it was defined |
   MessageLogger | This class is used to stream log messages |
   MultiStream | |
   MultiStreamBuffer | |
  minors | Contains implementations of classes from the uncover::analysis namespace for the minor ordering |
   MinorOrder | This class implements the Hypergraph Minor Ordering, as described in "Applying the Graph Minor
Theorem to the Verification of Graph Transformation Systems" (Salil Joshi, Barbara König) |
   MinorPOCEnumerator | Implements the abstract MinPOCEnumerator class for the minor ordering |
   MinorRulePreparer | This class prepares given rules to be used together with the minor order in the backward search |
   OldMinorOrder | This class is an old implementation of the Hypergraph Minor Ordering based on searching for disjoint paths |
    PathFinder | Searching for paths between two vertices |
     QueueEl | |
    twoIDLists | |
  rule_engine | Contains basic classes for applying rules |
   ExpEnumerator | This class represents a number over a variable base with a fixed length |
   IDClosureEnumerator | This enumerator can be used to enumerate all equivalences on IDs, where the equivalence closure of the enumerated IDPartition and a predefined IDPartition is the IDPartition, where every ID is in the same partition |
   IDtoIDEnumerator | This enumerator encapsulates a mapping of an ID to a set of IDs |
   PartialPOCEnumerator | The PartialPOCEnumerator computes a subset of all pushout complement of a partial rule and a total match |
   StdMatchFinder | StdMatchFinder provides a simple algorithm which takes two arbitrary graphs and calculates all matchings from one to the other |
   TotalPOCEnumerator | This enumerator computes all pushout complements for all co-matches from a total (given) rule to a given graph |
  scenarios | Contains all Scenarios predefined for this tool |
   BackwardAnalysisScenario | This Scenario performs a backward analysis according to the provided parameters |
   BackwardStepTest | This test scenario takes a given set of rules and a given set of error graphs and performs a single backward step, including rule preparation |
   GTXLtoLatexConverter | Use this Scenario to create a graphical representation of the given GTXL file |
   GXLtoPicConverter | This Scenario takes a GXL file and converts the encoded Hypergraphs first to a 'dot' file and then to the set file format using neato |
   LeaderElectionRuleCreater | When called this Scenario generates the GTS for the leader election example |
   LEQCheckScenario | This Scenario allows to check whether graphs of a given set are represented by another given, upward-closed set |
   MatcherScenario | This scenario takes two sets of graphs and computes all matching from one set to the other |
   RulePreparerTest | This scenario tests the rule preparation functionality |
   ScenarioLoader | This class generates Scenario object from their string identifier (without initializing them) |
   XMLTestScenario | This Scenario tests the GTXLReader and GTXLWriter classes on correctness |
  subgraphs | Contains implementations of classes from the uncover::analysis namespace for the subgraph ordering |
   SubgraphOrder | This class implement the "standard" subgraph ordering |
   SubgraphPOCEnumerator | This enumerator can be used to enumerate all pushout complements of a (partial) rule and a graph |
   SubgraphRulePreparer | This class prepares given rules to be used together with the subgraph order in the backward search |
  test | Contains a collection of unit tests for testing this tools functionality |
 TerminationMessage | Encapsulates a timer, which is started when the TerminationMessage is created |