Dominique Cansell

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Incremental parametric development of greedy algorithms Electronic Notes in Theoretical Computer Science	2015-03-18	Paper
Click'n prove: interactive proofs within set theory Lecture Notes in Computer Science	2010-05-07	Paper
Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm Theoretical Computer Science	2007-01-09	Paper
scientific article; zbMATH DE number 2172802 (Why is no real title available?)	2006-06-02	Paper
scientific article; zbMATH DE number 2227867 (Why is no real title available?)	2005-11-10	Paper
Abstraction and refinements of features	2004-09-14	Paper
Incremental proof of the producer/consumer property for the PCI protocol ZB 2002:Formal Specification and Development in Z and B	2004-08-03	Paper
``Higher-order'' mathematics in B Lecture Notes in Computer Science	2004-08-03	Paper
Predicate diagrams for the verification of reactive systems Lecture Notes in Computer Science	2004-07-30	Paper
Formal derivation of spanning trees algorithms Lecture Notes in Computer Science	2003-12-04	Paper
A mechanically proved and incremental development of IEEE 1394 tree identify protocol Formal Aspects of Computing	2003-08-27	Paper
Diagram refinements for the design of reactive systems Journal of Universal Computer Science	2001-08-13	Paper
Abstract animator for temporal specifications: Application to TLA Lecture Notes in Computer Science	2000-08-10	Paper

Research outcomes over time

This page was built for person: Dominique Cansell