We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known many industrial instances, even with a great number variables, can be solved by clever solver in reasonable amount time. This not possible, general, classical randomly generated provide different model called \emph{scale-free instances}. based use non-uniform probability distribu...

In this paper we present a new translation from ECTL∗ to SAT and show that the proposed translation substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. We have implemented our new translation and made experimental results, which demonstrate the efficiency of the method. keywords: ECTL∗, translation to SAT, Bounded Model Checking

Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the steps of computation algorithm rigorously, which was mentioned in the paper [1, 2, 3, 5, 7]. For this purpose, we refine the quantum gates treating the SAT pro...

We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics employed by the state-of-the-art sequential SAT checking algorithm. This property makes our parallel SAT checker applicable in a wide range of different application domains. For its distributed execution a combination o...

We introduce Satisfiable Random High Degree Subgraph Isomorphism Generator(SRHD-SGI), a variation of the Satisfiable Random Subgraph Isomorphism Generator (SR-SGI). We use the direct encoding to translate the SRHD-SGI instances into Satisfiable SAT instances. We present empirical evidence that the new model preserves the main characteristics of SAT encoded SR-SGI: easy-hard-easy pattern of evol...

We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions o...

As the physical size of MOSFET has been aggressively scaled-down, impact process-induced random variation (RV) should be considered as one device design considerations MOSFET. In this work, an artificial neural network (ANN) model is developed to investigate effect line-edge roughness (LER)-induced on input/output transfer characteristics (e.g., off-state leakage current (Ioff), subthreshold sl...

We study Random 2-SAT problem, in which 2-CNFs are sampled from a wide range of non-uniform distributions, including heavy-tailed using random model that is quite different the standard uniform 2-SAT. This SAT so-called configuration model, given by distribution ξ for degree (or number occurrences) each variable. To generate formula variable , generating several clones Then 2-clauses created ch...

Quantitative information flow analysis (QIF) is a portfolio of security techniques quantifying the flow of confidential information to public ports. In this paper, we advance the state of the art in QIF for imperative programs. We present both an abstract formulation of the analysis in terms of verification condition generation, logical projection and model counting, and an efficient concrete i...

In this paper, stickers are used to construct a solution space of DNA for the satisfiability (SAT) problem. Simultaneously DNA operations are applied in the sticker-based model to develop a DNA algorithm. The result of the proposed algorithm shows that the SAT problem is resolved with biological operation in the sticker-based model for solution space of sticker. Furthermore, this work presents ...