The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre-Cyrille Héam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
    Handling Algebraic Properties in Automatic Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2006, pp:153-167 [Conf]
  3. Pierre-Cyrille Héam
    Automata for Pro-V Topologies. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:135-144 [Conf]
  4. Pierre-Cyrille Héam
    A Lower Bound For Reversible Automata. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:5, pp:331-341 [Journal]
  5. Pierre-Cyrille Héam
    On Shuffle Ideals. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:4, pp:359-384 [Journal]
  6. Pierre-Cyrille Héam
    Some Topological Properties of Rational Sets. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:275-290 [Journal]
  7. Pierre-Cyrille Héam
    Some complexity results for polynomial rational expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:735-741 [Journal]

  8. Finer Is Better: Abstraction Refinement for Rewriting Approximations. [Citation Graph (, )][DBLP]


  9. How to Handle QoS Aspects in Web Services Substitutivity Verification. [Citation Graph (, )][DBLP]


  10. TAGED Approximations for Temporal Properties Model-Checking. [Citation Graph (, )][DBLP]


  11. Random Generation of Deterministic Tree (Walking) Automata. [Citation Graph (, )][DBLP]


  12. How to Tackle Integer Weighted Automata Positivity. [Citation Graph (, )][DBLP]


  13. Handling Left-Quadratic Rules When Completing Tree Automata. [Citation Graph (, )][DBLP]


  14. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. [Citation Graph (, )][DBLP]


  15. On the Use of Uniform Random Generation of Automata for Testing. [Citation Graph (, )][DBLP]


  16. Component Simulation-based Substitutivity Managing QoS Aspects. [Citation Graph (, )][DBLP]


  17. Composition of Services with Constraints. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002