Dominique Bonnet < Dominique Cansell < Dominique Chouanière

Facettes : Author.f

List of bibliographic references

Number of relevant bibliographic references: 57.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
000024 (2005-09-24)	Dominique Cansell ; Dominique Méry ; Cyril Proch	Modelling SystemC scheduler by refinement
000042 (2002-01)	Jean-Raymond Abrial ; Dominique Cansell ; Guy Laffitte	"Higher-Order" Mathematics in B
000297 (2003)	Jean-Raymond Abrial ; Dominique Cansell ; Dominique Méry	A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol
000A39 (1999)	Dominique Cansell ; Dominique Méry	Abstract Animator for Temporal Specifications
000A44 (1999)	Dominique Cansell ; Dominique Méry	Abstract animator for temporal specifications Application to TLA
000A48 (2000)	Dominique Cansell ; Dominique Méry ; Christophe Tabacznyj	Abstraction and Refinement of Concurrent Programs and Formal Specification
000A49 (2000)	Dominique Cansell ; Dominique Méry	Abstraction and refinement of features
001185 (2006)	Dominique Cansell	B Method
001486 (2003)	Jean-Raymond Abrial ; Dominique Cansell	Click'n'Prove: Interactive Proofs Within Set Theory
001B60 (2004)	Dominique Cansell ; Jean-François Culat ; Dominique Méry ; Cyril Proch	Derivation of SystemC code from abstract system models
001B98 (2003)	Dominique Cansell ; Dominique Méry	Designing event-driven systems by combining coordination and refinement
001B99 (2007)	Dominique Cansell ; Dominique Méry	Designing old and new distributed algorithms by replaying an incremental proof-based development
001C45 (2000)	Dominique Cansell ; Dominique Méry ; Stephan Merz	Diagrams Refinement for the Design of Reactive Systems
002357 (2001)	Dominique Cansell ; Dominique Méry ; Stephan Merz	Formal Analysis of a Self-Stabilizing Algorithm - Using Predicate Diagrams
002365 (2005)	Jean-Raymond Abrial ; Dominique Cansell	Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity)
002394 (2006)	Dominique Cansell ; Dominique Méry	Formal and Incremental Construction of Distributed Algorithms: On the Distributed Reference Counting Algorithm
002397 (2003)	Jean-Raymond Abrial ; Dominique Cansell ; Dominique Méry	Formal derivation of spanning trees algorithms
002401 (2004)	Yann Zimmermann ; Stefan Hallerstede ; Dominique Cansell	Formal modelling of electronic circuits using event-B, Case Study: SAE J1708 Serial Communication Link
002408 (2007-09)	Dominique Cansell ; Paul Gibson ; Dominique Méry	Formal verification of tamper-evident storage for e-voting
002426 (2003)	Dominique Cansell ; Dominique Méry	Foundations of the B method
002A63 (2006-09-18)	Dominique Cansell ; Dominique Méry	Incremental Parametric Development of Greedy Algorithms

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Corpus/Author.i -k "Dominique Cansell" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Corpus/Author.i  \
                -Sk "Dominique Cansell" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    indexItem
   |index=    Author.i
   |clé=    Dominique Cansell
}}

---

This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022