Sayan Dey

Sayan Dey

Auto-generated profile, based on publicly available information

Sayan Dey

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

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
26 November 2021 in Materials Advances
Verified
Journal Article
Open access
PDF file
KGKritesh Kumar Gupta
Kritesh Kumar Gupta
TMTanmoy Mukhopadhyay
Tanmoy Mukhopadhyay
LRL. Roy
L. Roy
SDS. Dey
S. Dey
Molecular dynamics (MD) simulations have emerged to be a vital tool for the analysis of nanoscale materials like graphene. However, the reliability of the results derived from MD simulations depends on the adopted inter-atomic potential (IP), which is mathematically fitted to the data obtained from first principles approaches or experiments. There exists a significant scope of uncertainty associated with the IP parameters. Such internal uncertainties, together with the effect of stochastic external parameters like temperature and strain rate can trigger an augmented random deviation in the output mechanical responses. With the aim of developing an inclusive analysis and design paradigm, we have systematically quantified the effect of the uncertainties associated with the internal parameters (Tersoff IP parameters) and external parameters (temperature and strain rate) individually, and their compound effect on the mechanical properties of graphene. In establishing the complete probabilistic descriptions of the response quantities corresponding to different levels of source uncertainties, we show that a coupled machine learning-based Monte Carlo simulation approach could lead to significant computational efficiency without compromising the accuracy of the results. The study reveals that, in general, the internal parameters are more sensitive than the external parameters. Among the inter-atomic parameters, λ1 and λ2 are found to be the most sensitive, while the temperature is found to be more sensitive than the strain rate among the external parameters. The cohesive energy is noted to be dependent only on the inter-atomic potential parameters, while the fracture strength depends on both the internal and external input parameters. The numerically quantifiable outcomes of this study will improve and bring new perspectives in the inclusive analysis and design of various graphene-based devices and systems, including the effect of inherent uncertainties and their relative sensitivity.

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.

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.