Abstract Design Diagnosis Using Boolean Satisfiability ∗
, 2008 Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital VLSI design problems such as verification, model checking, optimization and test generation.
Alexander Smith +2 more
core
Automated loop invariant inference through learning-guided program structure analysis. [PDF]
PLoS OneHadad AS +5 more
europepmc +1 more source
Enhancing Security of Web-Based IoT Services via XSS Vulnerability Detection. [PDF]
Sensors (Basel), 2023 Kim J, Park J.
europepmc +1 more source
SYNTACTIC CHARACTERIZATION OF PROPOSITIONAL SATISFIABILITY
, 2005 The subject of the research reported in this thesis belongs to the area known as Propositional Satisfiability, an area located in the intersection of Theoretical Computer Science, Artificial Intelligence, and Mathematical Logic.
Anton Belov
core
Advancing stochastic 3-SAT solvers by dissipating oversatisfied constraints. [PDF]
Proc Natl Acad Sci U S ASchwardt J, Budich JC.
europepmc +1 more source
WGT: Tools and algorithms for recognizing, visualizing, and generating Wheeler graphs. [PDF]
iScience, 2023 Chao KH, Chen PW, Seshia SA, Langmead B.
europepmc +1 more source
Accelerating hybrid XOR-CNF Boolean satisfiability problems natively with in-memory computing. [PDF]
Nat CommunIm H +16 more
europepmc +1 more source
Golem: a flexible and efficient solver for constrained Horn clauses. [PDF]
Form Methods Syst DesBlicha M, Britikov K, Sharygina N.
europepmc +1 more source
Governance as a complex, networked, democratic, satisfiability problem. [PDF]
Npj ComplexHébert-Dufresne L +8 more
europepmc +1 more source
Local equations describe unreasonably efficient stochastic algorithms in random K-SAT. [PDF]
Proc Natl Acad Sci U S AMachado D, González-García J, Mulet R.
europepmc +1 more source