Dominique Cansell

	2009
29		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
28		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
27		Dominique Cansell, Dominique Méry, Cyril Proch: System-on-chip design by proof-based refinement. STTT 11(3): 217-238 (2009)
	2007
26		Dominique Cansell, Dominique Méry, Joris Rehm: Time Constraint Patterns for Event B Development. B 2007: 140-154
25		Bill Stoddart, Dominique Cansell, Frank Zeyda: Modelling and Proof Analysis of Interrupt Driven Scheduling. B 2007: 155-170
24		Nazim Benaïssa, Dominique Cansell, Dominique Méry: Integration of Security Policy into System Modeling. B 2007: 232-247
23		Dominique Cansell, Dominique Méry: Proved-Patterns-Based Development for Structured Programs. CSR 2007: 104-114
22		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
21		Dominique Cansell, J. Paul Gibson, Dominique Méry: Formal verification of tamper-evident storage for e-voting. SEFM 2007: 329-338
20		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)
19		Dominique Cansell, Dominique Méry: Incremental Parametric Development of Greedy Algorithms. Electr. Notes Theor. Comput. Sci. 185: 47-62 (2007)
	2006
18		Dominique Cansell: B Method. The Seventeen Provers of the World 2006: 142-150
17		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)
	2005
16		Jean-Raymond Abrial, Dominique Cansell, Dominique Méry: Refinement and Reachability in EventB. ZB 2005: 222-241
15		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)
	2004
14		Dominique Cansell, J.-F. Culat, Dominique Méry, Cyril Proch: Derivation of SystemC code from abstract system models. FDL 2004: 612-624
	2003
13		Dominique Cansell, Dominique Méry, Cyril Proch: Proof-based design of a microelectronic architecture for MPEG-2 bit-rate measurement . FDL 2003: 435-447
12		Jean-Raymond Abrial, Dominique Cansell: Click'n Prove: Interactive Proofs within Set Theory. TPHOLs 2003: 1-24
11		Jean-Raymond Abrial, Dominique Cansell, Dominique Méry: Formal Derivation of Spanning Trees Algorithms. ZB 2003: 457-476
10		Dominique Cansell, Dominique Méry: Foundations of the B Method. Computers and Artificial Intelligence 22(3-4): 221-256 (2003)
9		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)
	2002
8		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
7		Jean-Raymond Abrial, Dominique Cansell, Guy Laffitte: "Higher-Order" Mathematics in B. ZB 2002: 370-393
	2001
6		Dominique Cansell, Dominique Méry, Stephan Merz: Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams. GI Jahrestagung (1) 2001: 628-634
5		Dominique Cansell, Dominique Méry, Stephan Merz: Diagram Refinements for the Design of Reactive Systems. J. UCS 7(2): 159-174 (2001)
	2000
4		Dominique Cansell, Dominique Méry, Stephan Merz: Predicate Diagrams for the Verification of Reactive Systems. IFM 2000: 380-397
3		Dominique Cansell, Dominique Méry, Christophe Tabacznyj: Tutorial 1: Abstraction and Refinement of Concurrent Programs and Formal Specification. IPDPS Workshops 2000: 1037-1038
2		Dominique Cansell, Dominique Méry: Playing with Abstraction and Refinement for Managing Features Interactions. ZB 2000: 148-167
	1999
1		Dominique Cansell, Dominique Méry: Abstract Animator for Temporal Specifications: Application to TLA. SAS 1999: 284-299

Coauthor Index

1	Jean-Raymond Abrial	[7] [9] [11] [12] [15] [16]
2	Nazim Benaïssa	[24]
3	Michael J. Butler	[28]
4	J.-F. Culat	[14]
5	J. Paul Gibson	[20] [21]
6	Ganesh Gopalakrishnan	[8]
7	Michael D. Jones	[8]
8	Guy Laffitte	[7]
9	Michael Leuschel	[28]
10	Dominique Méry	[1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [13] [14] [16] [17] [19] [20] [21] [23] [24] [26] [27] [29]
11	Stephan Merz	[4] [5] [6]
12	Cyril Proch	[13] [14] [27]
13	Joris Rehm	[22] [26]
14	Bill Stoddart	[25]
15	Christophe Tabacznyj	[3]
16	Airy Weinzoepflen	[8]
17	Frank Zeyda	[25]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page