Paliath Narendran

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 23

Top Venues

Publications

Josué A. Ruiz, Paliath Narendran, Amir Masoumzadeh, Padmavathi Iyer
Converting Rule-Based Access Control Policies: From Complemented Conditions to Deny Rules. SACMAT (2024)
Deepak Kapur, Paliath Narendran
Existence and Construction of a Gröbner Basis for a Polynomial Ideal. CoRR (2023)
Dalton Chichester, Wei Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Luis Rovira, Brandon Rozek
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. GandALF (2022)
Padmavathi Iyer, Amirreza Masoumzadeh, Paliath Narendran
On the Expressive Power of Negated Conditions and Negative Authorizations in Access Control Models. Comput. Secur. 116 (2022)
Zümrüt Akçam, Daniel S. Hono II, Paliath Narendran, Andrew Pulver
On Problems Dual to Unification: The String-Rewriting Case. CoRR (2021)
Amirreza Masoumzadeh, Paliath Narendran, Padmavathi Iyer
Towards a Theory for Semantics and Expressiveness Analysis of Rule-Based Access Control Models. SACMAT (2021)
Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems. FroCoS (2021)
Paliath Narendran, Ashley Suchy, Yu Zhang
Some Results on Prefix Grammars. UNIF (2020)
Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek
Algorithmic Problems in Synthesized Cryptosystems (Extended Abstract). UNIF (2020)
Paliath Narendran, Saumya Arora, Yu Zhang
An Improved Algorithm for Testing Whether a Special String Rewriting System is Confluent. UNIF (2020)
Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar
On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos (2019)
Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar
On Asymmetric Unification for the Theory of XOR with a Homomorphism. CoRR (2019)
Veena Ravishankar, Kimberly A. Cornell, Paliath Narendran
Asymmetric Unification and Disunification. Description Logic, Theory Combination, and All That (2019)
Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Lists with Reverse Relation with Certain Word Equations. CADE (2019)
Dohan Kim, Christopher Lynch, Paliath Narendran
Reviving Basic Narrowing Modulo. FroCos (2019)
Veena Ravishankar, Kimberly A. Gero, Paliath Narendran
Asymmetric Unification and Disunification. CoRR (2017)
Zümrüt Akçam, Daniel S. Hono II, Paliath Narendran
On Problems Dual to Unification. CoRR (2017)
Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam
Notes on Lynch-Morawska Systems. UNIF (2016)
Daniel S. Hono II, Paliath Narendran, Rafael Veras
Lynch-Morawska Systems on Strings. UNIF (2016)
Daniel S. Hono II, Paliath Narendran, Rafael Veras
Lynch-Morawska Systems on Strings. CoRR (2016)
Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam
Notes on Lynch-Morawska Systems. CoRR (2016)
Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry. Log. Methods Comput. Sci. 11 (2) (2015)
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos (2015)
Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. Log. Methods Comput. Sci. 10 (1) (2014)
Steve Kremer, Paliath Narendran
Foreword to the special issue on security and rewriting techniques. Inf. Comput. 238 (2014)
John Corcoran, Paliath Narendran, Wolfgang Thomas
Obituary Robert McNaughton 1924 - 2014. Bull. EATCS 114 (2014)
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Christophe Ringeissen
On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS (2014)
Peter Hibbs, Paliath Narendran, Shweta Mehto
Unification Modulo Common List Functions. UNIF (2014)
Fan Yang, Santiago Escobar, Catherine A. Meadows, José Meseguer, Paliath Narendran
Theories of Homomorphic Encryption, Unification, and the Finite Variant Property. PPDP (2014)
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF (2014)
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen
On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF (2014)
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA (2013)
Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran
On Forward Closure and the Finite Variant Property. FroCos (2013)
Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly A. Gero, Paliath Narendran
Unication Problems Modulo a Theory of Until. UNIF@RTA/TLCA (2013)
Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine A. Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE (2013)
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
Hierarchical Combination. CADE (2013)
Kimberly A. Gero, Christopher Bouchard, Paliath Narendran
Some Notes on Basic Syntactic Mutation. UNIF (2012)
Serdar Erbatur, Santiago Escobar, Paliath Narendran
The use of types in designing unification algorithms: two case studies. UNIF (2012)
Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Synchronous Distributivity. IJCAR (2012)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Homomorphic Encryption. J. Autom. Reason. 48 (2) (2012)
Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine A. Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS (2012)
Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Chaining. LATA (2012)
Andrew M. Marshall, Paliath Narendran
New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants. IJCAR (2012)
Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine A. Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP (2011)
Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran
Unification over Distributive Exponentiation (Sub)Theories. J. Autom. Lang. Comb. 16 (2-4) (2011)
Serdar Erbatur, Christopher Lynch, Paliath Narendran
Unification in a Theory of Blind Signatures. TABLEAUX (Workshops, Tutorials, and Short Papers) (2011)
Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
String Rewriting and Security Analysis: An Extension of a Result of Book and Otto. J. Autom. Lang. Comb. 16 (2-4) (2011)
Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. UNIF (2011)
Paliath Narendran, Andrew M. Marshall, Bibhu Mahapatra
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity UNIF (2010)
Deepak Kapur, Andrew M. Marshall, Paliath Narendran
Unification modulo a partial theory of exponentiation UNIF (2010)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Cap unification: application to protocol security modulo homomorphic encryption. AsiaCCS (2010)
Benjamin Carle, Paliath Narendran
On Extended Regular Expressions. LATA (2009)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Homomorphic Encryption. FroCoS (2009)
Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran
Unification and Matching Modulo Leaf-Permutative Equational Presentations. IJCAR (2008)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification modulo Homomorphic Encryption is Decidable. UNIF (2008)
Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
Intruders with Caps. RTA (2007)
Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
Closure properties and decision problems of dag automata. Inf. Process. Lett. 94 (5) (2005)
Deepak Kapur, Paliath Narendran, Lida Wang
A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning (2005)
Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
Plus Distributivity Axioms. J. Autom. Reason. 33 (1) (2004)
Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
Unification Modulo ACU I Plus Homomorphisms/Distributivity. CADE (2003)
Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
ACID-Unification Is NEXPTIME-Decidable. MFCS (2003)
Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
Deciding the confluence of ordered term rewrite systems. ACM Trans. Comput. Log. 4 (1) (2003)
Deepak Kapur, Paliath Narendran, Lida Wang
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA (2003)
Paliath Narendran, Michaël Rusinowitch
Guest Editorial. Inf. Comput. 178 (2) (2002)
Franz Baader, Paliath Narendran
Unification of Concept Terms in Description Logics. J. Symb. Comput. 31 (3) (2001)
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243 (1-2) (2000)
Qing Guo, Paliath Narendran, David A. Wolfram
Complexity of Nilpotent Unification and Matching Problems. Inf. Comput. 162 (1-2) (2000)
Paliath Narendran
Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages). SIGACT News 31 (3) (2000)
Paliath Narendran, Michaël Rusinowitch
The Theory of Total Unary RPO Is Decidable. Computational Logic (2000)
Franz Baader, Paliath Narendran
Unification of Concept Terms in Description Logics. ECAI (1998)
Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
Equational Unification, Word Unification, and 2nd-Order Equational Unification. Theor. Comput. Sci. 198 (1-2) (1998)
Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma
RPO Constraint Solving Is in NP. CSL (1998)
Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
Decision Problems in Ordered Rewriting. LICS (1998)
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
-Unification with One Variable. RTA (1998)
Qing Guo, Paliath Narendran, Sandeep K. Shukla
Unification and Matching in Process Algebras. RTA (1998)
Paliath Narendran, Friedrich Otto
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. J. Autom. Reason. 19 (1) (1997)
Franz Baader, Paliath Narendran
Unification of Concept Terms in Description Logics. Description Logics (1997)
Paliath Narendran, Frank Pfenning, Richard Statman
On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. 62 (2) (1997)
Paliath Narendran, Friedrich Otto
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. ICALP (1997)
Paliath Narendran
Unification Modulo ACI + 1 + 0. Fundam. Informaticae 25 (1) (1996)
Paliath Narendran
Solving Linear Equations over Polynomial Semirings. LICS (1996)
Qing Guo, Paliath Narendran, David A. Wolfram
Unification and Matching Modulo Nilpotence. CADE (1996)
Paliath Narendran, Michaël Rusinowitch
Any Ground Associative-Commutative Theory Has a Finite Canonical System. J. Autom. Reason. 17 (1) (1996)
Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
Some Independent Results for Equational Unification. RTA (1995)
Seth Chaiken, Paliath Narendran
The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation. ISCAS (1995)
David Cyrluk, Paliath Narendran
Ground Temporal Logic: A Logic for Hardware Verification. CAV (1994)
Friedrich Otto, Paliath Narendran
Codes Modulo Finite Monadic String-Rewriting Systems. Theor. Comput. Sci. 134 (1) (1994)
Paliath Narendran, Frank Pfenning, Richard Statman
On the Unification Problem for Cartesian Closed Categories LICS (1993)
Paliath Narendran, Michaël Rusinowitch
The Unifiability Problem in Ground AC Theories LICS (1993)
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. J. ACM 40 (1) (1993)
Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang
On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. 113 (1) (1993)
Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39 (2) (1992)
Deepak Kapur, Paliath Narendran
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers LICS (1992)
Deepak Kapur, Paliath Narendran
Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reason. 9 (2) (1992)
Paliath Narendran, Michaël Rusinowitch
Any Gound Associative-Commutative Theory Has a Finite Canonical System. RTA (1991)
Deepak Kapur, Paliath Narendran, Hantao Zhang
Automating Inductionless Induction Using Test Sets. J. Symb. Comput. 11 (1/2) (1991)
Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
Semi-Unification. Theor. Comput. Sci. 81 (2) (1991)
Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
It is undecidable whether a finite special string-rewriting system presents a group. Discret. Math. 98 (2) (1991)
Klaus Madlener, Paliath Narendran, Friedrich Otto
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. ICALP (1991)
Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang
Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28 (4) (1991)

Paliath Narendran.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paliath Narendran