K. Shiv Kumar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
K. Shiv Kumar has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Praveen Tammana
Indian Institute of Technology Hyderabad, Hyderabad, India
2 shared publications - Amogh Bedarakota
Indian Institute of Technology Hyderabad, Indian
1 shared publication - Anibrata Majee
Indian Institute of Technology Hyderabad, Indian
1 shared publication - Animesh Singh
Indian Institute of Technology Hyderabad, Hyderabad, India
1 shared publication - Palanivel Kodeswaran
Walmart Global Technology Labs, Bangalore, India and IBM Research India, Bangalore, India
1 shared publication - Pragna Mamidipaka
Carnegie Mellon University, Pittsburgh, USA and Indian Institute of Technology Hyderabad, Hyderabad, India
1 shared publication
Latest Publications
- Open Access
- 19 November 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT4) , 1-25
Yaksha-Prashna: Bridging the Semantic Gap in eBPF Bytecode Analysis and Diagnostics
Modern cloud infrastructures increasingly rely on eBPF-based Network Functions (NFs) for critical data-plane tasks, including observability, security, and load balancing. Because developing production-grade eBPF programs requires significant expertise, operators are increasingly deploying third-party, ''off-the-shelf'' solutions distributed as opaque bytecode. While the Linux kernel's eBPF verifier guarantees safety, it remains agnostic to the functional correctness of network logic; consequently, verifier-safe bytecode can still exhibit incorrect behavior, resulting in both intra-NF functional failures and inter-NF compositional failures. To effectively manage these opaque bytecodes, network operators require mechanisms to validate packet-processing behavior and diagnose violations when they occur. This paper presents \archp, a scalable system for validating eBPF bytecode and providing actionable diagnostic feedback. \archp pairs a network-aware analyzer—which reconstructs packet-processing semantics from opaque eBPF bytecode to build a Network Context Model (NCM)—with a unified query language and engine that supports both validation assertions and diagnostic retrieval queries. By employing control-flow-guided dataflow analysis and an '' analyze once, query multiple times '' design, \archp scales to complex, production-grade NFs while avoiding the computational overheads of state-of-the-art validation methods. Evaluation on 32 real-world NFs from production sources, including Cilium, Katran, and Suricata, demonstrates that \archp accurately extracts network context in milliseconds. Compared to Klint and DRACO, \archp matches expressivity while achieving 200--1000× lower validation time.
- 19 November 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT4) , 1-25
Open AccessYaksha-Prashna: Bridging the Semantic Gap in eBPF Bytecode Analysis and Diagnostics
Modern cloud infrastructures increasingly rely on eBPF-based Network Functions (NFs) for critical data-plane tasks, including observability, security, and load balancing. Because developing production-grade eBPF programs requires significant expertise, operators are increasingly deploying third-party, ''off-the-shelf'' solutions distributed as opaque bytecode. While the Linux kernel's eBPF verifier guarantees safety, it remains agnostic to the functional correctness of network logic; consequently, verifier-safe bytecode can still exhibit incorrect behavior, resulting in both intra-NF functional failures and inter-NF compositional failures. To effectively manage these opaque bytecodes, network operators require mechanisms to validate packet-processing behavior and diagnose violations when they occur. This paper presents \archp, a scalable system for validating eBPF bytecode and providing actionable diagnostic feedback. \archp pairs a network-aware analyzer—which reconstructs packet-processing semantics from opaque eBPF bytecode to build a Network Context Model (NCM)—with a unified query language and engine that supports both validation assertions and diagnostic retrieval queries. By employing control-flow-guided dataflow analysis and an '' analyze once, query multiple times '' design, \archp scales to complex, production-grade NFs while avoiding the computational overheads of state-of-the-art validation methods. Evaluation on 32 real-world NFs from production sources, including Cilium, Katran, and Suricata, demonstrates that \archp accurately extracts network context in milliseconds. Compared to Klint and DRACO, \archp matches expressivity while achieving 200--1000× lower validation time.
- Open Access
- 29 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 116-122
In-Network Probabilistic Monitoring Primitives under the Influence of Adversarial Network Inputs
- 29 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 116-122
Open AccessIn-Network Probabilistic Monitoring Primitives under the Influence of Adversarial Network Inputs