Paliath Narendran

Paliath Narendran
Professor
College of Engineering and Applied Sciences
Computer Science
Education

Ph.D. Computer Science, Rensselaer Polytechnic Institute, Troy, NY, 1984

M.Tech. Computer Science, Indian Institute of Technology, Madra, India, 1980

B.Tech. Electrical Engineering, Indian Institute of Technology, Madra, India, 1978

Paliath Narendran
About

Dr. Paliath Narendran is a Professor in the Department of Computer Science at the University at Albany, State University of New York. Before joining UAlbany in 1988, Dr. Narendran worked in the Computer Science Branch of General Electric Corporate Research and Development in Schenectady, New York. He teaches graduate courses in theory of computation, advanced programming concepts, computational logic, and the master's research project.

 

Research Interests

Automated reasoning, formal verification, pattern matching

 

Publications

Selected Publications

On Forward Closure and the Finite Variant Property (with Chris Bouchard, Kim Gero and Chris Lynch) presented at FroCos 2013, Nancy, France, September 18-20, 2013.

On Extended Regular Expressions (with Benjamin Carle) presented at Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009.

Unification and Matching Modulo Leaf-Permutative Equational Presentations (with Thierry Boy de la Tour and Mnacho Echenim) presented at IJCAR 2008, Sydney, Australia, August 12-15, 2008.

Intruders with caps (with S. Anantharaman and M. Rusinowitch) presented at RTA 2007, Paris, France.

Analyzing Protocols that use Modular Exponentiation: Semantic Unification Techniques (with D. Kapur and L. Wang) Technical Report TR 03-2, Department of Computer Science, SUNY, Albany, NY.

A Unification Algorithm for Analysis of Protocols with Blinded Signatures (with D. Kapur and L. Wang) Technical Report TR 02-5, Department of Computer Science, SUNY, Albany, NY.

A Unification Algorithm for the Group Diffie-Hellman Protocol (with C. Meadows) presented at the Workshop on Issues in the Theory of Security (WITS 2002), Portland, Oregon, Jan 2002.

The theory of total unary rpo is decidable (with M. Rusinowitch) presented at the First International Conference on Computational Logic (CL2000), Imperial College, London, UK, July 2000.

Unification of Concept Terms in Description Logics (with F. Baader) presented at the European Conference on Artificial Intelligence (ECAI-98), Brighton, UK, August 1998.

RPO Constraint Solving is in NP (with M. Rusinowitch and R. Verma) presented at the Annual Conference of the European Association for Computer Science Logic (CSL '98), Brno, Czech Republic, August 1998.

Decision Problems in Ordered Rewriting, (with H. Comon, R. Nieuwenhuis and M. Rusinowitch) presented at the Thirteenth Annual Symposium on Logic in Computer Science (LICS), Indianapolis, IN, June 98.

Unification and Matching in Process Algebras (with Q. Guo and S. Shukla) presented at the Ninth International Conference on Rewriting Techniques and Applications, (RTA-98), Tsukuba, Japan, March 1998.

Solving linear equations over polynomial semirings, presented at the Eleventh Annual Symposium on Logic in Computer Science (LICS), Rutgers University, NJ, July 96.

Unification and Matching modulo Nilpotence, (with Qing Guo and David Wolfram) presented at the 13th International Conference on Automated Deduction (CADE-13), Rutgers University, NJ, July-Aug 96.