Sciweavers

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

9

ASPDAC
2004
ACM

favoriteEmaildiscussreport

112views Hardware» more ASPDAC 2004»

Efficient reachability checking using sequential SAT

13 years 8 months ago

Efficient reachability checking using sequential SAT

Download cadlab.ece.ucsb.edu

Abstract

Ganapathy Parthasarathy, Madhu K. Iyer, Kwang-Ting

Real-time Traffic

ASPDAC 2004 | Conflict-based Learning | Hardware | Sequential Search | Sequential Search Techniques |

claim paper

Related Content

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» Memory Efficient AllSolutions SAT Solver and Its Application for Reachability Analysis

» Detecting State Coding Conflicts in STG Unfoldings Using SAT

» A Universal Parallel SAT Checking Kernel

» Mixed symbolic representations for model checking software programs

» Program Slicing for ATPGBased Property Checking

» Generation of shorter sequences for high resolution error diagnosis using sequential SAT

» Bounded Model Checking with QBF

» Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Pla...

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	ASPDAC
Authors	Ganapathy Parthasarathy, Madhu K. Iyer, Kwang-Ting Cheng, Li-C. Wang

Comments (0)