Decision trees of low depth are beneficial for understanding and interpreting the data they
represent. Unfortunately, finding a decision tree of lowest complexity (depth or size) that …

Real-life programs contain multiple operations whose semantics are unavailable to
verification engines, like third-party library calls, inline assembly and SIMD instructions …

Logic locking “hides” the functionality of a digital circuit to protect it from counterfeiting,
piracy, and malicious design modifications. The original design is transformed into a …

Programming languages and software engineering tools routinely encounter components
that are difficult to reason on via formal techniques or whose formal semantics are not even …

Abstract Stochastic Boolean Satisfiability (SSAT) generalizes quantified Boolean formulas
(QBFs) by allowing quantification over random variables. Its generality makes SSAT …

Abstract Bounded Model Checking (BMC) is a popularly used strategy for program
verification and it has been explored extensively over the past decade. Despite such a long …

Abstract Given a Linear Temporal Logic (LTL) formula over input and output variables,
reactive synthesis requires us to design a deterministic Mealy machine that gives the values …

5mm Next-Gen Automated Reasoning: ``Beyond SAT'' Revolution Page 1 Counting, Sampling,
and Synthesis: The Quest for Scalability Kuldeep S. Meel School of Computing National …

Parsers are omnipresent in almost all software systems. However, an operational
implementation of parsers cannot answer many “how”,“why” and “what if” questions, why …

Attribute grammars allow the association of semantic actions to the production rules in
context-free grammars, providing a simple yet effective formalism to define the semantics of …