Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ATS
2010
IEEE

favoriteEmaildiscussreport

239views Hardware» more ATS 2010»

Mining Complex Boolean Expressions for Sequential Equivalence Checking

13 years 2 months ago

Mining Complex Boolean Expressions for Sequential Equivalence Checking

Download people.cs.vt.edu

Neha Goel, Michael S. Hsiao, Naren Ramakrishnan, M

Real-time Traffic

ATS 2010 | Hardware |

claim paper

Related Content

» Mixed symbolic representations for model checking software programs

» LTL Path Checking Is Efficiently Parallelizable

» An Algorithm for Deciding BAPA Boolean Algebra with Presburger Arithmetic

» Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking

» Analyzing recursive programs using a fixedpoint calculus

» Automatic Verification of Safety and Liveness for XScaleLike Processor Models Using WEB Re...

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	ATS
Authors	Neha Goel, Michael S. Hsiao, Naren Ramakrishnan, Mohammed J. Zaki

Comments (0)