The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michaël Rusinowitch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gregory Kucherov, Michaël Rusinowitch
    Matching a Set of Strings with Variable Length don't Cares. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:178, n:1-2, pp:129-154 [Journal]
  2. Emmanuel Kounalis, Michaël Rusinowitch
    Mechanizing Inductive Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1990, pp:240-245 [Conf]
  3. Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch
    A Traffic Classification Algorithm for Intrusion Detection. [Citation Graph (0, 0)][DBLP]
    AINA Workshops (1), 2007, pp:188-193 [Conf]
  4. Adel Bouhoula, Michaël Rusinowitch
    SPIKE: A System for Automatic Inductive Proofs. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:576-577 [Conf]
  5. Emmanuel Kounalis, Michaël Rusinowitch
    Studies on the Ground Convergence Property of Conditional Theories. [Citation Graph (0, 0)][DBLP]
    AMAST, 1991, pp:363-376 [Conf]
  6. Abdessamad Imine, Pascal Molli, Gérald Oster, Michaël Rusinowitch
    Deductive Verification of Distributed Groupware Systems. [Citation Graph (0, 0)][DBLP]
    AMAST, 2004, pp:226-240 [Conf]
  7. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    Unification Modulo ACU I Plus Homomorphisms/Distributivity. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:442-457 [Conf]
  8. Jieh Hsiang, Michaël Rusinowitch
    A New Method for Establishing Refutational Completeness in Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:141-152 [Conf]
  9. Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
    Tree Automata with Equality Constraints Modulo Equational Theories. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:557-571 [Conf]
  10. Emmanuel Kounalis, Michaël Rusinowitch
    On Word Problems in Horn Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:527-537 [Conf]
  11. Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch
    Automated Verification by Induction with Associative-Commutative Operators. [Citation Graph (0, 0)][DBLP]
    CAV, 1996, pp:220-231 [Conf]
  12. Alessandro Armando, David A. Basin, Yohan Boichut, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Paul Hankes Drielsma, Pierre-Cyrille Héam, Olga Kouchnarenko, Jacopo Mantovani, Sebastian Mödersheim, David von Oheimb, Michaël Rusinowitch, Judson Santiago, Mathieu Turuani, Luca Viganò, Laurent Vigneron
    The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:281-285 [Conf]
  13. Alessandro Armando, David A. Basin, Mehdi Bouallagui, Yannick Chevalier, Luca Compagna, Sebastian Mödersheim, Michaël Rusinowitch, Mathieu Turuani, Luca Viganò, Laurent Vigneron
    The AVISS Security Protocol Analysis Tool. [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:349-353 [Conf]
  14. Michaël Rusinowitch, Sorin Stratulat, Francis Klay
    Mechanical Verification of an Ideal Incremental ABR Conformance. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:344-357 [Conf]
  15. Paliath Narendran, Michaël Rusinowitch
    The Theory of Total Unary RPO Is Decidable. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:660-672 [Conf]
  16. Gregory Kucherov, Michaël Rusinowitch
    Matching a Set of Strings with Variable Length Don't Cares. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:230-247 [Conf]
  17. Michaël Rusinowitch, Mathieu Turuani
    Protocol Insecurity with Finite Number of Sessions is NP-Complete. [Citation Graph (0, 0)][DBLP]
    CSFW, 2001, pp:174-0 [Conf]
  18. Alessandro Armando, Silvio Ranise, Michaël Rusinowitch
    Uniform Derivation of Decision Procedures by Superposition. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:513-527 [Conf]
  19. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron
    Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:128-141 [Conf]
  20. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
    Relating Two Standard Notions of Secrecy. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:303-318 [Conf]
  21. Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma
    RPO Constraint Solving Is in NP. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:385-398 [Conf]
  22. Emmanuel Kounalis, Michaël Rusinowitch
    On Word Problems in Horn Theories. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:144-160 [Conf]
  23. Emmanuel Kounalis, Michaël Rusinowitch
    A Proof System for Conditional Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:51-63 [Conf]
  24. Gregory Kucherov, Michaël Rusinowitch
    The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:262-275 [Conf]
  25. Béchir el Ayeb, Pierre Marquis, Michaël Rusinowitch
    Deductive/Abductvie Diagnosis: The DA-Principles. [Citation Graph (0, 0)][DBLP]
    ECAI, 1990, pp:47-52 [Conf]
  26. Abdessamad Imine, Pascal Molli, Gérald Oster, Michaël Rusinowitch
    Proving Correctness of Transformation Functions Functions in Real-Time Groupware. [Citation Graph (0, 0)][DBLP]
    ECSCW, 2003, pp:277-293 [Conf]
  27. Gregory Kucherov, Michaël Rusinowitch
    Patterns in Words versus Patterns in Trees: A Brief Survey and New Results. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1999, pp:283-296 [Conf]
  28. Béchir el Ayeb, Pierre Marquis, Michaël Rusinowitch
    A New Diagnosis Approach by Deduction and Abduction. [Citation Graph (0, 0)][DBLP]
    Expert Systems in Engineering, 1990, pp:32-46 [Conf]
  29. Michaël Rusinowitch, Laurent Vigneron
    Automated deduction with associative commutative operators. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:185-199 [Conf]
  30. Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch
    Observational Proofs with Critical Contexts. [Citation Graph (0, 0)][DBLP]
    FASE, 1998, pp:38-53 [Conf]
  31. Emmanuel Kounalis, Michaël Rusinowitch
    Automatic Proof Methods for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:307-317 [Conf]
  32. Michaël Rusinowitch
    Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules. [Citation Graph (0, 0)][DBLP]
    FGCS, 1988, pp:524-531 [Conf]
  33. Julien Musset, Michaël Rusinowitch
    Computing Meta-transitions for Linear Transition Systems with Polynomials. [Citation Graph (0, 0)][DBLP]
    FME, 2003, pp:562-581 [Conf]
  34. Abdessamad Imine, Pascal Molli, Gérald Oster, Michaël Rusinowitch
    Towards Synchronizing Linear Collaborative Objects with Operational Transformation. [Citation Graph (0, 0)][DBLP]
    FORTE, 2005, pp:411-427 [Conf]
  35. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:124-135 [Conf]
  36. Yannick Chevalier, Michaël Rusinowitch
    Combining Intruder Theories. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:639-651 [Conf]
  37. Jieh Hsiang, Michaël Rusinowitch
    On Word Problems in Equational Theories. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:54-71 [Conf]
  38. Michaël Rusinowitch
    A Decidable Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:21- [Conf]
  39. Adel Bouhoula, Michaël Rusinowitch
    Automatic Case Analysis in Proof by Induction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:88-94 [Conf]
  40. Jieh Hsiang, Michaël Rusinowitch, Kô Sakai
    Complete Inference Rules for the Cancellation Laws. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1987, pp:990-992 [Conf]
  41. Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch
    Protocol Analysis in Intrusion Detection Using Decision Tree. [Citation Graph (0, 0)][DBLP]
    ITCC (1), 2004, pp:404-408 [Conf]
  42. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    An NP Decision Procedure for Protocol Insecurity with XOR. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:261-270 [Conf]
  43. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
    Decision Problems in Ordered Rewriting. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:276-286 [Conf]
  44. Paliath Narendran, Michaël Rusinowitch
    The Unifiability Problem in Ground AC Theories [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:364-370 [Conf]
  45. Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch
    SPIKE, an Automatic Theorem Prover. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:460-462 [Conf]
  46. Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
    Compiling and Verifying Security Protocols. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:131-160 [Conf]
  47. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    ACID-Unification Is NEXPTIME-Decidable. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:169-178 [Conf]
  48. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
    A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures. [Citation Graph (0, 0)][DBLP]
    PPDP, 2005, pp:12-22 [Conf]
  49. Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch
    SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:428-431 [Conf]
  50. Yannick Chevalier, Michaël Rusinowitch
    Hierarchical Combination of Intruder Theories. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:108-122 [Conf]
  51. Paliath Narendran, Michaël Rusinowitch
    Any Gound Associative-Commutative Theory Has a Finite Canonical System. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:423-434 [Conf]
  52. Michaël Rusinowitch
    Rewriting for Deduction and Verification. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:2- [Conf]
  53. Michaël Rusinowitch
    Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:225-240 [Conf]
  54. Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez
    Algorithms and Reductions for Rewriting Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:166-180 [Conf]
  55. Gregory Kucherov, Michaël Rusinowitch
    On ground reducibility problem for word rewriting systems with variables. [Citation Graph (0, 0)][DBLP]
    SAC, 1994, pp:271-276 [Conf]
  56. Eric Monfroy, Michaël Rusinowitch, René Schott
    Implementing non-linear constraints with cooperative solvers. [Citation Graph (0, 0)][DBLP]
    SAC, 1996, pp:63-72 [Conf]
  57. Michaël Rusinowitch, Laurent Vigneron
    Automated Deduction Associative-Commutative Operators. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:6, n:, pp:23-56 [Journal]
  58. Emmanuel Kounalis, Michaël Rusinowitch
    Reasoning with Conditional Axioms. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:2, pp:125-149 [Journal]
  59. Emmanuel Kounalis, Michaël Rusinowitch
    Mechanizing inductive reasoning. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:41, n:, pp:216-226 [Journal]
  60. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    Deciding the Security of Protocols with Commuting Public Key Encryption. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:125, n:1, pp:55-66 [Journal]
  61. Michaël Rusinowitch
    The practice of cryptographic protocol verification. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:55, n:1, pp:- [Journal]
  62. Michaël Rusinowitch
    Automated analysis of security protocols. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:3, pp:- [Journal]
  63. Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez
    Algorithms and Reductions for Rewriting Problems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:46, n:3, pp:257-276 [Journal]
  64. Alessandro Armando, Silvio Ranise, Michaël Rusinowitch
    A rewriting approach to satisfiability procedures. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:2, pp:140-164 [Journal]
  65. Paliath Narendran, Michaël Rusinowitch
    Guest Editorial. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:2, pp:345- [Journal]
  66. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    Closure properties and decision problems of dag automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:5, pp:231-240 [Journal]
  67. Gregory Kucherov, Michaël Rusinowitch
    Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:4, pp:209-215 [Journal]
  68. Michaël Rusinowitch
    On Termination of the Direct Sum of Term-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:2, pp:65-70 [Journal]
  69. Jieh Hsiang, Michaël Rusinowitch
    Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:559-587 [Journal]
  70. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    Unification Modulo ACUI Plus Distributivity Axioms. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:33, n:1, pp:1-28 [Journal]
  71. Adel Bouhoula, Michaël Rusinowitch
    Implicit Induction in Conditional Theories. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1995, v:14, n:2, pp:189-235 [Journal]
  72. Paliath Narendran, Michaël Rusinowitch
    Any Ground Associative-Commutative Theory Has a Finite Canonical System. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1996, v:17, n:1, pp:131-143 [Journal]
  73. Michaël Rusinowitch, Sorin Stratulat, Francis Klay
    Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:30, n:2, pp:53-177 [Journal]
  74. Alessandro Armando, David A. Basin, Jorge Cuéllar, Michaël Rusinowitch, Luca Viganò
    Automated Reasoning for Security Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:36, n:1-2, pp:1-3 [Journal]
  75. Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch
    The Term Rewriting Approach to Automated Theorem Proving. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:14, n:1&2, pp:71-99 [Journal]
  76. Alessandro Armando, Michaël Rusinowitch, Sorin Stratulat
    Incorporating Decision Procedures in Implicit Induction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:34, n:4, pp:241-258 [Journal]
  77. Emmanuel Kounalis, Michaël Rusinowitch
    On Word Problems in Horn Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:1/2, pp:113-127 [Journal]
  78. Michaël Rusinowitch
    Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:3, n:1/2, pp:117-131 [Journal]
  79. Michaël Rusinowitch
    Theorem-Proving with Resolution and Superposition. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:1/2, pp:21-49 [Journal]
  80. Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch
    Automated Mathematical Induction. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:5, pp:631-668 [Journal]
  81. Georg Gottlob, Miki Hermann, Michaël Rusinowitch
    2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:6, pp:639-640 [Journal]
  82. Adel Bouhoula, Michaël Rusinowitch
    Observational proofs by rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:675-698 [Journal]
  83. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    An NP decision procedure for protocol insecurity with XOR. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:247-274 [Journal]
  84. Abdessamad Imine, Michaël Rusinowitch, Gérald Oster, Pascal Molli
    Formal design and verification of operational transformation algorithms for copies convergence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:2, pp:167-183 [Journal]
  85. Michaël Rusinowitch, Mathieu Turuani
    Protocol insecurity with a finite number of sessions, composed keys is NP-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:451-475 [Journal]
  86. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
    Deciding the confluence of ordered term rewrite systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:1, pp:33-55 [Journal]
  87. Michaël Rusinowitch
    Éditorial. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2004, v:23, n:3, pp:289-290 [Journal]
  88. Abdessamad Imine, Michaël Rusinowitch
    Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:213-234 [Conf]
  89. Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch
    Towards an Automatic Analysis of Web Service Security. [Citation Graph (0, 0)][DBLP]
    FroCos, 2007, pp:133-147 [Conf]
  90. Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch
    Verifying Cryptographic Protocols with Subterms Constraints. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:181-195 [Conf]
  91. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    Intruders with Caps. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:20-35 [Conf]
  92. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
    Relating two standard notions of secrecy [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  93. Combinable Extensions of Abelian Groups. [Citation Graph (, )][DBLP]


  94. Cap unification: application to protocol security modulo homomorphic encryption. [Citation Graph (, )][DBLP]


  95. Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. [Citation Graph (, )][DBLP]


  96. Relating two standard notions of secrecy. [Citation Graph (, )][DBLP]


  97. Unification Modulo Homomorphic Encryption. [Citation Graph (, )][DBLP]


  98. Data Structures with Arithmetic Constraints: A Non-disjoint Combination. [Citation Graph (, )][DBLP]


  99. Rewrite-based verification of XML updates. [Citation Graph (, )][DBLP]


  100. Closure of Hedge-Automata Languages by Hedge Rewriting. [Citation Graph (, )][DBLP]


  101. An inference system for detecting firewall filtering rules anomalies. [Citation Graph (, )][DBLP]


  102. A Flexible Access Control Model for Distributed Collaborative Editors. [Citation Graph (, )][DBLP]


  103. Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. [Citation Graph (, )][DBLP]


  104. Safe and Efficient Strategies for Updating Firewall Policies. [Citation Graph (, )][DBLP]


  105. Abusing SIP Authentication. [Citation Graph (, )][DBLP]


  106. Automatic Composition of Services with Security Policies. [Citation Graph (, )][DBLP]


  107. Rewrite based Verification of XML Updates [Citation Graph (, )][DBLP]


  108. Compiling and securing cryptographic protocols [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.614secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002