activity
20182023
most citedPath-Based Function Embedding and its Application to Specification Mining

17 citations · 45 across the 7 of their papers we have counts for

collaborators

10 papers

cs.LG2023★ 15 cited

Architecture-Preserving Provable Repair of Deep Neural Networks

Zhe Tao, Stephanie Nawas, Jacqueline Mitchell +1

Deep neural networks (DNNs) are becoming increasingly important components of software, and are considered the state-of-the-art solution for a number of problems, such as image rec…

cs.LG2021

Provable Repair of Deep Neural Networks

Matthew Sotoudeh, Aditya V. Thakur

Deep Neural Networks (DNNs) have grown in popularity over the past decade and are now being used in safety-critical domains such as aircraft collision avoidance. This has motivated…

cs.LG2021

SyReNN: A Tool for Analyzing Deep Neural Networks

Matthew Sotoudeh, Aditya V. Thakur

Deep Neural Networks (DNNs) are rapidly gaining popularity in a variety of important domains. Formally, DNNs are complicated vector-valued functions which come in a variety of size…

cs.SE2020

Analogy-Making as a Core Primitive in the Software Engineering Toolbox

Matthew Sotoudeh, Aditya V. Thakur

An analogy is an identification of structural similarities and correspondences between two objects. Computational models of analogy making have been studied extensively in the fiel…

cs.PL2020

Memory-Efficient Fixpoint Computation

Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur

Practical adoption of static analysis often requires trading precision for performance. This paper focuses on improving the memory efficiency of abstract interpretation without sac…

cs.LG2020

Abstract Neural Networks

Matthew Sotoudeh, Aditya V. Thakur

Deep Neural Networks (DNNs) are rapidly being applied to safety-critical domains such as drone and airplane control, motivating techniques for verifying the safety of their behavio…

cs.PL2019★ 9 cited

Deterministic Parallel Fixpoint Computation

Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur

Abstract interpretation is a general framework for expressing static program analyses. It reduces the problem of extracting properties of a program to computing an approximation of…

cs.LG2019★ 1 cited

A Symbolic Neural Network Representation and its Application to Understanding, Verifying, and Patching Networks

Matthew Sotoudeh, Aditya V. Thakur

Analysis and manipulation of trained neural networks is a challenging and important problem. We propose a symbolic representation for piecewise-linear neural networks and discuss i…

cs.LG2019★ 3 cited

Computing Linear Restrictions of Neural Networks

Matthew Sotoudeh, Aditya V. Thakur

A linear restriction of a function is the same function with its domain restricted to points on a given line. This paper addresses the problem of computing a succinct representatio…

cs.SE2018★ 17 cited

Path-Based Function Embedding and its Application to Specification Mining

Daniel DeFreez, Aditya V. Thakur, Cindy Rubio-González

Identifying the relationships among program elements is useful for program understanding, debugging, and analysis. One such relationship is synonymy. Function synonyms are function…