Paliath Narendran
According to our database1,
Paliath Narendran
authored at least 107 papers
between 1984 and 2015.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
On csauthors.net:
Bibliography
2015
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry.
Logical Methods in Computer Science, 2015
Unification and Matching in Hierarchical Combinations of Syntactic Theories.
Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015
2014
Foreword to the special issue on security and rewriting techniques.
Inf. Comput., 2014
Obituary Robert McNaughton 1924 - 2014.
Bulletin of the EATCS, 2014
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining.
Logical Methods in Computer Science, 2014
Theories of Homomorphic Encryption, Unification, and the Finite Variant Property.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014
On Asymmetric Unification and the Combination Problem in Disjoint Theories.
Proceedings of the Foundations of Software Science and Computation Structures, 2014
2013
Hierarchical Combination of Unication Algorithms (Extended Abstract).
Proceedings of the 27th International Workshop on Unification, 2013
Unication Problems Modulo a Theory of Until.
Proceedings of the 27th International Workshop on Unification, 2013
On Forward Closure and the Finite Variant Property.
Proceedings of the Frontiers of Combining Systems, 2013
Hierarchical Combination.
Proceedings of the Automated Deduction - CADE-24, 2013
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis.
Proceedings of the Automated Deduction - CADE-24, 2013
2012
Unification Modulo Chaining.
Proceedings of the Language and Automata Theory and Applications, 2012
Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions.
Proceedings of the Computer Security - ESORICS 2012, 2012
New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012
Some Notes on Basic Syntactic Mutation.
Proceedings of the UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, 2012
The use of types in designing unification algorithms: two case studies.
Proceedings of the UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, 2012
Unification Modulo Synchronous Distributivity.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012
2011
Unification over Distributive Exponentiation (Sub)Theories.
Journal of Automata, Languages and Combinatorics, 2011
String Rewriting and Security Analysis: An Extension of a Result of Book and Otto.
Journal of Automata, Languages and Combinatorics, 2011
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011
2010
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Proceedings of the Proceedings 24th International Workshop on Unification, 2010
Unification modulo a partial theory of exponentiation
Proceedings of the Proceedings 24th International Workshop on Unification, 2010
Cap unification: application to protocol security modulo homomorphic encryption.
Proceedings of the 5th ACM Symposium on Information, 2010
2009
On Extended Regular Expressions.
Proceedings of the Language and Automata Theory and Applications, 2009
Unification Modulo Homomorphic Encryption.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009
2008
Unification and Matching Modulo Leaf-Permutative Equational Presentations.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008
2007
Intruders with Caps.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007
2005
Closure properties and decision problems of dag automata.
Inf. Process. Lett., 2005
A Unification Algorithm for Analysis of Protocols with Blinded Signatures.
Proceedings of the Mechanizing Mathematical Reasoning, 2005
2004
Unification Modulo ACUI Plus Distributivity Axioms.
J. Autom. Reasoning, 2004
2003
Deciding the confluence of ordered term rewrite systems.
ACM Trans. Comput. Log., 2003
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003
ACID-Unification Is NEXPTIME-Decidable.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Unification Modulo ACU I Plus Homomorphisms/Distributivity.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003
2002
Guest Editorial.
Inf. Comput., 2002
2000
Decidability and complexity of simultaneous rigid E-unification with one variable and related results.
Theor. Comput. Sci., 2000
Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages).
SIGACT News, 2000
Complexity of Nilpotent Unification and Matching Problems.
Inf. Comput., 2000
The Theory of Total Unary RPO Is Decidable.
Proceedings of the Computational Logic, 2000
1998
Equational Unification, Word Unification, and 2nd-Order Equational Unification.
Theor. Comput. Sci., 1998
Unification and Matching in Process Algebras.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998
The Decidability of Simultaneous Rigid E-Unification with One Variable.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998
Decision Problems in Ordered Rewriting.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998
Unification of Concept Terms in Description Logics.
ECAI, 1998
RPO Constraint Solving Is in NP.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998
1997
On the Unification Problem for Cartesian Closed Categories.
J. Symb. Log., 1997
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.
J. Autom. Reasoning, 1997
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
Unification of Concept Terms in Description Logics.
Proceedings of the 1997 International Workshop on Description Logics, 1997
1996
Any Ground Associative-Commutative Theory Has a Finite Canonical System.
J. Autom. Reasoning, 1996
Unification Modulo ACI + 1 + 0.
Fundam. Inform., 1996
Solving Linear Equations over Polynomial Semirings.
Proceedings of the Proceedings, 1996
Unification and Matching Modulo Nilpotence.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996
1995
Some Independent Results for Equational Unification.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995
The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation.
Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995
1994
Codes Modulo Finite Monadic String-Rewriting Systems.
Theor. Comput. Sci., 1994
Ground Temporal Logic: A Logic for Hardware Verification.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994
1993
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci., 1993
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
J. ACM, 1993
The Unifiability Problem in Ground AC Theories
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993
On the Unification Problem for Cartesian Closed Categories
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993
1992
Complexity of Unification Problems with Associative-Commutative Operators.
J. Autom. Reasoning, 1992
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM, 1992
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992
1991
Automating Inductionless Induction Using Test Sets.
J. Symb. Comput., 1991
It is undecidable whether a finite special string-rewriting system presents a group.
Discrete Mathematics, 1991
Sufficient-Completeness, Ground-Reducibility and their Complexity.
Acta Inf., 1991
Any Gound Associative-Commutative Theory Has a Finite Canonical System.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
1990
On Ground-Confluence of Term Rewriting Systems
Inf. Comput., May, 1990
It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set.
Mathematical Systems Theory, 1990
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
Inf. Comput., 1990
Some Results on Equational Unification.
Proceedings of the 10th International Conference on Automated Deduction, 1990
1989
Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems.
Theor. Comput. Sci., 1989
Cancellativity in Finitely Presented Semigroups.
J. Symb. Comput., 1989
It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair.
Proceedings of the STACS 89, 1989
1988
Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure.
J. Symb. Comput., 1988
Church-Rosser Thue systems and formal languages.
J. ACM, 1988
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule.
Inf. Process. Lett., 1988
Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems.
Acta Inf., 1988
Rigid E-Unification is NP-Complete
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988
Semi-Unification.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988
Formal Verification of the Sobel Image Processing Chip.
Proceedings of the 25th ACM/IEEE Conference on Design Automation, 1988
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
Proceedings of the 9th International Conference on Automated Deduction, 1988
1987
Matching, unification and complexity.
ACM SIGSAM Bulletin, 1987
On Sufficient-Completeness and Related Properties of Term Rewriting Systems.
Acta Inf., 1987
It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free.
Proceedings of the Applied Algebra, 1987
1986
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems.
Theor. Comput. Sci., 1986
On the Equivalence Problem for Regular Thue Systems.
Theor. Comput. Sci., 1986
Complexity of Sufficient-Completeness.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
Proof by Induction Using Test Sets.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986
NP-Completeness of the Set Unification and Matching Problems.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986
1985
Complexity Results on the Conjugacy Problem for Monoids.
Theor. Comput. Sci., 1985
On Recursive Path Ordering.
Theor. Comput. Sci., 1985
The Church-Rosser Property and Special Thue Systems.
Theor. Comput. Sci., 1985
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System.
Theor. Comput. Sci., 1985
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems.
Theor. Comput. Sci., 1985
The Knuth-Bendix Completion Procedure and Thue Systems.
SIAM J. Comput., 1985
Complexity of Certain Decision Problems about Congruential Languages.
J. Comput. Syst. Sci., 1985
A Path Ordering for Proving Termination of Term Rewriting Systems.
Proceedings of the Mathematical Foundations of Software Development, 1985
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985
Complexity of Matching Problems.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985
An Equational Approach to Theorem Proving in First-Order Predicate Calculus.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985
Reasoning about three dimensional space.
Proceedings of the 1985 IEEE International Conference on Robotics and Automation, 1985
1984
The Undecidability of the Preperfectness of Thue Systems.
Theor. Comput. Sci., 1984
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete
Information and Control, 1984