S. VenkataKeerthy

S. VenkataKeerthy

Auto-generated profile, based on publicly available information

S. VenkataKeerthy

Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Hyderabad, India

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
22 December 2020 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
SVS. VenkataKeerthy
S. VenkataKeerthy
RARohit Aggarwal
Rohit Aggarwal
SJShalini Jain
Shalini Jain
MDMaunendra Sankar Desarkar
Maunendra Sankar Desarkar
RURamakrishna Upadrasta
Ramakrishna Upadrasta
YSY. N. Srikant
Y. N. Srikant
We propose IR2V EC , a Concise and Scalable encoding infrastructure to represent programs as a distributed embedding in continuous space. This distributed embedding is obtained by combining representation learning methods with flow information to capture the syntax as well as the semantics of the input programs. As our infrastructure is based on the Intermediate Representation (IR) of the source code, obtained embeddings are both language and machine independent. The entities of the IR are modeled as relationships, and their representations are learned to form a seed embedding vocabulary . Using this infrastructure, we propose two incremental encodings: Symbolic and Flow-Aware . Symbolic encodings are obtained from the seed embedding vocabulary , and Flow-Aware encodings are obtained by augmenting the Symbolic encodings with the flow information. We show the effectiveness of our methodology on two optimization tasks (Heterogeneous device mapping and Thread coarsening). Our way of representing the programs enables us to use non-sequential models resulting in orders of magnitude of faster training time. Both the encodings generated by IR2V EC outperform the existing methods in both the tasks, even while using simple machine learning models. In particular, our results improve or match the state-of-the-art speedup in 11/14 benchmark-suites in the device mapping task across two platforms and 53/68 benchmarks in the thread coarsening task across four different platforms. When compared to the other methods, our embeddings are more scalable , is non-data-hungry , and has better Out-Of-Vocabulary (OOV) characteristics .

4 October 2025 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
SVS. VenkataKeerthy
S. VenkataKeerthy
SBSoumya Banerjee
Soumya Banerjee
SDSayan Dey
Sayan Dey
YAYashas Andaluri
Yashas Andaluri
RSRaghul P. S.
Raghul P. S.
RURamakrishna Upadrasta
Ramakrishna Upadrasta
Binary similarity involves determining whether two binary programs exhibit similar functionality with applications in vulnerability detection, malware analysis, and copyright detection. However, variations in compiler settings, target architectures, and deliberate code obfuscations significantly complicate the similarity measurement by effectively altering the syntax, semantics, and structure of the underlying binary. To address these challenges, we propose VexIR2Vec , a robust, architecture-neutral approach based on VEX-IR to solve binary similarity tasks. VexIR2Vec consists of three key components: a peephole extractor, a normalization engine ( VexINE ), and an embedding model ( VexNet ). The process to build program embeddings starts with the extraction of sequences of basic blocks, or peepholes , from control-flow graphs via random walks, capturing structural information. These generated peepholes are then normalized using VexINE , which applies compiler-inspired transformations to reduce architectural and compiler-induced variations. Embeddings of peepholes are generated using representation learning techniques, avoiding Out-of-Vocabulary (OOV) issues. These embeddings are then fine-tuned with VexNet , a feed-forward Siamese network that maps functions into a high-dimensional space for diffing and searching tasks in an application-independent manner. We evaluate VexIR2Vec against five baselines—BinDiff, DeepBinDiff, SAFE, BinFinder, and histograms of opcodes—on a dataset comprising 2.7 M functions and 15.5 K binaries from 7 projects compiled across 12 compilers targeting x86 and ARM architectures. The experiments span four adversarial settings—cross-optimization, cross-compilation, cross-architecture, and obfuscations—that are typically exploited by malware and vulnerabilities. In diffing experiments, VexIR2Vec outperforms the nearest baseline in these four scenarios by \(40\%\) , \(18\%\) , \(21\%\) , and \(60\%\) , respectively. In the searching experiment, VexIR2Vec achieves a mean average precision of 0.76, the nearest baseline, by \(46\%\) . Our framework is highly scalable and is built as a lightweight, multi-threaded, parallel library using only open source tools. VexIR2Vec is \(\approx 3.1\) – \(3.5\times\) faster than the closest baselines and orders-of-magnitude faster than other tools.

17 February 2024
Verified
Conference Paper
Open access
SVS. VenkataKeerthy
S. VenkataKeerthy
SJSiddharth Jain
Siddharth Jain
UKUmesh Kalvakuntla
Umesh Kalvakuntla
PGPranav Sai Gorantla
Pranav Sai Gorantla
RCRajiv Shailesh Chitale
Rajiv Shailesh Chitale
RURamakrishna Upadrasta
Ramakrishna Upadrasta

1 September 2018
Verified
Conference Paper
Closed access
TDTharun Kumar Dangeti
Tharun Kumar Dangeti
VSVenkata Keerthy S.
Venkata Keerthy S.
RURamakrishna Upadrasta
Ramakrishna Upadrasta
We propose P4LLVM, an LLVM based P4 compiler for achieving better optimizations to improve the runtime performance of the network. The front-end of P4LLVM converts P4-16's code to LLVM's Intermediate Representation (IR). This IR is passed through various optimizations of LLVM and is translated to JSON for targeting a BMV2 Switch. We show the performance improvements obtained by running LLVM optimization passes in P4LLVM when compared to P4C.

1 July 2022
Verified
Conference Paper
Open access
SVS. VenkataKeerthy
S. VenkataKeerthy
YAYashas Andaluri
Yashas Andaluri
SDSayan Dey
Sayan Dey
RSRinku Shah
Rinku Shah
PTPraveen Tammana
Praveen Tammana
RURamakrishna Upadrasta
Ramakrishna Upadrasta
To keep up with the network speeds, many recent works propose to offload network functions to SmartNICs. The process involves identifying packet-processing algorithms in a network function program then offloading them to appropriate accelerators available on SmartNICs. This process is often done manually for each architecture and is error-prone and laborious. In this work, we propose an automated solution to identify algorithms in network function programs. We model our approach as a classification problem of Machine Learning (ML) and propose using sophisticated program embeddings for representing the network function programs. We also identify the limited availability of datasets and propose a way of extrapolating them by systematically generating equivalent programs using (existing) compiler transformations in popular compiler infrastructures. Our approach relies on modeling programs as embeddings, uses ML models trained on such extrapolated datasets, and shows superior results over the recent works.

1 March 2015
Verified
Conference Paper
Closed access
VSVenkata Keerthy S
Venkata Keerthy S
RCRhishi Kishore T K C
Rhishi Kishore T K C
KBKarthikeyan B
Karthikeyan B
VVVaithiyanathan V
Vaithiyanathan V
AMAnishin Raj M M
Anishin Raj M M
The paper proposes a robust steganography technique to hide the data in an image. The method proposed uses Huffman coding to minimize the number of bits to be embedded and to improve the security of the information. The security aspect is also improved by using a cryptographic substitution cipher and quadrant based embedding of the data. The quadrant based embedding of data bits helps in distribution of bits uniformly over the entire image rather having concentrated data bits over a particular region. The quality of stego image and the embedding capacity is also improved by the usage of Huffman coding. LSB embedding technique is used in the algorithm for concealing the data in the image.