메뉴 건너뛰기




Volumn 806 LNCS, Issue , 1994, Pages 127-165

Proof-checking a data link protocol

Author keywords

Communication protocols; I O automata; Proof checking; Protocol verification; Type theory

Indexed keywords

AUTOMATA THEORY; NETWORK PROTOCOLS;

EID: 85027532068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58085-9_75     Document Type: Conference Paper
Times cited : (77)

References (27)
  • 1
    • 0000627069 scopus 로고
    • Appraising fairness in languages for distributed programming
    • K. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226-241, 1988.
    • (1988) Distributed Computing , vol.2 , pp. 226-241
    • Apt, K.1    Francez, N.2    Katz, S.3
  • 2
    • 0001439401 scopus 로고
    • Lambda calculi with types
    • S. Abramsky, D. Gabbay, and T. Maibaum, editors, Oxford University Press
    • H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, pages 117-309. Oxford University Press, 1992.
    • (1992) Handbook of Logic in Computer Science , pp. 117-309
    • Barendregt, H.1
  • 3
    • 0347639035 scopus 로고
    • A formal verification of the alternating bit protocol in the calculus of constructions
    • Dept. of Philosophy, Utrecht University, Mar.
    • M. Bezem and J. Groote. A formal verification of the alternating bit protocol in the calculus of constructions. Logic Group Preprint Series 88, Dept. of Philosophy, Utrecht University, Mar. 1993.
    • (1993) Logic Group Preprint Series 88
    • Bezem, M.1    Groote, J.2
  • 7
    • 0027342054 scopus 로고
    • The concurrency workbench: A semantics based tool for the verification of concurrent systems
    • R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Trans. Prog. Lang. Syst., I(15):36-72, 1993.
    • (1993) ACM Trans. Prog. Lang. Syst. , vol.1 , Issue.15 , pp. 36-72
    • Cleaveland, R.1    Parrow, J.2    Steffen, B.3
  • 11
    • 0007694967 scopus 로고
    • HOL: A proof generating system for higher-order logic
    • G. Birtwistle and P. Subrahmanyam, editors, Kluwer Academic Publishers
    • M. Gordon. HOL: a proof generating system for higher-order logic. In G. Birtwistle and P. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis. Kluwer Academic Publishers, 1988.
    • (1988) VLSI Specification, Verification and Synthesis
    • Gordon, M.1
  • 12
    • 0347639034 scopus 로고
    • A bounded retransmission protocol for large data packets
    • Dept. of Philosophy, Utrecht University, Oct
    • J. Groote and J. van de Pol. A bounded retransmission protocol for large data packets. Logic Group Preprint Series 100, Dept. of Philosophy, Utrecht University, Oct. 1993.
    • (1993) Logic Group Preprint Series 100
    • Groote, J.1    van de Pol, J.2
  • 15
    • 0003942431 scopus 로고
    • Compositional Verification of Distributed Systems
    • Uppsala University, DoGS 87/09
    • B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1987. DoGS 87/09.
    • (1987) PhD thesis, Department of Computer Systems
    • Jonsson, B.1
  • 16
    • 0010018686 scopus 로고
    • Research Report 94, Digital Equipment Corporation, Systems Research Center, Feb.
    • L. Lamport. How to write a proof. Research Report 94, Digital Equipment Corporation, Systems Research Center, Feb. 1993.
    • (1993) How to write a proof
    • Lamport, L.1
  • 17
    • 79951695125 scopus 로고
    • Verification of a multiprocessor cache protocol using simulation relations and higher-order logic (summary)
    • E. Clarke and R. Kurshan, editors, New Brunswick, N J, USA June 1990, volume 531 of Lecture Notes in Computer Science, Springer-Verlag
    • P. Loewenstein and D. Dill. Verification of a multiprocessor cache protocol using simulation relations and higher-order logic (summary). In E. Clarke and R. Kurshan, editors, Proceedings of the 2nd International Conference on Computer-Aided Verification, New Brunswick, N J, USA June 1990, volume 531 of Lecture Notes in Computer Science, pages 302-311. Springer-Verlag, 1991.
    • (1991) Proceedings of the 2nd International Conference on Computer-Aided Verification , pp. 302-311
    • Loewenstein, P.1    Dill, D.2
  • 18
    • 54749129003 scopus 로고
    • Technical Report LFCSTN-27, University of Edinburgh, Edinburgh, Scotland, Oct.
    • Z. Luo, R. Pollack, and P. Taylor. How to use LEGO. Technical Report LFCSTN-27, University of Edinburgh, Edinburgh, Scotland, Oct. 1989.
    • (1989) How to use LEGO
    • Luo, Z.1    Pollack, R.2    Taylor, P.3
  • 19
    • 85031892754 scopus 로고
    • Hierarchical correctness proofs for distributed algorithms
    • Aug., A full version is available as MIT Technical Report MIT/LCS/TR-387
    • N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing, pages 137-151, Aug. 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.
    • (1987) Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing , pp. 137-151
    • Lynch, N.1    Tuttle, M.2
  • 20
    • 0001383866 scopus 로고
    • An introduction to input/output automata
    • Sept.
    • N. Lynch and M. Turtle. An introduction to input/output automata. CW1 Quarterly, 2(3):219-246, Sept. 1989.
    • (1989) CW1 Quarterly , vol.2 , Issue.3 , pp. 219-246
    • Lynch, N.1    Turtle, M.2
  • 23
    • 33747403158 scopus 로고
    • Formal verification of data type refinement - theory and practice
    • J. de Bakker, W. d. Roever, and G. Rozenberg, editors, Correctness, Mook, The Netherlands, May/June, volume 430 of Lecture Notes in Computer Science, Springer-Verlag, 1990
    • T. Nipkow. Formal verification of data type refinement - theory and practice. In J. de Bakker, W. d. Roever, and G. Rozenberg, editors, Proceedings REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands, May/June 1989, volume 430 of Lecture Notes in Computer Science, pages 561-591. Springer-Verlag, 1990.
    • (1989) Proceedings REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism , pp. 561-591
    • Nipkow, T.1
  • 24
    • 84947743461 scopus 로고
    • Inductive definitions in the system Coq. Rules and properties
    • M. Bezem and J. Groote, editors, The Netherlands, volume 664 of Lecture Notes in Computer Science, Springer-Verlag
    • C. Paulin-Mohring. Inductive definitions in the system Coq. Rules and properties. In M. Bezem and J. Groote, editors, Proceedings o] the 1st International Conference on Typed Lambda Calculi and Applications, TCLA’93, Utrecht, The Netherlands, volume 664 of Lecture Notes in Computer Science, pages 328-345. Springer-Verlag, 1993.
    • (1993) Proceedings o] the 1st International Conference on Typed Lambda Calculi and Applications, TCLA’93, Utrecht , pp. 328-345
    • Paulin-Mohring, C.1
  • 27
    • 0004141908 scopus 로고
    • Prentice-Hall International, Englewood Cliffs
    • A. Tanenbaum. Computer networks. Prentice-Hall International, Englewood Cliffs, 1981.
    • (1981) Computer networks
    • Tanenbaum, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.