ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
cecProve.c File Reference
#include <math.h>
#include "aig/gia/gia.h"
#include "aig/gia/giaAig.h"
#include "sat/bmc/bmc.h"
#include "proof/pdr/pdr.h"
#include "proof/cec/cec.h"
#include "proof/ssw/ssw.h"
Include dependency graph for cecProve.c:

Go to the source code of this file.

Functions

ABC_NAMESPACE_IMPL_START int Ssw_RarSimulateGia (Gia_Man_t *p, Ssw_RarPars_t *pPars)
 DECLARATIONS ///.
 
int Bmcg_ManPerform (Gia_Man_t *pGia, Bmc_AndPar_t *pPars)
 
int Cec_GiaProveTest (Gia_Man_t *p, int nProcs, int nTimeOut, int nTimeOut2, int nTimeOut3, int fVerbose, int fVeryVerbose, int fSilent)
 

Function Documentation

◆ Bmcg_ManPerform()

int Bmcg_ManPerform ( Gia_Man_t * pGia,
Bmc_AndPar_t * pPars )
extern

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 445 of file bmcBmcG.c.

446{
447 pPars->nProcs = 1;
448 return Bmcg_ManPerformOne( pGia, pPars );
449}
int Bmcg_ManPerformOne(Gia_Man_t *pGia, Bmc_AndPar_t *pPars)
Definition bmcBmcG.c:357
int nProcs
Definition bmc.h:152
Here is the call graph for this function:

◆ Cec_GiaProveTest()

int Cec_GiaProveTest ( Gia_Man_t * p,
int nProcs,
int nTimeOut,
int nTimeOut2,
int nTimeOut3,
int fVerbose,
int fVeryVerbose,
int fSilent )

Definition at line 54 of file cecProve.c.

54{ return -1; }

◆ Ssw_RarSimulateGia()

ABC_NAMESPACE_IMPL_START int Ssw_RarSimulateGia ( Gia_Man_t * p,
Ssw_RarPars_t * pPars )
extern

DECLARATIONS ///.

CFile****************************************************************

FileName [cecSplit.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Combinational equivalence checking.]

Synopsis [Cofactoring for combinational miters.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id
cecSplit.c,v 1.00 2005/06/20 00:00:00 alanmi Exp

]

Function*************************************************************

Synopsis [Perform sequential simulation.]

Description []

SideEffects []

SeeAlso []

Definition at line 1188 of file sswRarity.c.

1189{
1190 Aig_Man_t * pAig;
1191 int RetValue;
1192 if ( pPars->fUseFfGrouping )
1193 {
1194 Vec_Int_t * vPerm = Ssw_RarRandomPermFlop( Gia_ManRegNum(p), 10 );
1195 Gia_Man_t * pTemp = Gia_ManDupPermFlopGap( p, vPerm );
1196 Vec_IntFree( vPerm );
1197 pAig = Gia_ManToAigSimple( pTemp );
1198 Gia_ManStop( pTemp );
1199 }
1200 else
1201 pAig = Gia_ManToAigSimple( p );
1202 RetValue = Ssw_RarSimulate( pAig, pPars );
1203 // save counter-example
1204 Abc_CexFree( p->pCexSeq );
1205 p->pCexSeq = pAig->pSeqModel; pAig->pSeqModel = NULL;
1206 Aig_ManStop( pAig );
1207 return RetValue;
1208}
void Aig_ManStop(Aig_Man_t *p)
Definition aigMan.c:187
typedefABC_NAMESPACE_HEADER_START struct Aig_Man_t_ Aig_Man_t
INCLUDES ///.
Definition aig.h:50
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
Definition bblif.c:37
Cube * p
Definition exorList.c:222
Aig_Man_t * Gia_ManToAigSimple(Gia_Man_t *p)
Definition giaAig.c:408
void Gia_ManStop(Gia_Man_t *p)
Definition giaMan.c:82
Gia_Man_t * Gia_ManDupPermFlopGap(Gia_Man_t *p, Vec_Int_t *vFfPerm)
Definition giaDup.c:1026
struct Gia_Man_t_ Gia_Man_t
Definition gia.h:96
int Ssw_RarSimulate(Aig_Man_t *pAig, Ssw_RarPars_t *pPars)
Definition sswRarity.c:973
Vec_Int_t * Ssw_RarRandomPermFlop(int nFlops, int nUnused)
Definition sswRarity.c:1152
int fUseFfGrouping
Definition ssw.h:114
void Abc_CexFree(Abc_Cex_t *p)
Definition utilCex.c:382
Here is the call graph for this function: