Sanjit A. Seshia

Sanjit A. Seshia

Auto-generated profile, based on publicly available information

Sanjit A. Seshia

University of California, Berkeley, Berkeley, California, USA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 July 2017 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
JDJyotirmoy V. Deshmukh
Jyotirmoy V. Deshmukh
ADAlexandre Donzé
Alexandre Donzé
SGShromona Ghosh
Shromona Ghosh
XJXiaoqing Jin
Xiaoqing Jin
GJGarvit Juniwal
Garvit Juniwal
SSSanjit A. Seshia
Sanjit A. Seshia

8 December 2016 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Open access
SSSanjit A. Seshia
Sanjit A. Seshia
SHShiyan Hu
Shiyan Hu
WLWenchao Li
Wenchao Li
QZQi Zhu
Qi Zhu
A cyber-physical system (CPS) is an integration of computation with physical processes whose behavior is defined by both computational and physical parts of the system. In this paper, we present a view of the challenges and opportunities for design automation of CPS. We identify a combination of characteristics that define the challenges unique to the design automation of CPS. We then present selected promising advances in depth, focusing on four foundational directions: combining model-based and data-driven design methods; design for human-in-the-loop systems; component-based design with contracts, and design for security and privacy. These directions are illustrated with examples from two application domains: smart energy systems and next-generation automotive systems.

2 February 2022 in Machine Learning
Verified
Journal Article
Open access
PDF file
DFDaniel J. Fremont
Daniel J. Fremont
EKEdward Kim
Edward Kim
TDTommaso Dreossi
Tommaso Dreossi
SGShromona Ghosh
Shromona Ghosh
XYXiangyu Yue
Xiangyu Yue
SSSanjit A. Seshia
Sanjit A. Seshia
We propose a new probabilistic programming language for the design and analysis of cyber-physical systems, especially those based on machine learning. We consider several problems arising in the design process, including training a system to be robust to rare events, testing its performance under different conditions, and debugging failures. We show how a probabilistic programming language can help address these problems by specifying distributions encoding interesting types of inputs, then sampling these to generate specialized training and test data. More generally, such languages can be used to write environment models, an essential prerequisite to any formal analysis. In this paper, we focus on systems such as autonomous cars and robots, whose environment at any point in time is a scene, a configuration of physical objects and agents. We design a domain-specific language, Scenic, for describing scenarios that are distributions over scenes and the behaviors of their agents over time. Scenic combines concise, readable syntax for spatiotemporal relationships with the ability to declaratively impose hard and soft constraints over the scenario. We develop specialized techniques for sampling from the resulting distribution, taking advantage of the structure provided by Scenic’s domain-specific syntax. Finally, we apply Scenic in multiple case studies for training, testing, and debugging neural networks for perception both as standalone components and within the context of a full cyber-physical system.

15 February 2017 in Acta Informatica
Verified
Journal Article
Open access
PDF file
SJSusmit Jha
Susmit Jha
SSSanjit A. Seshia
Sanjit A. Seshia
Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learning. We refer to this class of methods that learn programs from examples as formal inductive synthesis. In this paper, we present a theoretical framework for formal inductive synthesis. We discuss how formal inductive synthesis differs from traditional machine learning. We then describe oracle-guided inductive synthesis (OGIS), a framework that captures a family of synthesizers that operate by iteratively querying an oracle. An instance of OGIS that has had much practical impact is counterexample-guided inductive synthesis (CEGIS). We present a theoretical characterization of CEGIS for learning any program that computes a recursive language. In particular, we analyze the relative power of CEGIS variants where the types of counterexamples generated by the oracle varies. We also consider the impact of bounded versus unbounded memory available to the learning algorithm. In the special case where the universe of candidate programs is finite, we relate the speed of convergence to the notion of teaching dimension studied in machine learning theory. Altogether, the results of the paper take a first step towards a theoretical foundation for the emerging field of formal inductive synthesis.

26 May 2017 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
SJSusmit Jha
Susmit Jha
VRVasumathi Raman
Vasumathi Raman
DSDorsa Sadigh
Dorsa Sadigh
SSSanjit A. Seshia
Sanjit A. Seshia

30 June 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
AAAndreea B. Alexandru
Andreea B. Alexandru
KGKonstantinos Gatsis
Konstantinos Gatsis
YSYasser Shoukry
Yasser Shoukry
SSSanjit A. Seshia
Sanjit A. Seshia
PTPaulo Tabuada
Paulo Tabuada
GPGeorge J. Pappas
George J. Pappas
This paper develops a cloud-based protocol for a constrained quadratic optimization problem involving multiple parties, each holding private data. The protocol is based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure communication techniques. Using formal cryptographic definitions of indistinguishability, the protocol is shown to achieve computational privacy. We show the implementation results of the protocol and discuss its computational and communication complexity. We conclude the paper with a discussion on privacy notions.