132 citations · 182 across the 19 of their papers we have counts for
22 papers
Generating Complex Code Analyzers from Natural Language Questions
Amirmohammad Nazari, Sadra Sabouri, Wang Bill Zhu +3
Many software development tasks, such as implementing features and fixing bugs, begin with developers posing questions about a codebase. However, answering questions about codebase…
Data Flows in You: Benchmarking and Improving Static Data-flow Analysis on Binary Executables
Nicolaas Weideman, Sima Arasteh, Mukund Raghothaman +2
Data-flow analysis is a critical component of security research. Theoretically, accurate data-flow analysis in binary executables is an undecidable problem, due to complexities of…
BinPool: A Dataset of Vulnerabilities for Binary Security Analysis
Sima Arasteh, Georgios Nikitopoulos, Wei-Cheng Wu +4
The development of machine learning techniques for discovering software vulnerabilities relies fundamentally on the availability of appropriate datasets. The ideal dataset consists…
Trim My View: An LLM-Based Code Query System for Module Retrieval in Robotic Firmware
Sima Arasteh, Pegah Jandaghi, Nicolaas Weideman +4
The software compilation process has a tendency to obscure the original design of the system and makes it difficult both to identify individual components and discern their purpose…
Provenance Guided Rollback Suggestions
David Zhao, Pavle Subotic, Mukund Raghothaman +1
Advances in incremental Datalog evaluation strategies have made Datalog popular among use cases with constantly evolving inputs such as static analysis in continuous integration an…
Reusing Legacy Code in WebAssembly: Key Challenges of Cross-Compilation and Code Semantics Preservation
Sara Baradaran, Liyan Huang, Mukund Raghothaman +1
WebAssembly (Wasm) has emerged as a powerful technology for executing high-performance code and reusing legacy code in web browsers. With its increasing adoption, ensuring the reli…
Membership Testing for Semantic Regular Expressions
Yifei Huang, Matin Amini, Alexis Le Glaunec +2
SMORE (Chen et al., 2023) recently proposed the concept of semantic regular expressions that extend the classical formalism with a primitive to query external oracles such as datab…
Generative Explanations for Program Synthesizers
Amirmohammad Nazari, Souti Chattopadhyay, Swabha Swayamdipta +1
Despite great advances in program synthesis techniques, they remain algorithmic black boxes. Although they guarantee that when synthesis is successful, the implementation satisfies…
Superflows: A New Tool for Forensic Network Flow Analysis
Michael Collins, Jyotirmoy V. Deshmukh, Dristi Dinesh +3
Network security analysts gather data from diverse sources, from high-level summaries of network flow and traffic volumes to low-level details such as service logs from servers and…
Data-Driven Template-Free Invariant Generation
Yuan Xia, Jyotirmoy V. Deshmukh, Mukund Raghothaman +1
Automatic verification of concurrent programs faces state explosion due to the exponential possible interleavings of its sequential components coupled with large or infinite state…
The SyGuS Language Standard Version 2.1
Saswat Padhi, Elizabeth Polgreen, Mukund Raghothaman +2
The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Syntax-guided synthesis (SyGuS) i…
Data-Driven Synthesis of Provably Sound Side Channel Analyses
Jingbo Wang, Chungha Sung, Mukund Raghothaman +1
We propose a data-driven method for synthesizing a static analyzer to detect side-channel information leaks in cryptographic software. Compared to the conventional way of manually…
Synthesizing Datalog Programs Using Numerical Relaxation
Xujie Si, Mukund Raghothaman, Kihong Heo +1
The problem of learning logical rules from examples arises in diverse fields, including program synthesis, logic programming, and machine learning. Existing approaches either invol…
Streamable Regular Transductions
Rajeev Alur, Dana Fisman, Konstantinos Mamouras +2
Motivated by real-time monitoring and data processing applications, we develop a formal theory of quantitative queries for streaming data that can be evaluated efficiently. We cons…
On Repair with Probabilistic Attribute Grammars
Manos Koukoutos, Mukund Raghothaman, Etienne Kneuss +1
Program synthesis and repair have emerged as an exciting area of research, driven by the potential for revolutionary advances in programmer productivity. Among most promising ideas…
SWIM: Synthesizing What I Mean
Mukund Raghothaman, Yi Wei, Youssef Hamadi
Modern programming frameworks come with large libraries, with diverse applications such as for matching regular expressions, parsing XML files and sending email. Programmers often…
Automatic Completion of Distributed Protocols with Symmetry
Rajeev Alur, Mukund Raghothaman, Christos Stergiou +2
A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and i…
Language to Specify Syntax-Guided Synthesis Problems
Mukund Raghothaman, Abhishek Udupa
We present a language to specify syntax guided synthesis (SyGuS) problems. Syntax guidance is a prominent theme in contemporary program synthesis approaches, and SyGuS was first de…
Synthesizing Finite-state Protocols from Scenarios and Requirements
Rajeev Alur, Milo Martin, Mukund Raghothaman +3
Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite…
Regular Combinators for String Transformations
Rajeev Alur, Adam Freilich, Mukund Raghothaman
We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regular…
Decision Problems for Additive Regular Functions
Rajeev Alur, Mukund Raghothaman
Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form "x := y + c" at every step. The corres…
Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems
Rajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh +2
Motivated by the successful application of the theory of regular languages to formal verification of finite-state systems, there is a renewed interest in developing a theory of ana…