- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| j8 |      | Dominique Cansell, Dominique Méry, Cyril Proch: System-on-chip design by proof-based refinement. STTT 11(3): 217-238 (2009) |
| c21 | | Dominique Cansell, Dominique Méry: Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based Development. Rigorous Methods for Software Construction and Analysis 2009: 17-32 |
| c20 | | Michael Leuschel, Dominique Cansell, Michael J. Butler: Validating and Animating Higher-Order Recursive Functions in B. Rigorous Methods for Software Construction and Analysis 2009: 78-92 |
| 2007 | ||
| j7 | | Dominique Cansell, J. Paul Gibson, Dominique Méry: Refinement: A Constructive Approach to Formal Software Design for a Secure e-voting Interface. Electr. Notes Theor. Comput. Sci. 183: 39-55 (2007) |
| j6 | | Dominique Cansell, Dominique Méry: Incremental Parametric Development of Greedy Algorithms. Electr. Notes Theor. Comput. Sci. 185: 47-62 (2007) |
| c19 | | Dominique Cansell, Dominique Méry, Joris Rehm: Time Constraint Patterns for Event B Development. B 2007: 140-154 |
| c18 | | Bill Stoddart, Dominique Cansell, Frank Zeyda: Modelling and Proof Analysis of Interrupt Driven Scheduling. B 2007: 155-170 |
| c17 | | Nazim Benaïssa, Dominique Cansell, Dominique Méry: Integration of Security Policy into System Modeling. B 2007: 232-247 |
| c16 | | Dominique Cansell, Dominique Méry: Proved-Patterns-Based Development for Structured Programs. CSR 2007: 104-114 |
| c15 |  | Joris Rehm, Dominique Cansell: Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method. ISoLA 2007: 179-190 |
| c14 | | Dominique Cansell, J. Paul Gibson, Dominique Méry: Formal verification of tamper-evident storage for e-voting. SEFM 2007: 329-338 |
| 2006 | ||
| j5 | | Dominique Cansell, Dominique Méry: Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm. Theor. Comput. Sci. 364(3): 318-337 (2006) |
| c13 | | |
| 2005 | ||
| j4 | | Jean-Raymond Abrial, Dominique Cansell: Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity). J. UCS 11(5): 744-770 (2005) |
| c12 | | Jean-Raymond Abrial, Dominique Cansell, Dominique Méry: Refinement and Reachability in EventB. ZB 2005: 222-241 |
| 2004 | ||
| c11 | | Dominique Cansell, J.-F. Culat, Dominique Méry, Cyril Proch: Derivation of SystemC code from abstract system models. FDL 2004: 612-624 |
| 2003 | ||
| j3 | | Dominique Cansell, Dominique Méry: Foundations of the B Method. Computers and Artificial Intelligence 22(3-4): 221-256 (2003) |
| j2 | | Jean-Raymond Abrial, Dominique Cansell, Dominique Méry: A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol. Formal Asp. Comput. 14(3): 215-227 (2003) |
| c10 | | Dominique Cansell, Dominique Méry, Cyril Proch: Proof-based design of a microelectronic architecture for MPEG-2 bit-rate measurement . FDL 2003: 435-447 |
| c9 | | Jean-Raymond Abrial, Dominique Cansell: Click'n Prove: Interactive Proofs within Set Theory. TPHOLs 2003: 1-24 |
| c8 | | Jean-Raymond Abrial, Dominique Cansell, Dominique Méry: Formal Derivation of Spanning Trees Algorithms. ZB 2003: 457-476 |
| 2002 | ||
| c7 | | Dominique Cansell, Ganesh Gopalakrishnan, Michael D. Jones, Dominique Méry, Airy Weinzoepflen: Incremental Proof of the Producer/Consumer Property for the PCI Protocol. ZB 2002: 22-41 |
| c6 | | Jean-Raymond Abrial, Dominique Cansell, Guy Laffitte: "Higher-Order" Mathematics in B. ZB 2002: 370-393 |
| 2001 | ||
| j1 | | Dominique Cansell, Dominique Méry, Stephan Merz: Diagram Refinements for the Design of Reactive Systems. J. UCS 7(2): 159-174 (2001) |
| c5 | | Dominique Cansell, Dominique Méry, Stephan Merz: Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams. GI Jahrestagung (1) 2001: 628-634 |
| 2000 | ||
| c4 | | Dominique Cansell, Dominique Méry, Stephan Merz: Predicate Diagrams for the Verification of Reactive Systems. IFM 2000: 380-397 |
| c3 | | Dominique Cansell, Dominique Méry, Christophe Tabacznyj: Tutorial 1: Abstraction and Refinement of Concurrent Programs and Formal Specification. IPDPS Workshops 2000: 1037-1038 |
| c2 | | Dominique Cansell, Dominique Méry: Playing with Abstraction and Refinement for Managing Features Interactions. ZB 2000: 148-167 |
| 1999 | ||
| c1 | | Dominique Cansell, Dominique Méry: Abstract Animator for Temporal Specifications: Application to TLA. SAS 1999: 284-299 |
Colors in the list of coauthors
Last update Mon May 20 19:29:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page