PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications

Sinz, Carsten; Blochinger, Wolfgang; Küchlin, Wolfgang

doi:10.1016/s1571-0653(04)00323-3

Cited by 47 publications

(34 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since we mainly stayed within propositional (Boolean) logic, we had powerful industrial strength decision procedures at our disposal: advanced SAT-checking algorithms and normal form representations using BDDs. There is even some leeway here, because we did not have to resort to our parallel SAT-checker [30] yet. In those cases where our validation lemmas did not hold, we represented the error conditions as concise BDDs and could then trace the problem back from the model to error states of the original rule system.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Detection of dynamic execution errors in IBM system automation's rule-based expert system

Sinz

Lumpp

Schneider

et al. 2002

Information and Software Technology

Self Cite

View full text Add to dashboard Cite

We formally verify aspects of the rule-based expert system of IBM's System Automation software for IBM's zSeries mainframes. Starting with a formalization of the expert system in Propositional Dynamic Logic (PDL), we encode termination and determinism properties in PDL and its extension ¥ PDL. We then translate our decision problems to propositional logic and apply advanced SAT techniques for automated proofs. In order to locate real program bugs for each failed proof attempt, we apply extra formalization steps and represent propositional error formulae in concise normal form as Binary Decision Diagrams (BDDs). In our experiments, we revealed residual non-termination bugs in a tested program version close to shipment, and, after correcting them, we formally verified the absence of this class of bugs in the production code.

show abstract

Section: Resultsmentioning

confidence: 99%

“…At one time, conversion to conjunctive normal form was a real problem for BIS until a new prover [16] was developed. We also parallelized our algorithms [30], but we did not yet apply parallelism in industry.…”

Section: Industrial Experiences Summarymentioning

confidence: 99%

Detection of dynamic execution errors in IBM system automation's rule-based expert system

Sinz

Lumpp

Schneider

et al. 2002

Information and Software Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…PaSAT [31] is a parallel DPLL procedure exploiting look-back techniques. It uses the same load balancing technique as PSATO but exchanges lemmas learned during the search among processors.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, several distributed/parallel systematic SAT solvers have been developed such as Böhm and Speckenmeyer Parallel Solver [2], PSATO [35], PaSAT [31] and PSolver [16] to exploit the power of networked computers. In all these approaches, a formula is dynamically divided into subformulas which are then distributed among processors.…”

Section: Introductionmentioning

confidence: 99%

A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

Jurkowiak

Utard

2005

J Autom Reasoning

View full text Add to dashboard Cite

Abstract. Due to the inherent N P -completeness of SAT, many SAT problems currently cannot be solved in a reasonable time. Usually, to tackle a new class of SAT problems, new ad-hoc algorithm must be designed. Another way to solve a new problem is to use a generic solver and employ parallelism to reduce the solve time.In this paper we propose a parallelization scheme for a class of SAT solvers based on the DPLL procedure. The scheme uses dynamic load balancing mechanism based on the work stealing techniques to deal with the irregularity of SAT problems. We parallelize Satz, one of the best generic SAT solvers, with the scheme to obtain a parallel solver called PSatz. The first experimental results on random 3-SAT and a set of well-known structured problems show the efficiency of PSatz. PSatz is freely available and runs on any networked workstations under Unix/Linux.

show abstract

“…Such methods combine also with clause learning [16]. The techniques in grid-like environments have been investigated, for example, in [17,18,19,20]. The guiding path method is further developed in [21].…”

Section: Introductionmentioning

confidence: 99%

Strategies for Solving SAT in Grids by Randomized Search

Hyvärinen¹,

Junttila²,

Niemelä³

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this paper we develop strategies for solving collections of hard instances of the propositional satisfiability problem (SAT) with a randomized SAT solver run in a Grid. We study alternative strategies by using a simulation framework which is composed of (i) a grid model capturing the communication and management delays, and (ii) run-time distributions of a randomized solver, obtained by running a state-of-the-art SAT solver on a collection of hard instances. The results are experimentally validated in a production level Grid. When solving a single hard SAT instance, the results show that in practice only a relatively small amount of parallelism can be efficiently used; the speedup obtained by increasing parallelism thereafter is negligible. This observation leads to a novel strategy of using grid to solve collections of hard instances. Instead of solving instances one-by-one, the strategy aims at decreasing the overall solution time by applying an alternating distribution schedule.

show abstract

PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications

Cited by 47 publications

References 11 publications

Detection of dynamic execution errors in IBM system automation's rule-based expert system

Detection of dynamic execution errors in IBM system automation's rule-based expert system

A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

Strategies for Solving SAT in Grids by Randomized Search

Contact Info

Product

Resources

About