Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Velev, Miroslav N.; Bryant, Randal E.

doi:10.1145/378239.378469

Cited by 42 publications

(10 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, our streaming method cannot be directly applied to the symbolic model checking [5] which requires quantification operations. However, the SAT-based design verification/validation method has become a hot topic in recent years [21], [2], [16], [25], and there will be many applications that do not need quantification.…”

Section: Resultsmentioning

confidence: 99%

“…For instance, graph coloring, the minimum flow, unate and binate covering are popular examples. SAT-based design verification/validation has also become a hot topic [21], [2], [16], [25] in recent years.…”

Section: Experiments For Solving a Sat Problemmentioning

confidence: 99%

“…In recent years, Davis-Putnam backtrack procedures have shown a remarkable improvement [16], [25], and reports show that backtracking is much faster than the BDD-based method for most SAT benchmarks. The NQueens problem falls into the same category.…”

Section: Experiments For Solving a Sat Problemmentioning

confidence: 99%

See 2 more Smart Citations

Streaming BDD manipulation

Minato

2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

AbstractÐBinary Decision Diagrams (BDDs) are now commonly used for handling Boolean functions because of their excellent efficiency in terms of time and space. However, the conventional BDD manipulation algorithm is strongly based on the hash table technique, so it always encounters the memory overflow problem when handling large-scale BDD data. This paper proposes a new streaming BDD manipulation method that never causes memory overflow or swap out. This method allows us to handle very largescale BDD stream data beyond the memory limitation. Our method can be characterized as follows: 1) it gives a continuous tradeoff curve between memory usage and stream data length, 2) valid solutions for a partial Boolean space can be obtained if we break the process before finishing, and 3) easily accelerated by pipelined multiprocessing. An experimental result demonstrates that we can succeed in finding a number of solutions to a SAT problem using commodity PC with a 64 MB memory, where as the conventional BDD manipulator would have required a 100GB memory. BDD manipulation has been considered as an intensively memoryconsuming procedure, but now we can also utilize the hard disk and network resources as well. The method leads to a new approach to BDD manipulation.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Experiments For Solving a Sat Problemmentioning

confidence: 99%

See 1 more Smart Citation

Streaming BDD manipulation

Minato

2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…As a result, a polynomial-time algorithm is unlikely for the GI problem. Nevertheless, in practice, there are several efficient algorithms and software packages for finding automorphisms of graphs, e.g., NAUTY [14], [15], BLISS [16], [17], SAUCY [18], [19], [20], and NISHE [21]. For some special cases of graphs, e.g., tree graphs [22], polynomial-time algorithms exist.…”

Section: Introductionmentioning

confidence: 99%

Maximum Exploratory Equivalence in Trees

Fürst

Cibej

Mihelič

2015

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-Many practical problems are modeled with networks and graphs. Their exploration is of significant importance, and several graph-exploration algorithms already exist. In this paper, we focus on a type of vertex equivalence, called exploratory equivalence, which has a great potential to speed up such algorithms. It is an equivalence based on graph automorphisms and can, for example, help us in solving the subgraph isomorphism problem, which is a well-known NP -hard problem. In particular, if a given pattern graph has nontrivial automorphisms, then each of its nontrivial exploratory equivalent classes gives rise to a set of constraints to prune the search space of solutions. In the paper, we define the maximum exploratory equivalence problem. We show that the defined problem is at least as hard the graph isomorphism problem. Additionally, we present a polynomial-time algorithm for solving the problem when the input is restricted to tree graphs. Furthermore, we show that for trees, a maximum exploratory equivalent partition leads to a globally optimal set of subgraph isomorphism constraints, whereas this is not necessarily the case for general graphs.

show abstract

“…However, many large instances of SAT generated from real life problems can be successfully solved by heuristic SAT solvers. For example, SAT solvers find application in AI planning [2], circuit testing [3], software verification [4], microprocessor verification [5], model checking [6], etc. This has motivated research in efficient heuristic SAT solvers.…”

Section: Introductionmentioning

confidence: 99%

Zchaff2004: An Efficient SAT Solver

Mahajan

Malik

2005

Lecture Notes in Computer Science

111

View full text Add to dashboard Cite

Abstract. The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, the problem has found many practical applications in recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances has enabled the use of SAT solvers in diverse domains such as electronic design automation and artificial intelligence. These applications continue to motivate the development of faster and more robust SAT solvers. In this paper, we describe the popular SAT solver zchaff with a focus on recent developments.

show abstract

Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Cited by 42 publications

References 44 publications

Streaming BDD manipulation

Streaming BDD manipulation

Maximum Exploratory Equivalence in Trees

Zchaff2004: An Efficient SAT Solver

Contact Info

Product

Resources

About