The SCEAS System
Navigation Menu

Search the dblp DataBase


Dominique Méry: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Naima Brown, Dominique Méry
    Towards an Integrated Environment for Concurrent programs Development. [Citation Graph (0, 0)][DBLP]
    AMAST, 1993, pp:407-408 [Conf]
  2. Abdelillah Mokkedem, Dominique Méry
    On Using a Composition Principle to Design Parallel Programs. [Citation Graph (0, 0)][DBLP]
    AMAST, 1993, pp:315-324 [Conf]
  3. Jean-François Pétin, Gérard Morel, Dominique Méry, Patrick Lamboley
    Process Control Engineering: Contribution to a Formal Structuring Framework with the B Method. [Citation Graph (0, 0)][DBLP]
    B, 1998, pp:198-209 [Conf]
  4. Nazim Benaïssa, Dominique Cansell, Dominique Méry
    Integration of Security Policy into System Modeling. [Citation Graph (0, 0)][DBLP]
    B, 2007, pp:232-247 [Conf]
  5. Dominique Cansell, Dominique Méry, Joris Rehm
    Time Constraint Patterns for Event B Development. [Citation Graph (0, 0)][DBLP]
    B, 2007, pp:140-154 [Conf]
  6. Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche
    STRIP: Structural Sharing for Efficient Proof-Search. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:696-700 [Conf]
  7. Raphaël Couturier, Dominique Méry
    An Experiment in Parallelizing an Application Using Formal Methods. [Citation Graph (0, 0)][DBLP]
    CAV, 1998, pp:345-356 [Conf]
  8. Dominique Méry, Abdelillah Mokkedem
    Crocos: An Integrated Environment for Interactive Verification of SDL Specifications. [Citation Graph (0, 0)][DBLP]
    CAV, 1992, pp:343-356 [Conf]
  9. J. Paul Gibson, Dominique Méry
    Formal Modelling of Services for Getting a Better Understanding of the Feature Interaction Problem. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1999, pp:155-179 [Conf]
  10. Francois D. Carrez, Dominique Méry
    Temporal Specifications Directed by Grammar and Design of Process Networks. [Citation Graph (0, 0)][DBLP]
    Specification and Verification of Concurrent Systems, 1988, pp:410-427 [Conf]
  11. J. Paul Gibson, Geoff Hamilton, Dominique Méry
    A Taxonomy for Triggered Interactions Using Fair Object Semantics. [Citation Graph (0, 0)][DBLP]
    FIW, 2000, pp:193-209 [Conf]
  12. Naima Brown, Dominique Méry
    A Proof Environment for Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    FME, 1993, pp:196-215 [Conf]
  13. Bruno Mermet, Dominique Méry
    Service specifications: to B, or not to B. [Citation Graph (0, 0)][DBLP]
    FMSP, 1998, pp:62-69 [Conf]
  14. Dominique Cansell, Dominique Méry, Stephan Merz
    Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 2001, pp:628-634 [Conf]
  15. Bruno Mermet, Dominique Méry
    Incremental Specification of Telecommunication Services. [Citation Graph (0, 0)][DBLP]
    ICFEM, 1997, pp:60-69 [Conf]
  16. Abdelillah Mokkedem, Dominique Méry
    A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:382-397 [Conf]
  17. Dominique Méry
    Requirements for a Temporal B - Assigning Temporal Meaning to Abstract Machines... and to Abstract Systems. [Citation Graph (0, 0)][DBLP]
    IFM, 1999, pp:395-414 [Conf]
  18. Dominique Cansell, Dominique Méry, Stephan Merz
    Predicate Diagrams for the Verification of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    IFM, 2000, pp:380-397 [Conf]
  19. J. Paul Gibson, Geoff Hamilton, Dominique Méry
    Integration Problems in Telephone Feature Requirements. [Citation Graph (0, 0)][DBLP]
    IFM, 1999, pp:129-148 [Conf]
  20. Dominique Cansell, Dominique Méry, Christophe Tabacznyj
    Tutorial 1: Abstraction and Refinement of Concurrent Programs and Formal Specification. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:1037-1038 [Conf]
  21. Beverly A. Sanders, Dominique Méry
    Workshop on Formal Methods for Parallel Programming (FMPPTA 2000). [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:974-976 [Conf]
  22. J. Paul Gibson, Dominique Méry
    Teaching Formal Methods: Lessons to Learn. [Citation Graph (0, 0)][DBLP]
    IWFM, 1998, pp:- [Conf]
  23. J. Paul Gibson, Bruno Mermet, Dominique Méry
    Feature Interactions: A Mixed Semantic Model Approach. [Citation Graph (0, 0)][DBLP]
    IWFM, 1997, pp:- [Conf]
  24. Dominique Méry
    A Proof System to Derive Evantually Properties Under Justice Hypothesis. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:536-544 [Conf]
  25. Dominique Cansell, Dominique Méry
    Abstract Animator for Temporal Specifications: Application to TLA. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:284-299 [Conf]
  26. Dominique Méry, J. Paul Gibson
    Telephone feature verification: Translating SDL to TLA+. [Citation Graph (0, 0)][DBLP]
    SDL Forum, 1997, pp:103-118 [Conf]
  27. Jean-Raymond Abrial, Dominique Cansell, Dominique Méry
    Formal Derivation of Spanning Trees Algorithms. [Citation Graph (0, 0)][DBLP]
    ZB, 2003, pp:457-476 [Conf]
  28. Jean-Raymond Abrial, Dominique Cansell, Dominique Méry
    Refinement and Reachability in EventB. [Citation Graph (0, 0)][DBLP]
    ZB, 2005, pp:222-241 [Conf]
  29. Dominique Cansell, Ganesh Gopalakrishnan, Michael D. Jones, Dominique Méry, Airy Weinzoepflen
    Incremental Proof of the Producer/Consumer Property for the PCI Protocol. [Citation Graph (0, 0)][DBLP]
    ZB, 2002, pp:22-41 [Conf]
  30. Dominique Cansell, Dominique Méry
    Playing with Abstraction and Refinement for Managing Features Interactions. [Citation Graph (0, 0)][DBLP]
    ZB, 2000, pp:148-167 [Conf]
  31. Dominique Cansell, Dominique Méry
    Foundations of the B Method. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2003, v:22, n:3, pp:- [Journal]
  32. Jean-Raymond Abrial, Dominique Cansell, Dominique Méry
    A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2003, v:14, n:3, pp:215-227 [Journal]
  33. Dominique Méry, Beverly A. Sanders
    Editorial Note. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2002, v:20, n:1, pp:5- [Journal]
  34. Dominique Méry
    Méthode Axiomatique Pour Les Propriétés De Fatalité Des Programmes Parallèles. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:3, pp:287-322 [Journal]
  35. Dominique Cansell, Dominique Méry, Stephan Merz
    Diagram Refinements for the Design of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:2, pp:159-174 [Journal]
  36. Dominique Cansell, Dominique Méry
    Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:3, pp:318-337 [Journal]
  37. Dominique Méry
    The N U System as a Development System for Concurrent Programs: delta N U. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:94, n:2, pp:311-334 [Journal]
  38. Abdelillah Mokkedem, Dominique Méry
    On Using Temporal Logic for Refinement and Compositional Verification of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:1, pp:95-138 [Journal]
  39. Dominique Cansell, Dominique Méry
    Proved-Patterns-Based Development for Structured Programs. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:104-114 [Conf]
  40. Dominique Méry, Stephan Merz
    Event Systems and Access Control [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  41. Dominique Cansell, J. Paul Gibson, Dominique Méry
    Refinement: A Constructive Approach to Formal Software Design for a Secure e-voting Interface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:183, n:, pp:39-55 [Journal]
  42. Dominique Cansell, Dominique Méry
    Incremental Parametric Development of Greedy Algorithms. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:185, n:, pp:47-62 [Journal]

  43. Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based Development. [Citation Graph (, )][DBLP]

  44. Proof-Based Design of Security Protocols. [Citation Graph (, )][DBLP]

  45. Cryptographic Protocols Analysis in Event B. [Citation Graph (, )][DBLP]

  46. Formal verification of tamper-evident storage for e-voting. [Citation Graph (, )][DBLP]

  47. Derivation of SystemC code from abstract system models. [Citation Graph (, )][DBLP]

  48. Proof-based design of a microelectronic architecture for MPEG-2 bit-rate measurement . [Citation Graph (, )][DBLP]

Search in 0.008secs, Finished in 0.012secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002