Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm-Reference-Cited by-同舟云学术

Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm

Author:

Cansell Dominique,Méry Dominique

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. B#: toward a synthesis between z and b;Abrial,2003

2. The B Book–Assigning Programs to Meanings;Abrial,1996

3. J.-R. Abrial, D. Cansell, Click‘n’Prove, 2002. 〈www.loria.fr/cansell/cnp.html〉.

4. Click‘n’prove: interactive proofs within set theory;Abrial,2003

5. Formal construction of a non-blocking concurrent queue algorithm (a case study in atomicity);Abrial;J. Universal Comput. Sci.,2005

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. An Event-B Development Process for the Distributed BIP Framework;Implicit and Explicit Semantics Integration in Proof-Based Developments of Discrete Systems;2020-07-28

4. Verification by Construction of Distributed Algorithms;Theoretical Aspects of Computing – ICTAC 2019;2019

5. Formal modeling and analysis of ad hoc Zone Routing Protocol in Event-B;International Journal on Software Tools for Technology Transfer;2017-07-07