Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lipsy Gupta

dblp:383/4475 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0001-6825-9797ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cyber-physical and IoT security · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification
safety verification
0.812024
Safety Verification of Closed-loop Control System with Anytime Perception · ICRA 2024
Automated reasoning and model checking
neural network verification
0.812024
Approximate Conformance Checking for Closed-Loop Systems With Neural Network Controllers · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Embedded and real-time systems
real-time control
0.212024
Safety Verification of Closed-loop Control System with Anytime Perception · ICRA 2024

Methods — techniques the papers use, named apart from their topics

reachability analysis · 1.5polyhedral manipulation · 1.5over-approximation · 1.5NN verification tools · 1.5
YearPublicationVenuePosition
2025 Star-Set Based Efficient Reachable Set Computation of Anytime Sensing-Based Neural Network-Controlled Dynamical Systems
abstract
In this article, we consider the problem of reachable set computation of a closed-loop system with anytime sensor and a neural network controller. We provide a star set data structure-based forward propagation algorithm that uses existing efficient operations on star-sets and a novel convex hull construction. We present rigorous analysis of the space-complexity of the star sets generated during the propagation. Our experimental results show significant improvement with respect to existing methods that use vertex-based representation of polyhedral sets for propagation through closed-loop systems with anytime sensing, as well as the feasibility of the approach on different types of dynamics, control and sensors.
Lipsy Gupta, Pavithra Prabhakar
ACM Trans. Embed. Comput. Syst.1
2024 Safety Verification of Closed-loop Control System with Anytime Perception
abstract
In this paper, we consider the problem of safety analysis of a closed-loop control system with anytime perception sensor. We formalize the framework and present a general procedure for safety analysis using reachable set computation. We instantiate the procedure for two concrete classes, namely, the classical discrete-time linear system with linear state feedback controller and an extension with variable update rates. We present an exact computational method based on polyhedral manipulations for the first class and an overapproximate method for the second class. Our experimental results demonstrate the feasibility of the approach.
Lipsy Gupta, Jahid Chowdhury Choton, Pavithra Prabhakar
ICRA1
2024 Approximate Conformance Checking for Closed-Loop Systems With Neural Network Controllers
abstract
In this article, we consider the problem of checking approximate conformance of closed-loop systems with the same plant but different neural network (NN) controllers. First, we introduce a notion of approximate conformance on NNs, which allows us to quantify semantically the deviations in closed-loop system behaviors with different NN controllers. Next, we consider the problem of computationally checking this notion of approximate conformance on two NNs. We reduce this problem to that of reachability analysis on a combined NN, thereby, enabling the use of existing NN verification tools for conformance checking. Our experimental results on an autonomous rocket landing system demonstrate the feasibility of checking approximate conformance on different NNs trained for the same dynamics, as well as the practical semantic closeness exhibited by the corresponding closed-loop systems.
Habeeb P, Lipsy Gupta, Pavithra Prabhakar
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2