Ramakrishna Upadrasta

Ramakrishna Upadrasta

Auto-generated profile, based on publicly available information

Ramakrishna Upadrasta

Indian Institute of Technology Hyderabad

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
23 January 2013
Verified
Conference Paper
Open access
PDF file
RURamakrishna Upadrasta
Ramakrishna Upadrasta
ACAlbert Cohen
Albert Cohen
Polyhedral compilation has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations remain one important weakness. We address it using sub-polyhedral under-aproximations of the systems of constraints resulting from affine scheduling problems. We propose a sub-polyhedral scheduling technique using (Unit-)Two-Variable-Per-Inequality or (U)TVPI Polyhedra. This technique relies on simple polynomial time algorithms to under-approximate a general polyhedron into (U)TVPI polyhedra. We modify the state-of-the-art PLuTo compiler using our scheduling technique, and show that for a majority of the Polybench (2.0) kernels, the above under-approximations yield polyhedra that are non-empty. Solving the under-approximated system leads to asymptotic gains in complexity, and shows practically significant improvements when compared to a traditional LP solver. We also verify that code generated by our sub-polyhedral parallelization prototype matches the performance of PLuTo-optimized code when the under-approximation preserves feasibility.

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.

3 June 2019 in CSI Transactions on ICT
Verified
Journal Article
Closed access
PDF file
SJShalini Jain
Shalini Jain
UBUtpal Bora
Utpal Bora
PKPrateek Kumar
Prateek Kumar
VSVaibhav B. Sinha
Vaibhav B. Sinha
SPSuresh Purini
Suresh Purini
RURamakrishna Upadrasta
Ramakrishna Upadrasta

1 November 2000 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
PDF file
MMMaya Madhavan
Maya Madhavan
PSPriti Shankar
Priti Shankar
SRSiddhartha Rai
Siddhartha Rai
URU Ramakrishna
U Ramakrishna
We propose a new technique for constructing code-generator generators, which combines the advantages of the Graham-Glanville parsing technique and the bottom-up tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton as the matching device. This device is able to handle ambigious grammars, and can be used to generate locally optimal code without the use of heuristics. Cost computations are performed at preprocessing time. The class of regular tree grammars augmented with costs that can be handled by our system properly includes those that can be handled by bottom-up systems based on finite-state tree parsing automata. Parsing time is linear in the size of the subject tree. We have tested the system on specifications for some systems and report table sizes.

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.