Dominique Cansell - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2009

System-on-chip design by proof-based refinementDominique Cansell, Dominique Méry, Cyril Proch. STTT, 11(3):217-238, 2009. [doi]

Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based DevelopmentDominique Cansell, Dominique Méry. BIRTHDAY 2009: 17-32 [doi]

Validating and Animating Higher-Order Recursive Functions in BMichael Leuschel, Dominique Cansell, Michael J. Butler. BIRTHDAY 2009: 78-92 [doi]

2007

Integration of Security Policy into System ModelingNazim Benaïssa, Dominique Cansell, Dominique Méry. b 2006: 232-247 [doi]

Formal verification of tamper-evident storage for e-votingDominique Cansell, J. Paul Gibson, Dominique Méry. SEFM 2007: 329-338 [doi]

Refinement: A Constructive Approach to Formal Software Design for a Secure e-voting InterfaceDominique Cansell, J. Paul Gibson, Dominique Méry. ENTCS, 183:39-55, 2007. [doi]

Incremental Parametric Development of Greedy AlgorithmsDominique Cansell, Dominique Méry. ENTCS, 185:47-62, 2007. [doi]

Time Constraint Patterns for Event B DevelopmentDominique Cansell, Dominique Méry, Joris Rehm. b 2006: 140-154 [doi]

Proved-Patterns-Based Development for Structured ProgramsDominique Cansell, Dominique Méry. csr 2007: 104-114 [doi]

Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B MethodJoris Rehm, Dominique Cansell. ISoLA 2007: 179-190

Modelling and Proof Analysis of Interrupt Driven SchedulingBill Stoddart, Dominique Cansell, Frank Zeyda. b 2006: 155-170 [doi]

2006

Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithmDominique Cansell, Dominique Méry. TCS, 364(3):318-337, 2006. [doi]

B MethodDominique Cansell. tphol 2006: 142-150 [doi]

2005

Refinement and Reachability in Event::B::Jean-Raymond Abrial, Dominique Cansell, Dominique Méry. zum 2005: 222-241 [doi]

Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity)Jean-Raymond Abrial, Dominique Cansell. jucs, 11(5):744-770, 2005. [doi]

2004

Derivation of SystemC code from abstract system modelsDominique Cansell, J.-F. Culat, Dominique Méry, Cyril Proch. fdl 2004: 612-624 [doi]

2003

2002

Higher-Order Mathematics in BJean-Raymond Abrial, Dominique Cansell, Guy Laffitte. zum 2002: 370-393 [doi]

Incremental Proof of the Producer/Consumer Property for the PCI ProtocolDominique Cansell, Ganesh Gopalakrishnan, Michael D. Jones, Dominique Méry, Airy Weinzoepflen. zum 2002: 22-41 [doi]

2001

Formal Analysis of a Self-Stabilizing Algorithm Using Predicate DiagramsDominique Cansell, Dominique Méry, Stephan Merz. gi 2001: 628-634

Diagram Refinements for the Design of Reactive SystemsDominique Cansell, Dominique Méry, Stephan Merz. jucs, 7(2):159-174, 2001. [doi]

2000

1999

Abstract Animator for Temporal Specifications: Application to TLADominique Cansell, Dominique Méry. SAS 1999: 284-299 [doi]

1992

L'informatique, une displine dans les DEUG scientifiques à partir d'une expérience pédagogique à l'Université de Metz. (Computer sciencers as a subject for science students a teaching experiment at Metz University)Dominique Cansell. PhD thesis, University of Metz, France, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL