The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dominique Cansell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bill Stoddart, Dominique Cansell, Frank Zeyda
    Modelling and Proof Analysis of Interrupt Driven Scheduling. [Citation Graph (0, 0)][DBLP]
    B, 2007, pp:155-170 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Dominique Cansell, Dominique Méry
    Abstract Animator for Temporal Specifications: Application to TLA. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:284-299 [Conf]
  8. Jean-Raymond Abrial, Dominique Cansell
    Click'n Prove: Interactive Proofs within Set Theory. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2003, pp:1-24 [Conf]
  9. Dominique Cansell
    B Method. [Citation Graph (0, 0)][DBLP]
    The Seventeen Provers of the World, 2006, pp:142-150 [Conf]
  10. Jean-Raymond Abrial, Dominique Cansell, Guy Laffitte
    "Higher-Order" Mathematics in B. [Citation Graph (0, 0)][DBLP]
    ZB, 2002, pp:370-393 [Conf]
  11. 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]
  12. Jean-Raymond Abrial, Dominique Cansell, Dominique Méry
    Refinement and Reachability in EventB. [Citation Graph (0, 0)][DBLP]
    ZB, 2005, pp:222-241 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Jean-Raymond Abrial, Dominique Cansell
    Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity). [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:5, pp:744-770 [Journal]
  18. 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]
  19. 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]
  20. Dominique Cansell, Dominique Méry
    Proved-Patterns-Based Development for Structured Programs. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:104-114 [Conf]
  21. 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]
  22. 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]

  23. Validating and Animating Higher-Order Recursive Functions in B. [Citation Graph (, )][DBLP]


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


  25. Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method. [Citation Graph (, )][DBLP]


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


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


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


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