Arrow Research search

Author name cluster

Rakesh M. Verma

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

5 papers
2 author rows

Possible papers

5

AAAI Conference 2026 Conference Paper

Guided Perturbation Sensitivity (GPS): Detecting Adversarial Text via Embedding Stability and Word Importance

  • Bryan E. Tuck
  • Rakesh M. Verma

Adversarial text attacks remain a persistent threat to transformer models, yet existing defenses are typically attack-specific or require costly model retraining, leaving a gap for attack-agnostic detection. We introduce Guided Perturbation Sensitivity (GPS), a detection framework that identifies adversarial examples by measuring how embedding representations change when important words are masked. GPS first ranks words using importance heuristics, then measures embedding sensitivity to masking top-k critical words, and processes the resulting patterns with a BiLSTM detector. Experiments show that adversarially perturbed words exhibit disproportionately high masking sensitivity compared to naturally important words. Across three datasets, three attack types, and two victim models, GPS achieves over 85% detection accuracy and demonstrates competitive performance compared to existing state-of-the-art methods, often at lower computational cost. Using Normalized Discounted Cumulative Gain (NDCG) to measure perturbation identification quality, we demonstrate that gradient-based ranking significantly outperforms attention, hybrid, and random selection approaches, with identification quality strongly correlating with detection performance for word-level attacks (ρ = 0.65). GPS generalizes to unseen datasets, attacks, and models without retraining, providing a practical solution for adversarial text detection.

CSL Conference 1999 Conference Paper

RPO Constraint Solving Is in NP

  • Paliath Narendran
  • Michaël Rusinowitch
  • Rakesh M. Verma

Abstract A new decision procedure for the existential fragment of ordering constraints expressed using the recursive path ordering is presented. This procedure is nondeterministic and checks whether a set of constraints is solvable over the given signature, i. e. , the signature over which the terms in the constraints are defined. It is shown that this non-deterministic procedure runs in polynomial time, thus establishing the membership of this problem in the complexity class NP for the first time.

TCS Journal 1995 Journal Article

Transformations and confluence for rewrite systems

  • Rakesh M. Verma

Many important applications of rewrite systems, e. g. , automated reasoning, algebraic specifications of abstract data types, and functional/equational programming, rely either wholly or in part on rewrite systems that are constructor-based. In this paper, we study general transformations of rewrite systems that preserve confluence and normal forms. In 1985, Thatte showed that an orthogonal system can be transformed into an orthogonal constructor-based system that preserves normal forms up to a certain simple homomorphism. In 1988, Thatte claimed that this transformation works for all semiregular (confluent + nonoverlapping) systems. We show that Thatte's transformation fails to preserve confluence and normal forms for semiregular systems. We then introduce the concept of weak persistence and show that Thatte's transformation is correct for all weakly persistent confluent systems. We also give some general conditions that imply weak persistence and show that this class includes as subclasses the following: left-linear, nonoverlapping systems with confluent root overlaps (generalization of orthogonal systems), nonoverlapping noetherian systems with confluent root overlaps, and the nonlinear systems with no overlaps proved confluent by Klop. We show that our transformation scheme for convergent systems can also be applied to systems in which the innermost rewriting relation is confluent. Our results indicate that persistence plays a role in arbitrary confluent systems that in analogous to the role of the no-overlap restriction in left-linear systems; and similarly weak persistence plays a role that is analogous to that of the nonoverlapping restriction for left-linear systems.

I&C Journal 1992 Journal Article

Tight complexity bounds for term matching problems

  • Rakesh M. Verma
  • I.V. Ramakrishnan

In this paper we study the sequential and parallel complexity of various important term matching problems. These problems occur frequently in applications such as term rewriting, functional programming, and logic programming. First, we obtain non-trivial lower bounds on the parallel complexity of the (uninterpreted) term matching problem. We also establish the tightness of these bounds for some representations and several models. We then characterize completely the sequential complexity of associative and commutative matching when the number of occurrences of variables is varied. Specifically, we show that even if each variable is restricted to at most two occurrences in the terms, both associative matching and commutative matching are NP-complete. Interestingly, for the important restriction of boolean terms we show that commutative matching is NP-complete whereas associative matching has a linear time sequential algorithm. For linear terms, we significantly improve the existing upper bound for associative-commutative matching, and present a new algorithm for associative matching. Designing direct parallel algorithms for associative-commutative matching of linear terms appears to be a difficult task. Despite this we have been able to resolve questions about the parallel complexity of these problems using complexity-theoretic techniques. Finally, an interesting consequence of the research reported here is the demonstration of a tighter relationship between associative-commutative matching for linear terms and bipartite matching on both sequential and parallel models.

FOCS Conference 1991 Conference Paper

A Theory of Using History for Equational Systems with Applications (Extended Abstract)

  • Rakesh M. Verma

A general theory of using a congruence closure based simplifier (CCNS) proposed by P. Chew (1980) for computing normal forms is developed, and several applications are presented. An independent set of postulates is given, and it is proved that CCNS can be used for any system that satisfies them. It is then shown that CCNS can be used for consistent convergent systems and for various kinds of priority rewrite systems. A simple translation scheme for converting priority systems into effectively nonoverlapping convergent systems is presented. >

v2026.09.13