Software model synthesis using satisfiability solvers
نویسندگان
چکیده
منابع مشابه
Synthesis of Propositional Satisfiability Solvers
Development of system software by refinement has been extensively studied, and few larger scale case studies has been carried out. Most refinement approaches havse relied on manual construction of ad-hoc non-reusable refinements that are subjected to post-hoc verification. The problem with this approach is that the incremental cost of adapting to changing requirements is too high for this to be...
متن کاملSatisfiability Solvers
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known algorithms, satisfiability solvers are increasingly leaving their mark as a general-purpose tool in areas as diverse as software and hardware verification [29–31, 228], automatic test pattern generation [138, 221], planning [129, ...
متن کاملSatisfiability Solvers
Satisfiability (SAT) solvers have become powerful tools to solve a wide range of applications. In case SAT problems are satisfiable, it is easy to validate a witness. However, if SAT problems have no solutions, a proof of unsatisfiability is required to validate that result. Apart from validation, proofs of unsatisfiability are useful in several applications, such as interpolation [50] and extr...
متن کاملEvaluating LTL Satisfiability Solvers
We perform a comprehensive experimental evaluation of offthe-shelf solvers for satisfiability of propositional LTL. We consider a wide range of solvers implementing three major classes of algorithms: reduction to model checking, tableau-based approaches, and temporal resolution. Our set of benchmark families is significantly more comprehensive than those in previous studies. It takes the benchm...
متن کاملSatisfiability Solvers Are Static Analysers
This paper shows that several propositional satisfiability algorithms compute approximations of fixed points using lattice-based abstractions. The Boolean Constraint Propagation algorithm (bcp) is a greatest fixed point computation over a lattice of partial assignments. The original algorithm of Davis, Logemann and Loveland refines bcp by computing a set of greatest fixed points. The Conflict D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Empirical Software Engineering
سال: 2012
ISSN: 1382-3256,1573-7616
DOI: 10.1007/s10664-012-9222-z