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

Karuna Grewal

dblp:318/1029 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0008-1280-6892ORCID · corroborated

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

Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021Computer networks · 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
2 papers
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Computer networks
2 papers
Software-defined and programmable networks · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security › security policy enforcement
runtime enforcement
0.912025
SafeTree: Expressive Tree Policies for Microservices · Proc. ACM Program. Lang. 2025
Software-defined and programmable networks
programmable data plane
0.612022
P4BID: information flow control in p4 · PLDI 2022
Systems and software security
information flow control
0.612022
P4BID: information flow control in p4 · PLDI 2022
Software-defined and programmable networks
service mesh
0.312025
SafeTree: Expressive Tree Policies for Microservices · Proc. ACM Program. Lang. 2025

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

visibly pushdown automata · 2.6runtime monitoring · 2.6information flow analysis · 1.1
YearPublicationVenuePosition
2025 SafeTree: Expressive Tree Policies for Microservices
abstract
A microservice-based application is composed of multiple self-contained components called microservices , and controlling inter-service communication is important for enforcing safety properties. Presently, inter-service communication is configured using microservice deployment tools. However, such tools only support a limited class of single-hop policies, which can be overly permissive because they ignore the rich service tree structure of microservice calls. Policies that can express the service tree structure can offer development and security teams more fine-grained control over communication patterns. To this end, we design an expressive policy language to specify service tree structures, and we develop a visibly pushdown automata -based dynamic enforcement mechanism to enforce service tree policies. Our technique is non-invasive: it does not require any changes to service implementations, and does not require access to microservice code. To realize our method, we build a runtime monitor on top of a service mesh , an emerging network infrastructure layer that can control inter-service communication during deployment. In particular, we employ the programmable network traffic filtering capabilities of Istio, a popular service mesh implementation, to implement an online and distributed monitor. Our experiments show that our monitor can enforce rich safety properties while adding minimal latency overhead on the order of milliseconds.
Karuna Grewal, Brighten Godfrey, Justin Hsu
Proc. ACM Program. Lang.1
2023 Expressive Policies For Microservice Networks
abstract
Microservice-based application deployments need to administer safety properties while serving requests. However, today such properties can be specified only in limited ways that can lead to overly permissive policies and the potential for illegitimate flow of information across microservices, or ad hoc policy implementations.
Karuna Grewal, Brighten Godfrey, Justin Hsu
HotNets1
2022 P4BID: information flow control in p4
abstract
Modern programmable network switches can implement custom applications using efficient packet processing hardware, and the programming language P4 provides high-level constructs to program such switches. The increase in speed and programmability has inspired research in dataplane programming, where many complex functionalities, e.g., key-value stores and load balancers, can be implemented entirely in network switches. However, dataplane programs may suffer from novel security errors that are not traditionally found in network switches.
Karuna Grewal, Loris D'Antoni, Justin Hsu
PLDI1