This paper discusses our methodology for formal analysis and automatic verification of software programs. It is currently applicable to a large subset of the C programming language that includes bounded recursion. We consider reachability properties, in particular whether certain assertions or basic blocks are reachable in the source code. We perform this analysis via a translation to a Boolean...

Abstract geometrical computation can solve NP-complete problems e ciently: any boolean constraint satisfaction problem, instance of SAT, can be solved in bounded space and time with simple geometrical constructions involving only drawing parallel lines on a Euclidean space-time plane. Complexity as the maximal length of a sequence of consecutive segments is quadratic. The geometrical algorithm ...

During the last eight years, tremendous progress was made in the field of Boolean Satisfiability (SAT). Now SAT solvers are 4 to 5 orders of magnitude faster, and can solve formulas that are 4 to 5 orders of magnitude bigger. SAT is the enabling technology for formal verification—the mathematical proof of correctness of computer systems. Statistics from industrial circuit designs indicate that ...

Macromolecular assemblies play critical roles in regulating cellular functions. The cysteine synthase complex (CSC), which is formed by association of serine O-acetyltransferase (SAT) and O-acetylserine sulfhydrylase (OASS), acts as a sensor and modulator of thiol metabolism by responding to changes in nutrient conditions. Here we examine the oligomerization and energetics of formation of the s...

Current methods for solving Boolean satisfiability problem (SAT) are scalable enough to solve discrete nonlinear problems involving hundreds of thousands of variables. However, modern SAT solvers scale poorly with problems involving parity constraints (linear equations modulo 2). Gaussian elimination can be used to solve a system of linear equation effectively but it cannot be applied as such w...

Two widely used problems are the Satisfiability problem (SAT) and the Curriculum-Based Course Timetabling (CB-CTT) problem. The SAT problem searches for an assignment that make true a certain boolean formula. On the other side, the CB-CTT involves the task of scheduling lectures of courses to rooms, considering teacher availability, a specified curricula, and a set of constraints. Given the adv...

We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and Temporal Induction methods for simultaneously verifying multiple safety properties on the same model. The most efficient among our proposed algorithms for model checking are based on a simultaneous propositional satis...

Bounded Model Checking (BMC) is the problem of checking if a model satisses a temporal property in paths with bounded length k. Propositional SAT-based BMC is conducted in a gradual manner, by solving a series of SAT instances corresponding to formulations of the problem with increasing k. We show how the gradual nature can be exploited for shortening the overall veriication time. The concept i...

Boolean Satisjiability (SAT) is often used as the underlying model for a signijicant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other jields of Computer Science and Engineering. In recent years, new and efJicient algorithms for SAT have been developed, allowing much larger problem instances to be solved. SAT " packages " are currently expected...