Automated program analysis is a pivotal research domain in many areas of...
We present a benchmark of 29687 problems derived from the On-Line
Encycl...
The appearance of strong CDCL-based propositional (SAT) solvers has grea...
Computer Science course instructors routinely have to create comprehensi...
Due to the vast number of students enrolled in Massive Open Online Cours...
Due to the vast number of students enrolled in Massive Open Online Cours...
The enumeration of finite models is very important to the working discre...
SMT solvers generally tackle quantifiers by instantiating their variable...
We develop Stratified Shortest Solution Imitation Learning (3SIL) to lea...
Relaxed memory models are notoriously delicate. To ease their study, sev...
This paper reports on the QBF solver QFUN that has won the non-CNF track...
Most recent MaxSAT algorithms rely on a succession of calls to a SAT sol...
When configuring customizable software, it is useful to provide interact...
This short note reviews briefly three algorithms for finding the set of
...