-
part.h
- External header file
-
partInt.h
- Internal header file
-
partConj.c
- Conjunctively partitioned functions
-
partCuPlus.c
- Recursive Functions for Disjunctive Partitioning.
This functions rely on the ddi package.
-
partCudd.c
- Functions for Disjunctive and Conjunctive Partitioning
as implemented in the Cudd package.
-
partDisj.c
- Functions for Disjunctive Partitioning.
-
partUtil.c
- Utility Functions for the Partitioning Package
part.h
External header file
By: Gianpiero Cabodi and Stefano Quer
partInt.h
Internal header file
By: Gianpiero Cabodi and Stefano Quer
partConj.c
Conjunctively partitioned functions
By: Gianpiero Cabodi and Stefano Quer
-
Part_DdMultiwayLinearAndExist()
- Compute the multiway and-exist over a conjunctively partitioned
function
-
Part_DdArrayMultiwayLinearAndExist()
- Computes the product of function and take existential
abstraction
-
Part_DdDisjSuppPart()
-
partCuPlus.c
Recursive Functions for Disjunctive Partitioning.
This functions rely on the ddi package.
By: Gianpiero Cabodi and Stefano Quer
External procedures included in this file:
- Part_EstimateCofactor
- Part_EstimateCofactorComplex
- Part_EstimateCofactorFast
- Part_EstimateCofactorFreeOrder
Static procedures included in this module:
- partEstimateCofactor
- partEstimateCofactorComplex
- partEstimateCofactorFast
- partEstimateCofactorFreeOrder
- ddFlagClear
-
Part_EstimateCofactor()
- Counts the number of nodes of the cofactors:
Stefano Quer solution.
-
Part_EstimateCofactorComplex()
- Counts the number of nodes of the cofactors:
Fabio Somenzi Private Commnunication Solution.
-
Part_EstimateCofactorFast()
- Count the number of nodes of the cofactors using the fast
heuristic (TCAD'99)
-
Part_EstimateCofactorFreeOrder()
- Count the number of nodes of the cofactors using the Free
Order heuristic (TCAD'99).
-
partEstimateCofactor()
- Performs the recursive step of Part_EstimateCofactor
-
partEstimateCofactorComplex()
- Performs the recursive step of Part_EstimateCofactor
-
partEstimateCofactorFast()
- Performs the recursive step of fsCntNodesVar
-
partEstimateCofactorFreeOrder()
- Performs the recursive step of fsCntNodesVar
-
ddFlagClear()
- Performs a DFS from f, clearing the LSB of the next
pointers.
partCudd.c
Functions for Disjunctive and Conjunctive Partitioning
as implemented in the Cudd package.
By: Gianpiero Cabodi and Stefano Quer
This file contains interface function to linked with the
standard cudd partitionin routines.
-
Part_PartitionSetCudd()
- Partition a state set
-
partPartitionCudd()
- Direct call to cudd partitioning functions.
partDisj.c
Functions for Disjunctive Partitioning.
By: Gianpiero Cabodi and Stefano Quer
-
Part_PartitionSetInterface()
- Interface Routine to Partition a state set
-
Part_PartitionDisjSet()
- Partition a state set
-
partPartitionDisjSet()
- Splitting a set
-
exactCofactor()
- Counts the number of nodes of the cofactors
-
estimateCofactor()
- Calls function for to count the number of nodes of the
cofactors: ICCAD'96 original solution
-
varSelectionFast()
- Call function for to count the number of nodes of the
cofactors: TCAD'99 fast solution
-
estimateCofactorComplex()
- Calls function for to count the number of nodes of the
cofactors: Fabio Somenzi Private Communication Solution
-
estimateCofactorFreeOrder()
- Calls function for to count the number of nodes of the
cofactors: Free BDD Solution
-
comparisonRoutine()
- Comparison between cofactor, stq, fs solution
-
estimateCost()
- Evaluating estimateCost of splitting choice
-
estimateCostFreeOrder()
- Select the best splitting variable
-
varSelection()
- Selects the best splitting variable
-
varSelectionManual()
- Manual selection of best splitting variable
partUtil.c
Utility Functions for the Partitioning Package
By: Gianpiero Cabodi and Stefano Quer
-
Part_MethodString2Enum()
- Given a string it Returns an Enumerated type
-
Part_MethodEnum2String()
- Given an Enumerated type Returns a string.
Last updated on 990617 11h53