A proof environment for the development of group communication systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1421, Issue , 1998, Pages 317-332

  Kreitz, Christoph ^a   Hayden, Mark ^a   Hickey, Jason ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

AUTOMATED DEDUCTION; CONCRETE APPLICATIONS; CRITICAL PROPERTIES; GROUP COMMUNICATION SYSTEMS; GROUP COMMUNICATIONS; PROGRAMMING ENVIRONMENT; PROOF DEVELOPMENT; REAL-WORLD SYSTEM;

THEOREM PROVING;

EID: 84957045320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054269     Document Type: Conference Paper

References (21)

1. M. Archer & C. Heitmeyer. Mechanical verification of timed automata: A case study. Technical report, Naval Research Laboratory, Washington, DC, 1997.
2. W. Bibel, D. Korn, C. Kreitz, F. Kurucz, J. Otten, S. Schmitt, G. Stolpmann. A multi-level approach to program synthesis. In Seventh International Workshop on Logic Program Synthesis and Transformation, LNAI, Springer Verlag, 1998.
3. K. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, 1997.
4. K. Birman & R. van Renesse. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1994.
5. T. Chandra, V. Hadzilacos, S. Toueg, B. Charron-Bost. On the impossibility of group membership. 15th ACM Symposium on Principles of Distributed Computing, pp. 322-330, 1996.
6. R. Constable, et. al., Implementing Mathematics with the NuPRL proof development system. Prentice Hall, 1986.
7. D. de Rauglaudre. Camlp4 version 1. 06. Institut National de Recherche en Infor-matique et en Automatique, 1997.
8. A. Fekete, N. Lynch, A. Shvartsman. Specifying and using a partitionable group communication service. In 16th ACM Symposium on Principles of Distributed Computing, 1997.
9. M. Gordon, R. Milner, C. Wadsworth. Edinburgh LCF: A mechanized Logic of Computation. LNCS 78, Springer Verlag, 1979.
10. O. Hafizoğullari & C. Kreitz. Dead Code Elimination Through Type Inference. Technical Report TR 98-1698, Cornell University, 1998.
11. M. Hayden. Ensemble Reference Manual. Cornell University, 1996.
12. The Ensemble distributed communication system. System distribution and related information, http: //www. cs. Cornell. βdu/Info/Proj ects/Ensemble
13. C. Kreitz. Formal mathematics for verifiably correct program synthesis. Journal of the IGPL, 4(l): 75-94, 1996.
14. C. Kreitz. Formal reasoning about communication systems I: Embedding ML into type theory. Technical Report TR97-1637, Cornell University, 1997.
15. C. Kreitz, J. Otten, S. Schmitt. Guiding Program Development Systems by a Connection Based Proof Strategy. In 5th International Workshop on Logic Program Synthesis and Transformation, LNCS 1048, pp. 137-151. Springer Verlag, 1996.
16. X. Leroy. The Objective Caml system release 1. 06. Institut National de Recherche en Informatique et en Automatique, 1997.
17. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
18. P. Lincoln & J. Rushby. A formally verified algorithm for interactive consistency under a hybrid fault model. In 23rd Fault-Tolerant Computing Symposium, pp. 402-411, 1993.
19. J. Rushby. Formal methods for dependable real-time systems. In International Symposium on Real-Time Embedded Processing for Space Applications, pp. 355-366, 1992.
20. J. Rushby. Systematic formal verification for fault-tolerant time-triggered algorithms. In Dependable Computing for Critical Applications: 6, pp. 191-210. IEEE Computer Society, 1997.
21. R. van Renesse, K. Birman, & S. Maffeis. Horus: A flexible group communication system. Communications of the ACM, 39(4): 76-83, 1996.