Sciweavers

34 search results - page 1 / 7
» Symbolic Reachability Analysis Based on SAT-Solvers
Sort
View
FMCAD
2004
Springer
13 years 11 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
FMCAD
2004
Springer
14 years 19 days ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
FMCAD
2000
Springer
13 years 11 months ago
SAT-Based Image Computation with Application in Reachability Analysis
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Anubhav G...
ICCAD
2010
IEEE
119views Hardware» more  ICCAD 2010»
13 years 5 months ago
Symbolic system level reliability analysis
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...
Michael Glaß, Martin Lukasiewycz, Felix Reim...
AIPS
2000
13 years 8 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...