Y. Deng, S. Grumbach, and J. Monin, A Framework for Verifying Data-Centric Protocols, pp.106-120, 2011.
DOI : 10.1007/3-540-48213-X_26
URL : https://hal.archives-ouvertes.fr/hal-00647802

C. Kirkwood and M. Thomas, Experiences with specification and verification in LOTOS: a report on two case studies, Proceedings of 1995 IEEE Workshop on Industrial-Strength Formal Specification Techniques, p.159, 1995.
DOI : 10.1109/WIFT.1995.515487

F. Regensburger and A. Barnard, Formal verification of SDL systems at the siemens mobile phone department, TACAS'98, pp.439-455, 1998.
DOI : 10.1007/BFb0054188

J. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodriguez et al., A toolbox for the verification of LOTOS programs, ICSE'92, pp.246-259, 1992.

R. G. Gallager, P. A. Humblet, and P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-77, 1983.
DOI : 10.1145/357195.357200

J. L. Welch, L. Lamport, and N. Lynch, A lattice-structured proof of a minimum spanning, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.28-43, 1988.
DOI : 10.1145/62546.62552

W. H. Hesselink, The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract, Formal Aspects of Computing, vol.11, issue.1, pp.45-55, 1999.
DOI : 10.1007/s001650050035

Y. Moses and B. Shimony, A New Proof of the GHS Minimum Spanning Tree Algorithm, DISC, ser. Lecture Notes in Computer Science, pp.120-135, 2006.
DOI : 10.1007/11864219_9

J. S. Moore, An ACL2 proof of write invalidate cache coherence, CAV, ser, pp.29-38, 1998.
DOI : 10.1007/BFb0028728

F. Verbeek and J. Schmaltz, Formal specification of networks-onchips: Deadlock and evacuation, International Conference on Design Automation and Test Europe, 2010.

B. T. Loo, J. M. Hellerstein, I. Stoica, and R. Ramakrishnan, Declarative routing: extensible routing with declarative queries, ACM SIGCOMM'05, 2005.

B. T. Loo, T. Condie, M. N. Garofalakis, D. E. Gay, J. M. Hellerstein et al., Declarative networking, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, 2006.
DOI : 10.1145/1142473.1142485

C. Liu, Y. Mao, M. Oprea, P. Basu, and B. T. Loo, A declarative perspective on adaptive manet routing, Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow, PRESTO '08, pp.63-68, 2008.
DOI : 10.1145/1397718.1397733

S. Grumbach and F. Wang, Netlog, a Rule-Based Language for Distributed Programming, PADL'10, ser. LNCS, pp.88-103, 2010.
DOI : 10.1007/978-3-642-11503-5_9

V. Jarnìk, O jistèm problému minimàlnìm [about a certain minimal problem], Czech), pp.57-63, 1930.

R. C. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

M. Chen, Y. Deng, and J. Monin, Coq Script for Netlog Protocols