research
∙
08/16/2021
Synthesizing Pareto-Optimal Interpretations for Black-Box Models
We present a new multi-objective optimization approach for synthesizing ...
share
research
∙
05/31/2021
Diffy: Inductive Reasoning of Array Programs using Difference Invariants
We present a novel verification technique to prove interesting propertie...
research
∙
04/29/2021
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis
Boolean Skolem function synthesis concerns synthesizing outputs as Boole...
research
∙
02/15/2021
On synthesizing Skolem functions for first order logic formulae
Skolem functions play a central role in logic, from eliminating quantifi...
research
∙
08/12/2020
On Uniformly Sampling Traces of a Transition System (Extended Version)
A key problem in constrained random verification (CRV) concerns generati...
research
∙
02/23/2020
Verifying Array Manipulating Programs with Full-Program Induction
We present a full-program induction technique for proving (a sub-class o...
research
∙
08/17/2019
Knowledge Compilation for Boolean Functional Synthesis
Given a Boolean formula F(X,Y), where X is a vector of outputs and Y is ...
research
∙
08/08/2019
On Symbolic Approaches for Computing the Matrix Permanent
Counting the number of perfect matchings in bipartite graphs, or equival...
research
∙
08/24/2018
Functional Synthesis via Input-Output Separation
Boolean functional synthesis is the process of constructing a Boolean fu...
research
∙
04/16/2018
What's hard about Boolean Functional Synthesis
Given a relational specification between Boolean inputs and outputs, the...
research
∙
02/03/2018
Demand-driven Alias Analysis : Formalizing Bidirectional Analyses for Soundness and Precision
A demand-driven approach to program analysis have been viewed as efficie...
research
∙
07/12/2017
Verifying Array Manipulating Programs by Tiling
Formally verifying properties of programs that manipulate arrays in loop...
research
∙
12/21/2015
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Constrained sampling and counting are two fundamental problems in artifi...
research
∙
11/24/2015
Approximate Probabilistic Inference via Word-Level Counting
Hashing-based model counting has emerged as a promising approach for lar...
research
∙
04/11/2014
