Home Courses For Students Research Interests Professional Service



       
  Software for Download (provided free of charge for research and education purposes only. By dowloading you are agreeing to the following licensing terms):
LRR: Laboratory for Rapid Rewriting (for linux machines)
  Paper on LRR for download (LRR: A Laboratory for Rapid Rewriting, S.A. Senanayake and R.M. Verma, Proc. RTA, 1999): pdf format
  Artificial Intelligence, Logic in Computer Science, Programming Languages: Formal methods including rewriting techniques and symbolic computation with applications to automated reasoning and verification, functional & equational programming, and computer algebra ; design and analysis of algorithms/heuristics for and complexity of problems in automated deduction and rewriting ; fast and efficient implementations of rewriting methods for verification and equational programming.  
     
  Selected Publications  
 
Uniqueness of Normal Forms for Shallow Rewrite Systems
  (with N. Radcliffe and L. Moraes)
ACM Transactions on Computational Logic (TOCL), Vol. 18, No. 2, June 2017.
Reducing Joinability to Confluence: Preserving Linearity and Shallowness
  (with L. Moraes)
International Workshop on Confluence (IWC), September 2016.
New Undecidability Results for Properties of Term Rewriting Systems
  Electr. Notes Theor. Comput. Sci. 290: 69-85, Dec 2012.
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
  (with N. Radcliffe)
Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 2010, pp. 284-295. Available on internet.
A Polynomial Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems
  (with J. Zinn)
Applicable Algebra in Engineering, Communication and Computing Journal, Vol. 21, No. 6, December 2010, pp. 459-485. This preprint is close to the final version.
New Undecidability Results for Properties of Term Rewriting Systems
  Presented at RULE Workshop, July 2008.
Complexity of Normal Form Properties and Reductions for Term Rewriting Systems
  Fundamenta Informaticae journal, Vol. 92, Nos. 1-2, 2009, pp. 145-168.
A Polynomial-time Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems
  (with J. Zinn)
Presented at IEEE LICS 2006 (short presentation), July 2006.
A New Decidability Technique for Ground Rewrite Systems with Applications
  (with A. Hayrapetyan)
ACM Transactions on Computational Logic, Volume 6, Number 1, January 2005, pages 102-123 Link to paper
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
  (with G. Godoy and A. Tiwari)
Annals of Pure and Applied Logic, Vol 130, Nos. 1-3, pages 33-59 (LICS special issue), December 2004.
Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems
  (with G. Godoy and A. Tiwari)
AAECC journal, Vol 15, No. 1, pages 13-36, June 2004.
On the Confluence of Linear Shallow Rewrite Systems
  (with G. Godoy and A. Tiwari)
Proceedings of the Symposium on Theoretical Aspects of Computer Science, Feb. 2003.
Algorithms and Reductions for Rewriting Problems, II.
  Information Processing Letters Vol. 84, No. 4, November 2002, pp. 227-233.
Algorithms and Reductions for Rewriting Problems
  (with M. Rusinowitch and D. Lugiez)
Fundamenta Informaticae, Vol. 46, No. 3, May 2001, pp. 257-276.
Preliminary version: Proceedings of the International Conference on Rewriting Techniques and Applications (RTA), Springer-Verlag LNCS 1379, 1998.
LRR: A Laboratory for Rapid Term Rewriting
  (with S.A. Senanayake)
Proceedings of the International Conference on Rewriting Techniques and Applications (RTA), Springer-Verlag LNCS, July 1999.
RPO Constraint Solving is in NP
  (with P. Narendran and M. Rusinowitch)
Proceedings of the International Conference on Computer Science Logic (CSL), Springer-Verlag LNCS, 1999.
Uniqueness of Normal Forms for Nonlinear Rewriting Systems: Root Overlaps,
  Proceedings of the International Symposium on Fundamentals of Computation Theory (FCT), Springer-Verlag LNCS 1279, 1997.
Unicity and Modularity of Confluence of Term Rewriting Systems,
  submitted for publication.
Preliminary version: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) 1995.
A Theory of Using History for Equational Systems with Applications,
  Journal of the ACM, Vol. 42, No. 5, September 1995, pp. 984-1020.
Preliminary version: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 1991.
Tight Bounds for AC Matching Problems,
  (with I.V. Ramakrishnan)
Information and Computation, Vol, 101, No. 1, pp 33-69, November 1992.
Strings, Trees and Patterns,
  Information Processing Letters, Vol. 41, pp. 157-161, March 1992.

 

 
     
  Text, Data and Information Analytics: Search engines; data and text mining; storage and access methods for very large databases, including temporal/spatial/text/image databases, with applications to scientific databases, geographic and medical information systems; storage and access methods for keyword-based information retrieval.  
     
  Computer and Network Security: design and verification of cryptographic protocols, Wireless Sensor Network security, phishing, security of big data frameworks.
Check out the ReDAS Laboratory!
 
       
  Parallel computing: Parallel I/O, simulation of interconnection networks, parallel algorithms and implementations, applications of graph theory to parallel computing    
       
  Design and Analysis of recursive algorithms      
       
  Selected Publications    
 
Scaling and Effectiveness of Email Masquerade Attacks: Exploiting Natural Language Generation
  (with S. Baki, A. Mukherjee and O. Gnawali)
In Proceedings of the 12th ACM Asia Conference on Computer and Communications Security (ASIACCS 2017).
Download Paper
``What's in a URL: Fast and Effective Malicious URL Detection,''
  (with A. Das)
Proc. 3rd ACM International Workshop on Security and Privacy Analytics (IWSPA@CODASPY), March 2017.
Comprehensive Method for Detecting Phishing Emails Using Correlation-based Analysis and User Participation
  (with E.A. Ayman)
In Proceedings of the 7th ACM Asia Conference on Data and Application Security and Privacy (CODASPY 2017).
University of Houston at CL-SciSumm 2016: SVMs with tree kernels and Sentence Similarity
  (with L. Moraes, S. Baki and D. Lee)
Proc. BIRNDL 2016 Joint Workshop on Bibliometric-enhanced Information Retrieval and NLP for Digital Libraries. pdf
Mining the Web for Collocations: IR Models of Term Associations
  (with V. Vuppuluri, A. Nguyen, A. Mukherjee, G. Mammar, S. Baki and R. Armstrong )
Proc. 17th Int'l Conf. on Intellgent Text Processing and Computational Linguistics (CICLING) 2016.

Best Paper Award - First Place

pdf
The Efficacy of Epidemic Algorithms on Detecting Node Replicas in Wireless Sensor Networks
  (with N. Shashidhar and C. Kari)
Journal of Sensor and Actuator Networks, Vol.4, No.4, December 2015, pp.378-409
A New Approach for Idiom Identification Based on Meanings and the Web
  (with V. Vuppuluri)
Proc. 10th Recent Advances in Natural Language Processing (RANLP) 2015, Sept. 2015 pdf
PhishIDetector: Message-Id Based Automatic Phishing Detection
  (with N. Rai)
Proc. 13th International Conference on Security and Cryptography (SECRYPT) 2015, Jul. 2015 pdf
Integrity Protection for Big Data Processing with Dynamic Redundancy Computation
  (with Z. Gao, N. Desalvo, P.D. Khoa, S.H. Kim, L. Xu, W. Ro and W. Shi)
Proc. 12th IEEE International Conference on Autonomic Computing (ICAC), Jul. 2015
On the Character of Phishing URLs: Accurate and Robust Statistical Learning Classifiers
  (with K. Dyer)
Proc. 5th ACM Conference on Data and Application Security and Privacy (CODASPY) 2015, Mar. 2015.
ACM DL Author-ize serviceOn the Character of Phishing URLs: Accurate and Robust Statistical Learning Classifiers
Rakesh Verma, Keith Dyer
CODASPY '15 Proceedings of the 5th ACM Conference on Data and Application Security and Privacy, 2015
Detecting Classical and Hijack Based Phishing Sites
  (with T. Thakur)
Proc. 10th International Conference on Information Systems Security (ICISS) 2014, pages 318-337, Dec. 2014.
Semantic Feature Selection for Text With Application to Phishing Email Detection
  (with N. Hossain)
Proc. 16th International Conference on Information Security and Cryptography (ICISC) 2013, pp. 455-468, LNCS 8565, Sept. 2014.
Modeling and analysis of LEAP, a key management protocol for wireless sensor networks
  (with B. Basile)
Proc. IEEE International Workshop on Security and Privacy of Mobile, Wireless and Sensor Networks (MWSN) 2013, June 2013
Detecting Phishing Emails the Natural Language Way
  (with N. Shashidhar and N. Hossain)
Proc. 17th European Symposium on Research in Computer Security (ESORICS) 2012, pp. 69-85, Sept. 2012.
Two-Pronged Phish Snagging
  (with N. Shashidhar and N. Hossain)
Proc. 7th IEEE Conference on Availability, Reliability and Security 2012, pp. 174-179, August 2012.
Combining Syntax and Semantics for Automated Extractive Single-Document Summarization
  (with A. Barrera)
Proc. 13th International Conference on Intelligent Text Processing and Computational Linguistics (CICLING) 2012, vol. 2, March 2012. pdf
Automated Extractive Single-Document Summarization: Beating the Baselines with a New Approach
  (with A. Barrera)
Proc. ACM Symposium on Applied Computing 2011, pp. 267-268, March 2011.
SemQuest: University of Houston's Question Answering System
  (with A. Barrera and R. Vincent)
Proc. Text Analysis Conference (TAC) 2011, November 2011, Available on the web from NIST.
R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks
  (with S. Blackshear)
Proc. ACM Symposium on Applied Computing - Security Track 2010, pp. 1985-1992, March 2010.
Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity
  (with Z. Liang)
Proc. 5th Fourth International Conference on Information Systems Security (ICISS 2009), pp. 101-116, December 2009.
Complexity of Checking Freshness of Cryptographic Protocols
  (with Z. Liang)
Proc. 4th Fourth International Conference on Information Systems Security (ICISS 2008), pp. 86-101, December 2008. pdf
Semantic Multi-Document Update Summarization Techniques
  (with D. Kent and P. Chen)
Proc. TAC 2008 Nov. 2008. Available on the web from NIST.
Improving Results for Proving Undecidability of Checking Cryptographic Protocols
  (with Z. Liang)
In Proc. of The 3rd International Conference on Availability, Reliability and Security (ARES 2008), pp. 1067-1074, March 2008. pdf
Semantic Analysis of Association Rules
  (with P. Chen, J.C. Meininger and W. Chan)
In Proc. of FLAIRS 2008: 270-275, April 2008.
Secrecy Checking of Protocols: Solution of an Open Problem
  (with Z. Liang)
Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis, July 2007. pdf
A Semantic Free-text Summarization System Using Ontology Knowledge
  (with P. Chen and Wei Lu)
Proc. Document Understanding Conference, April 2007.
A Query-based Medical Information Summarization System Using Ontology Knowledge
  (with P. Chen)
Proc. 19th International Symposium on Computer-Based Medical Systems, June 2006.
Efficient Declustering Techniques for keyword-based Information Retrieval
  (with S. Behl)
Proc. 15th International Conference on Parallel and Distributed Systems, Sept. 2002.
K-tree/forest: Efficient Indexes for Boolean Queries
  (with S. Behl)
25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 2002.
Tight Bounds for Prefetching and Buffer Management of Parallel I/O Systems
(with P. Varman)
IEEE Transactions on Parallel and Distributed Computing Vol. 10, No. 12, pp. 1262-1275, December 1999.
Preliminary Version: Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS), Springer-Verlag LNCS 1996.
An Efficient Multiversion Access Structure
(with P. Varman)
IEEE Transactions on Knowledge and Data Engineering, Vol. 9, Number 3, May/June 1997, pp. 391-410.
On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio
(with S. Huang, H. Liu)
Information Processing Letters, Vol. 63, 1997, pp. 123-129.
General Techniques for Analyzing Recursive Algorithms with Applications
SIAM Journal of Computing, Vol. 26, April 1997, pp. 568-581.
A New Combinatorial Approach to Optimal Embeddings of Rectangles
(with S. Huang, H. Liu)
Algorithmica, Vol. 16, July 1996, pp. 161-180.
Preliminary version: Proceedings of the IEEE International Parallel Processing Symposium (IPPS) 1994.
A general method and a master theorem for divide-and-conquer recurrences with applications
Journal of Algorithms, Vol. 16, No. 1, January 1994, pp. 67-79.