default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique Cansell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1992
[b1]Dominique Cansell:
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). University of Metz, France, 1992
Journal Articles
- 2009
- [j6]Dominique Cansell, Dominique Méry, Cyril Proch:
System-on-chip design by proof-based refinement. Int. J. Softw. Tools Technol. Transf. 11(3): 217-238 (2009) - 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) - 2005
- [j4]Jean-Raymond Abrial, Dominique Cansell:
Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity). J. Univers. Comput. Sci. 11(5): 744-770 (2005) - 2003
- [j3]Dominique Cansell, Dominique Méry:
Foundations of the B Method. Comput. Artif. Intell. 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 Aspects Comput. 14(3): 215-227 (2003) - 2001
- [j1]Dominique Cansell, Dominique Méry, Stephan Merz:
Diagram Refinements for the Design of Reactive Systems. J. Univers. Comput. Sci. 7(2): 159-174 (2001)
Conference and Workshop Papers
- 2009
- [c23]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 - [c22]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
- [c21]Dominique Cansell, Dominique Méry, Joris Rehm:
Time Constraint Patterns for Event B Development. B 2007: 140-154 - [c20]Bill Stoddart, Dominique Cansell, Frank Zeyda:
Modelling and Proof Analysis of Interrupt Driven Scheduling. B 2007: 155-170 - [c19]Nazim Benaïssa, Dominique Cansell, Dominique Méry:
Integration of Security Policy into System Modeling. B 2007: 232-247 - [c18]Dominique Cansell, Dominique Méry:
Proved-Patterns-Based Development for Structured Programs. CSR 2007: 104-114 - [c17]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 - [c16]Dominique Cansell, J. Paul Gibson, Dominique Méry:
Formal verification of tamper-evident storage for e-voting. SEFM 2007: 329-338 - 2006
- [c15]Dominique Cansell, J. Paul Gibson, Dominique Méry:
Refinement: A Constructive Approach to Formal Software Design for a Secure e-voting Interface. FMIS@ICFEM 2006: 39-55 - [c14]Dominique Cansell, Dominique Méry:
Incremental Parametric Development of Greedy Algorithms. AVoCS 2006: 47-62 - 2005
- [c13]Jean-Raymond Abrial, Dominique Cansell, Dominique Méry:
Refinement and Reachability in EventB. ZB 2005: 222-241 - 2004
- [c12]Dominique Cansell, J.-F. Culat, Dominique Méry, Cyril Proch:
Derivation of SystemC code from abstract system models. FDL 2004: 612-624 - 2003
- [c11]Dominique Cansell, Dominique Méry, Cyril Proch:
Proof-based design of a microelectronic architecture for MPEG-2 bit-rate measurement . FDL 2003: 435-447 - [c10]Jean-Raymond Abrial, Dominique Cansell:
Click'n Prove: Interactive Proofs within Set Theory. TPHOLs 2003: 1-24 - [c9]Jean-Raymond Abrial, Dominique Cansell, Dominique Méry:
Formal Derivation of Spanning Trees Algorithms. ZB 2003: 457-476 - 2002
- [c8]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 - [c7]Jean-Raymond Abrial, Dominique Cansell, Guy Laffitte:
"Higher-Order" Mathematics in B. ZB 2002: 370-393 - 2001
- [c6]Dominique Cansell, Dominique Méry, Stephan Merz:
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams. GI Jahrestagung (1) 2001: 628-634 - 2000
- [c5]Dominique Cansell, Dominique Méry:
Abstraction and refinement of features. FIREworks 2000: 65-84 - [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
Parts in Books or Collections
- 2006
- [p1]Dominique Cansell:
B Method. The Seventeen Provers of the World 2006: 142-150
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
