96 results on '"Narendran, Paliath"'
Search Results
2. On Forward Closure and the Finite Variant Property
3. Hierarchical Combination
4. Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis
5. Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions
6. Unification Modulo Synchronous Distributivity
7. New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants
8. Unification Modulo Chaining
9. Unification Modulo Homomorphic Encryption
10. On Extended Regular Expressions
11. Unification and Matching Modulo Leaf-Permutative Equational Presentations
12. Intruders with Caps
13. A Unification Algorithm for Analysis of Protocols with Blinded Signatures
14. ACID-Unification Is NEXPTIME-Decidable
15. Unification Modulo ACUI Plus Homomorphisms/Distributivity
16. An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation
17. The Theory of Total Unary RPO Is Decidable
18. RPO Constraint Solving Is in NP
19. Unification and matching in process algebras
20. The decidability of simultaneous rigid E-unification with one variable
21. The word matching problem is undecidable for finite special string-rewriting systems that are confluent
22. Unification and matching modulo nilpotence
23. Some independence results for equational unification
24. Ground temporal logic: A logic for hardware verification
25. Any ground associative-commutative theory has a finite canonical system
26. Some results on equational unification
27. On Forward Closure and the Finite Variant Property
28. Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis
29. Hierarchical Combination
30. Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions
31. New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants
32. Unification Modulo Chaining
33. Unification Modulo Synchronous Distributivity
34. Unification Modulo Homomorphic Encryption
35. On Extended Regular Expressions
36. Unification Modulo ACUI Plus Homomorphisms/Distributivity
37. ACID-Unification Is NEXPTIME-Decidable
38. An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation
39. The Theory of Total Unary RPO Is Decidable
40. RPO Constraint Solving Is in NP
41. The word matching problem is undecidable for finite special string-rewriting systems that are confluent
42. Unification and matching modulo nilpotence
43. Some independence results for equational unification
44. Ground temporal logic: A logic for hardware verification
45. Any ground associative-commutative theory has a finite canonical system
46. Some results on equational unification
47. Complexity of sufficient-completeness : Preliminary version
48. It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free
49. It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
50. Semi-unification
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.