Reachability analysis using partitioned-ROBDDs

Narayan,; Isles,; Jain,; Sangiovanni-Vincentelli, A.

doi:10.1109/iccad.1997.643565

Cited by 68 publications

(59 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…an ordering of the conjunctions which minimizes the number of peak variables 11,19 . There has also been an interest in using disjunctive partitions of the transition relations and state sets 8,18,17 , which e ectively splits the image computation into smaller subproblems.…”

Section: Bdd-based Methodsmentioning

confidence: 99%

SAT-Based Image Computation with Application in Reachability Analysis

Gupta¹,

Yang²,

Ashar³

et al. 2000

Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

Abstract. 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 test. Existing BDD-based symbolic algorithms for image computation are limited by memory resources in practice, while SAT-based algorithms that can obtain the image by e n umerating satisfying assignments to a CNF representation of the Boolean relation are potentially limited by time resources. We propose new algorithms that combine BDDs and SAT i n order to exploit their complementary bene ts, and to o er a mechanism for trading o space vs. time. In particular, 1 our integrated algorithm uses BDDs to represent the input and image sets, and a CNF formula to represent the Boolean relation, 2 a fundamental enhancement called BDD Bounding is used whereby the SAT solver uses the BDDs for the input set and the dynamically changing image set to prune the search space of all solutions, 3 BDDs are used to compute all solutions below i n termediate points in the SAT decision tree, 4 a ne-grained variable quanti cation schedule is used for each BDD subproblem, based on the CNF representation of the Boolean relation. These enhancements coupled with more engineering heuristics lead to an overall algorithm that can potentially handle larger problems. This is supported by our preliminary results on exact reachability analysis of ISCAS benchmark circuits.

show abstract

Section: Bdd-based Methodsmentioning

confidence: 99%

SAT-Based Image Computation with Application in Reachability Analysis

Gupta¹,

Yang²,

Ashar³

et al. 2000

Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…If the slicing choice is poor, many duplicate nodes may exist. In fact, it is generally agreed that finding a good slicing is not trivial [23].…”

Section: Related Workmentioning

confidence: 99%

Speculative Image Computation for Distributed Symbolic Reachability Analysis

Chung

Ciardo

2009

Journal of Logic and Computation

View full text Add to dashboard Cite

The Saturation-style fixpoint iteration strategy for symbolic reachability analysis is particularly effective for globally asynchronous locally synchronous discrete-state systems. However, its inherently sequential nature makes it difficult to parallelize Saturation on a network workstations (NOW). We then propose the idea of using idle workstation time to perform speculative image computations. Since an unrestrained prediction may make excessive use of computational resources, we introduce a history-based approach to dynamically recognize image computation (event firing) patterns and explore only firings that conform to these patterns. In addition, we employ an implicit encoding for the patterns, so that the actual image computation history can be efficiently preserved. Experiments not only show that image speculation works on a realistic model, but also indicate that the use of an implicit encoding together with two heuristics results in a better informed speculation.

show abstract

“…Reducing the space requirement in model checking has been suggested in several works [20][21][22]. These studies suggest partitioning the problem in several ways.…”

Section: Related Workmentioning

confidence: 99%

“…The process performs a reachability algorithm on its own slice. In [22], a single computer is used to handle one task at a time, while the other tasks are kept in external memory. In another paper [23], the author suggested a possibility of distributing SAT-based BMC but has not explored the feasibility of such an approach.…”

Section: Related Workmentioning

confidence: 99%

Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking

Ganai¹,

Gupta²,

Yang³

et al. 2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. SAT-based Bounded Model Checking (BMC), though a robust and scalable verification approach, still is computationally intensive, requiring large memory and time. Interestingly, with the recent development of improved SAT solvers, it is frequently the memory limitation of a single server rather than time that becomes a bottleneck for doing deeper BMC search. Distributing computing requirements of BMC over a network of workstations can overcome the memory limitation of a single server, albeit at increased communication cost. In this paper, we present: a) a method for distributed-SAT over a network of workstations using a Master/Client model where each Client worsktation has an exclusive partition of the SAT problem and uses knowledge of partition topology to communicate with other Clients, b) a method for distributing SATbased BMC using the distributed-SAT. For the sake of scalability, at no point in the BMC computation does a single workstation have all the information. We experimented on a network of heterogenous workstations interconnected with a standard Ethernet LAN. To illustrate, on an industrial design with ~13K FFs and ~0.5M gates, the non-disributed BMC on a single workstation (with 4 Gb memory) ran out of memroy after reaching a depth of 120; on the otherhand, our SAT-based distributed BMC over 5 similar workstations was able to go upto 323 steps with a communication overhead of only 30%.

show abstract

Reachability analysis using partitioned-ROBDDs

Abstract: In this paper, we address the problem of finite state machine (FSM)

Cited by 68 publications

References 29 publications

SAT-Based Image Computation with Application in Reachability Analysis

SAT-Based Image Computation with Application in Reachability Analysis

Speculative Image Computation for Distributed Symbolic Reachability Analysis

Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking

Contact Info

Product

Resources

About