Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification

Kaiss, Daher; Skaba, Marcelo; Hanna, Ziyad; Khasidashvili, Zurab

doi:10.1109/fmcad.2007.4401978

“…We are also planing to investigate if simulation distances [10] can be used to find a semantically close repair. Finally, we are planing to continue our experiments with model checkers specialized in solving the sequential equivalence checking problem [28,29]. We believe that such solvers perform well on our problem, because M and M have many similar structures.…”

Section: Resultsmentioning

confidence: 97%

Program repair without regret

Essen

¹

,

Jobstmann

²

2015

Form Methods Syst Des

View full text Add to dashboard Cite

We present a new and flexible approach to repair reactive programs with respect to a specification. The specification is given in linear-temporal logic. Like in previous approaches, we aim for a repaired program that satisfies the specification and is syntactically close to the faulty program. The novelty of our approach is that it produces a program that is also semantically close to the original program by enforcing that a subset of the original traces is preserved. Intuitively, the faulty program is considered to be a part of the specification, which enables us to synthesize meaningful repairs, even for incomplete specifications. Our approach is based on synthesizing a program with a set of behaviors that stay within a lower and an upper bound. We provide an algorithm to decide if a program is repairable with respect to our new notion, and synthesize a repair if one exists. We analyze several ways to choose the set of traces to leave intact and show the boundaries they impose on repairability. We also discuss alternative notions based on reward models to obtain repair systems that behave similar to the original system. We have evaluated the approach on several examples.

show abstract

“…The propositional satisfiability problem (SAT) is one of the most studied N P-complete problems in computer science. One reason is the wide range of SAT's practical applications ranging from hardware verification to planning and scheduling [1,2,3]. Given a propositional formula in conjunctive normal form (CNF), the SAT-problem consists in finding an assignment for the variables such that all clauses are satisfied.…”

Section: Introductionmentioning

confidence: 99%

Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning

Balint¹,

Manthey²

EPiC Series in Computing

View full text Add to dashboard Cite

Preprocessing techniques are crucial for SAT solvers when it comes to reaching state-of-the-art performance as it was shown by the results of the last SAT Competitions. Theusefulness of a preprocessing technique depends highly on its own parameters, on the in-stances on which it is applied and on the used solver. In this paper we first give an extendedanalysis of the performance gain reached by using different preprocessing techniques in-dividually in combination with CDCL solvers on application instances and SLS solverson crafted instances. Further, we provide an analysis of combinations of preprocessingtechniques by means of automated algorithm configuration, where we search for optimalpreprocessor configurations for different scenarios. Our results show that the performanceof CDCL and especially of SLS solvers can be further improved when using appropriatepreprocessor configurations. The solvers augmented with the best found preprocessingconfigurations outperform the original solvers on the instances from the SAT Challenge2012, achieving new state-of-the-art results.

show abstract

Program Repair without Regret

Essen

¹

,

Jobstmann

²

2013

Computer Aided Verification

View full text Add to dashboard Cite

We present a new and flexible approach to repair reactive programs with respect to a specification. The specification is given in linear-temporal logic. Like in previous approaches, we aim for a repaired program that satisfies the specification and is syntactically close to the faulty program. The novelty of our approach is that it produces a program that is also semantically close to the original program by enforcing that a subset of the original traces is preserved. Intuitively, the faulty program is considered to be a part of the specification, which enables us to synthesize meaningful repairs, even for incomplete specifications. Our approach is based on synthesizing a program with a set of behaviors that stay within a lower and an upper bound. We provide an algorithm to decide if a program is repairable with respect to our new notion, and synthesize a repair if one exists. We analyze several ways to choose the set of traces to leave intact and show the boundaries they impose on repairability. We also discuss alternative notions based on reward models to obtain repair systems that behave similar to the original system. We have evaluated the approach on several examples.

show abstract

Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification

Cited by 3 publications

References 0 publications

Program repair without regret

Program repair without regret

Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning

Program Repair without Regret

Contact Info

Product

Resources

About