The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bruno Legeard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bruno Legeard, Emmanuel Legros
    Short Overview of the CLPS System. [Citation Graph (1, 0)][DBLP]
    PLILP, 1991, pp:431-433 [Conf]
  2. Jacques Julliand, Bruno Legeard, Thierry Machicoane, Benoit Parreaux, Bruno Tatibouët
    Specification of an Integrated Circuit Card Protocol Application Using the B Method and Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    B, 1998, pp:273-292 [Conf]
  3. Eddie Jaffuel, Bruno Legeard
    LEIRIOS Test Generator: Automated Test Generation from B Models. [Citation Graph (0, 0)][DBLP]
    B, 2007, pp:277-280 [Conf]
  4. Fabrice Bouquet, Bruno Legeard, Fabien Peureux, Eric Torreborre
    Mastering Test Generation from Smart Card Software Formal Models. [Citation Graph (0, 0)][DBLP]
    CASSIS, 2004, pp:70-85 [Conf]
  5. Fabrice Bouquet, Frédéric Dadeau, Bruno Legeard
    Automated Boundary Test Generation from JML Specifications. [Citation Graph (0, 0)][DBLP]
    FM, 2006, pp:428-443 [Conf]
  6. Fabrice Bouquet, Frédéric Dadeau, Bruno Legeard, Mark Utting
    Symbolic Animation of JML Specifications. [Citation Graph (0, 0)][DBLP]
    FM, 2005, pp:75-90 [Conf]
  7. Fabrice Bouquet, Bruno Legeard
    Reification of Executable Test Scripts in Formal Specicifation-Based Test Generation: The Java Card Transaction Mechanism Case Study. [Citation Graph (0, 0)][DBLP]
    FME, 2003, pp:778-795 [Conf]
  8. Bruno Legeard, Fabien Peureux, Mark Utting
    Automated Boundary Testing from Z and B. [Citation Graph (0, 0)][DBLP]
    FME, 2002, pp:21-40 [Conf]
  9. Eddy Bernard, Fabrice Bouquet, Amandine Charbonnier, Bruno Legeard, Fabien Peureux, Mark Utting, Eric Torreborre
    Model-Based Testing from UML Models. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (2), 2006, pp:223-230 [Conf]
  10. Fabrice Bouquet, Frédéric Dadeau, Bruno Legeard
    How Symbolic Animation Can Help Designing an Efficient Formal Model. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2005, pp:96-110 [Conf]
  11. Fabrice Bouquet, Bruno Legeard, Mark Utting, Nicolas Vacelet
    Faster Analysis of Formal Specifications. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2004, pp:239-258 [Conf]
  12. Jean-Jacques Chabrier, Claudine Pradelles, Bruno Legeard
    Applications of Constraints Logic Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:944- [Conf]
  13. Pierre Baptiste, Bruno Legeard, Hamza Zidoum
    Sequences Constraint Solving in Constraints Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1994, pp:804-807 [Conf]
  14. Michel Rueher, Didier Ladret, Bruno Legeard
    Capturing software processes through the generated objects. [Citation Graph (0, 0)][DBLP]
    ISPW, 1988, pp:148-152 [Conf]
  15. Nikolai Kosmatov, Bruno Legeard, Fabien Peureux, Mark Utting
    Boundary Coverage Criteria for Test Generation from Formal Models. [Citation Graph (0, 0)][DBLP]
    ISSRE, 2004, pp:139-150 [Conf]
  16. Fabrice Ambert, Sébastien Chemin, Bruno Legeard
    Intégration de domaines à variables dans un solveur de contraintes ensemblistes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2003, pp:217-220 [Conf]
  17. Fabrice Ambert, Bruno Legeard, Hamza Zidoum
    CLPS : un langage de PLC ensembliste. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1995, pp:337-340 [Conf]
  18. Eric Boucher, Bruno Legeard
    Fonctions de voisinage progressives et admissibles pour des méthodes d'optimisation en PLC sur séquences. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1996, pp:255-0 [Conf]
  19. Eric Boucher, Bruno Legeard
    Procédure exacte d'optimisation dans le paradigme de la programmation logique avec contraintes ensemblistes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1997, pp:179-194 [Conf]
  20. Fabrice Bouquet, Bruno Legeard, Fabien Peureux, Laurent Py
    Un système de résolution de contraintes ensemblistes pour l'évaluation de spécifications B. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2000, pp:125-144 [Conf]
  21. Fabrice Bouquet, Bruno Legeard, Nicolas Vacelet
    Un format fédérateur pour l'évaluation de spécifications formelles en programmation logique avec contraintes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2003, pp:203-216 [Conf]
  22. Lotfi Berkaoui, Bruno Legeard
    Représentation de séquences définies sur des ensembles non instanciés par arbre PQR patiel. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1998, pp:251-0 [Conf]
  23. Isabelle Jacques, Bruno Legeard, Laurent Py
    Résolution d'un problème de découpe à deux dimensions en programmation logique avec contraintes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1998, pp:95-0 [Conf]
  24. Bruno Legeard, Emmanuel Legros
    Tests de satisfiabilité dans le langage de programmation en logique avec contraintes ensemblistes: CLPS. [Citation Graph (0, 0)][DBLP]
    JFPL, 1992, pp:18-34 [Conf]
  25. Christophe Varnier, Pierre Baptiste, Bruno Legeard
    Le traitement des contraintes disjonctives dans un problème d'ordonnancement : exemple du «Hoist Scheduling Problem». [Citation Graph (0, 0)][DBLP]
    JFPL, 1993, pp:343-363 [Conf]
  26. Christophe Varnier, Pierre Baptiste, Bruno Legeard
    Outil d'aide à l'élaboration d'ordonnancement cyclique pour les lignes de traitement de surface. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1995, pp:365-368 [Conf]
  27. Bruno Legeard, Fabien Peureux
    Generation of Functional Test Sequences from B Formal Specifications-Presentation and Industrial Case Study. [Citation Graph (0, 0)][DBLP]
    ASE, 2001, pp:377-381 [Conf]
  28. M. Hibti, Henri Lombardi, Bruno Legeard
    Deciding in HFS-Theory via Linear Integer Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 1993, pp:170-181 [Conf]
  29. Fabrice Bouquet, Frédéric Dadeau, Bruno Legeard, Mark Utting
    JML-Testing-Tools: A Symbolic Animator for JML Specifications Using CLP. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:551-556 [Conf]
  30. Fabrice Bouquet, Bruno Legeard, Fabien Peureux
    CLPS-B - A Constraint Solver for B. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:188-204 [Conf]
  31. Bruno Legeard, Fabien Peureux, Mark Utting
    A Comparison of the BTT and TTF Test-Generation Methods. [Citation Graph (0, 0)][DBLP]
    ZB, 2002, pp:309-329 [Conf]
  32. M. Hibti, Bruno Legeard, Henri Lombardi
    Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:3, pp:205-236 [Journal]
  33. Eddy Bernard, Bruno Legeard, Xavier Luck, Fabien Peureux
    Generation of test sequences from formal specifications: GSM 11-11 standard case study. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2004, v:34, n:10, pp:915-948 [Journal]
  34. Fabrice Bouquet, Bruno Legeard, Fabien Peureux
    CLPS-B - A constraint solver to animate a B specification. [Citation Graph (0, 0)][DBLP]
    STTT, 2004, v:6, n:2, pp:143-157 [Journal]
  35. Séverine Colin, Bruno Legeard, Fabien Peureux
    Preamble computation in automated test case generation using constraint logic programming. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 2004, v:14, n:3, pp:213-235 [Journal]
  36. Bruno Legeard, Fabien Peureux, Mark Utting
    Controlling test case explosion in test generation from B formal models. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 2004, v:14, n:2, pp:81-103 [Journal]
  37. Fabrice Ambert, Sébastien Chemin, Bruno Legeard
    Intégration de domaines à variables dans un solveur de contraintes ensemblistes. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2003, v:22, n:1, pp:217-220 [Journal]
  38. Fabrice Bouquet, Bruno Legeard, Nicolas Vacelet
    Un format fédérateur pour l'évaluation de spécifications formelles en Programmation Logique avec Contraintes. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2003, v:22, n:1, pp:203-216 [Journal]
  39. Bruno Legeard, Fabien Peureux
    B-Testing-Tools : génération de tests aux limites à partir de spécifications B. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2002, v:21, n:9, pp:1189-1218 [Journal]
  40. Eddy Bernard, Bruno Legeard
    Requirements traceability in the model-based testing process. [Citation Graph (0, 0)][DBLP]
    Software Engineering (Workshops), 2007, pp:45-54 [Conf]

  41. A Test Generation Solution to Automate Software Testing. [Citation Graph (, )][DBLP]


  42. Requirements traceability in automated test generation: application to smart card software validation. [Citation Graph (, )][DBLP]


  43. A subset of precise UML for model-based testing. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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