UnCoVer (Using Coverability for Verification)
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Pages
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]
oNstd
|\Chash< unordered_set< T > >Defines the hash of an unordered_set as the xor of all elements of the set
oNuncoverThe main namespace for the Uncover tool
|oNanalysisThis namespace is a collection of all classes specifically used for the (backwards) analysis
||oCBackwardAnalysisThis class performs a backward search to solve the coverability problem with respect to a given Order
||oCBackwardResultHandlerThe BackwardResultHandler is an interface to handle intermediate results produced by the backward search
||oCInstantWriterResultHandlerThe InstantWriterResultHandler implements the BackwardResultHandler by writing the given information as soon as possible to the filesystem
||oCMinPOCEnumeratorThis abstract class serves as a schema of an enumerator taking a rule and a graph and enumerating all minimal pushout complements wrt
||oCNoRulePreparerThis RulePreparer returns all rules unprepared
||oCPreparedGTSGraph transformation system that was prepared for use in the backward procedure
|||oCStdRuleMapCBThe StdRuleMapCB is a helper class defining a CollectionCallback to a PreparedGTS standard rule map
|||\Cuqinst_iteratorThe uqinst_iterator generates UQRuleInstances for backward application
||\CRulePreparerThis class takes a rule and prepares it such that no special case handling is necessary while performing the analysis
|oNbasic_typesContains a collection of general classes used through out the tool
||oCCollectionCallbackThis template provides a possibility to add elements to a collection without having a reference to the collection of knowing its type
||oCGenericMessageExceptionThis class serves as a superclass of all Exceptions
||oCIDPartitionPointerHasherA hasher for pointers to IDPartions
||oCIDPartitionPointerEqualityAn equality checker for pointers to IDPartitions
||oCIDPartitionEnumeratorProvides a possibility to enumerate all partitions on a given set of IDs
||oCInitialisationExceptionThis exception is thrown if an object could not be initialized successfully
||oCInvalidInputExceptionThis exception is thrown whenever a function is called with invalid inputs
||oCInvalidStateExceptionThis exception is thrown if a function of an object was called, but the object was not in a valid state to call this function
||oCOrderThis class presents a generic ordering relation on Hypergraphs
||oCOutOfIDsExceptionThis exception is thrown if an object was about to be created, but the programm has run out of unique IDs
||oCRunExceptionThis exception is thrown if an algorithm or Scenario was executed, but encountered and error
||oCScenarioA scenario is a subprogram using a set of input parameters to execute some algorithms, producing desired output
||oCStreamableStreamable provides a streaming function which must be implemented by any deriving class
||oCTimerProvides a timer, which can be started and used to measure elapsed time
||\CVectorCallbackThis template class implements a CollectionCallback to a vector
|oNgraphsContains all classes and definitions for graphs, mappings between graphs, rules and graph transformation systems
||oCAnonHypergraphAn AnonHypergraph is a data structure storing a hypergraph
||oCAnonRuleAnonRule serves as a data structure of a rule object
||oCEdgeThis class represents an edge in a Hypergraph
||oCGTSData structure for a graph transformation system
||oCHypergraphA Hypergraph represents a graph with a unique identifier
||oCIsomorphismCheckerChecks whether two given Hypergraphs are isomorphic or not
||oCMappingThis is the data structure representing a morphism mapping from a graph to another graph
||oCMinGraphListThis data structure stores a collection of graphs minimal to some given order
||oCPathCheckerFunctions to compute whether given graphs have paths of a defined length
||oCRuleRepresents the data structure for a rule including a unique identifier
||oCSignatureCreaterThe SignatureCreater provides functions to generate signatures for Hypergraphs
||oCUQRuleThis class serves as data structure of a universally quantified rule
||oCUQRuleInstanceThe UQRuleInstance is a rule which is generated when UQRules are instantiated
||\CVertexVertex stores all data of a vertex in a Hypergraph
|oNioContains all classes and definitions used for importing and exporting graphs and graph transformation systems in any way
||oCGraphDrawerThis class provides static methods for Converting GXL files to the 'dot' format
||oCGTXLReaderThis class imports GXL or GTXL XML files and converts them to Hypergraph and GTS objects respectively
||oCGTXLReaderXercesThis class imports GXL or GTXL XML files and converts them to Hypergraph and GTS objects respectively
||oCGTXLWriterThis class exports GXL or GTXL XML files by converting them from Hypergraph and GTS objects respectively
||oCGTXLWriterXercesThis class exports GXL or GTXL XML files by converting them from Hypergraph and GTS objects respectively
||oCLatexExporterProvides a possibility to generate Latex files from GTS objects or graph sets
||oCSafeXTStringThis template provides a container which automatically releases a transcoded string, when the pointer runs out of scope
||oCSafeXResThis template provides a container which automatically release a given Xerces resource, when the pointer runs out of scope
||oCXercesLoggingErrorHandlerPrints errors generated by the Xerces framework
||\CXMLioExceptionThis exception is thrown if an error occurred while importing or exporting XML documents
|oNloggingContains classes used for handling logging
||oCDelayedLogMessageThis class stores a log message and sends it at the end of the scope in which it was defined
||oCMessageLoggerThis class is used to stream log messages
||oCMultiStream
||\CMultiStreamBuffer
|oNminorsContains implementations of classes from the uncover::analysis namespace for the minor ordering
||oCMinorOrderThis 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)
||oCMinorPOCEnumeratorImplements the abstract MinPOCEnumerator class for the minor ordering
||oCMinorRulePreparerThis class prepares given rules to be used together with the minor order in the backward search
||\COldMinorOrderThis class is an old implementation of the Hypergraph Minor Ordering based on searching for disjoint paths
|| oCPathFinderSearching for paths between two vertices
|| |\CQueueEl
|| \CtwoIDLists
|oNrule_engineContains basic classes for applying rules
||oCExpEnumeratorThis class represents a number over a variable base with a fixed length
||oCIDClosureEnumeratorThis 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
||oCIDtoIDEnumeratorThis enumerator encapsulates a mapping of an ID to a set of IDs
||oCPartialPOCEnumeratorThe PartialPOCEnumerator computes a subset of all pushout complement of a partial rule and a total match
||oCStdMatchFinderStdMatchFinder provides a simple algorithm which takes two arbitrary graphs and calculates all matchings from one to the other
||\CTotalPOCEnumeratorThis enumerator computes all pushout complements for all co-matches from a total (given) rule to a given graph
|oNscenariosContains all Scenarios predefined for this tool
||oCBackwardAnalysisScenarioThis Scenario performs a backward analysis according to the provided parameters
||oCBackwardStepTestThis test scenario takes a given set of rules and a given set of error graphs and performs a single backward step, including rule preparation
||oCGTXLtoLatexConverterUse this Scenario to create a graphical representation of the given GTXL file
||oCGXLtoPicConverterThis Scenario takes a GXL file and converts the encoded Hypergraphs first to a 'dot' file and then to the set file format using neato
||oCLeaderElectionRuleCreaterWhen called this Scenario generates the GTS for the leader election example
||oCLEQCheckScenarioThis Scenario allows to check whether graphs of a given set are represented by another given, upward-closed set
||oCMatcherScenarioThis scenario takes two sets of graphs and computes all matching from one set to the other
||oCRulePreparerTestThis scenario tests the rule preparation functionality
||oCScenarioLoaderThis class generates Scenario object from their string identifier (without initializing them)
||\CXMLTestScenarioThis Scenario tests the GTXLReader and GTXLWriter classes on correctness
|oNsubgraphsContains implementations of classes from the uncover::analysis namespace for the subgraph ordering
||oCSubgraphOrderThis class implement the "standard" subgraph ordering
||oCSubgraphPOCEnumeratorThis enumerator can be used to enumerate all pushout complements of a (partial) rule and a graph
||\CSubgraphRulePreparerThis class prepares given rules to be used together with the subgraph order in the backward search
|\NtestContains a collection of unit tests for testing this tools functionality
\CTerminationMessageEncapsulates a timer, which is started when the TerminationMessage is created