CM Li, WQ Huang - Theory and Applications of Satisfiability Testing: 8th …, 2005 - Springer
The choice of the variable to flip in the Walksat family procedures is always random in that it is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty …
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specification …
S Liu, S Nakajima - IEEE Transactions on Software …, 2020 - ieeexplore.ieee.org
Testing a program to confirm whether it consistently implements its requirements specification is a necessary but time-consuming activity in software development. Automatic …
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation of …
JP Galeotti, N Rosner, CGL Pombo… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specification …
Automated program repair is an active research area. However, existing research focuses mostly on imperative code, eg in Java. In this paper, we study the problem of repairing …
We present two novel approaches for automated testing of models written in Alloy–a well- known declarative, first-order language that is supported by a fully automatic SAT-based …
K Sullivan, J Yang, D Coppit, S Khurshid… - Proceedings of the 2004 …, 2004 - dl.acm.org
The contribution of this paper is an experiment that shows the potential value of a combination of selective reverse engineering to formal specifications and bounded …
Fault localization is a popular research topic and many techniques have been proposed to locate faults in imperative code, eg C and Java. In this paper, we focus on the problem of …