Sciweavers

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

24

CHARME
2003
Springer

favoriteEmaildiscussreport

87views Hardware» more CHARME 2003»

Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking

14 years 4 months ago

Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking

Download www.cs.wmich.edu

Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav

Real-time Traffic

CHARME 2003 |

claim paper

Related Content

» Symbolic Step Encodings for Object Based Communicating State Machines

» Distributed BDDbased BMC for the verification of multiagent systems

» Bounded Parametric Verification for Distributed Time Petri Nets with DiscreteTime Semantic...

» Behavioral consistency of C and verilog programs using bounded model checking

» Leveraging Belief Propagation Backtrack Search and Statistics for Model Counting

» Model Checking for a Class of Performance Properties of Fluid Stochastic Models

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CHARME
Authors	Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar

Comments (0)