More Web Proxy on the site http://driver.im/

research-article

Automated Protocol Implementation with RTAG

Author:

D. P. AndersonAuthors Info & Claims

IEEE Transactions on Software Engineering, Volume 14, Issue 3

Pages 291 - 300

https://doi.org/10.1109/32.4650

Published: 01 March 1988 Publication History

Abstract

The RTAG (real-time asynchronous grammars) programming language is discussed. The language is based on an attribute grammar notation for specifying protocols. Its main design goals are: (1) to support concise and easily understood expression of complex real-world protocols; and (2) to serve as the basis of a portable software system for automated protocol implementation. The algorithms used in generating implementations from given specifications are sketched, and a Unix-based automated implementation system for RTAG is described.

References

[1]

{1} D. P. Anderson, "A grammar-based methodology for protocol specification and implementation," Ph.D. dissertation, Univ. Wisconsin-Madison, WI, Aug. 1985.]]

Digital Library

[2]

{2} T. P. Blumer and R. L. Tenney, "A formal specification technique and Implementation method for protocols," Comput. Networks, vol. 6, no. 3, pp. 201-217, July 1982.]]

[3]

{3} J. P. Briand, M. C. Fehri, L. Logrippo, and A. Obaid, "Structure of a LOTOS interpreter," SIGCOMM'86 Symp., Stowe, VT, Aug. 1986.]]

Digital Library

[4]

{4} E. Brinksma, "A tutorial on LOTOS," in Proc. 5th IFIP Symp. Protocol Spec. Test. Verif., June 1985.]]

Digital Library

[5]

{5} D. Clark, "Modularity and efficiency in protocol implementation," RFC 817, SRI Network Information Center, 1983.]]

Digital Library

[6]

{6} A. T. Demers, T. Reps, and T. Teitelbaum, "Incremental evaluation for attribute grammars with applications to syntax-directed editors," in Proc. Eighth Annu. ACM Symp. Principles Program, Languages, pp. 105-116, 1981.]]

Digital Library

[7]

{7} G. Holtzmann, "The PANDORA system: An interactive system for the design of data communication protocols," Delft Univ. Technol., Rep. 39, Aug. 1982.]]

[8]

{8} S. C. Johnson, "Yacc: Yet another compiler-compiler," Unix Programmer's Manual, vol. 2B, 1979.]]

[9]

{9} G. F. Johnson and C. N. Fischer, "A meta-language and system for nonlocal incremental attribute evaluation in language-based editors," in Proc. 12th ACM Symp. Principles Program, Languages, pp. 141- 151, Jan. 1985.]]

Digital Library

[10]

{10} B. W. Kernighan and D. M. Ritchie, The C Programming Language. Englewood Cliffs, NJ: Prentice-Hall, 1978.]]

Digital Library

[11]

{11} D. E. Knuth, "Semantics of context free languages," Math Syst. Theory J. 2, vol. 2, pp. 127-145, 1968.]]

[12]

{12} S. J. Leffler, W. N. Joy and R. S. Fabry, 4.2BSD networking implementation notes, UNIX programmer's manual, vol. 2C," Computer Systems Research Group, Dep. Elec. Eng. Comput. Sci., Univ. California, Berkeley, Aug. 1983.]]

Digital Library

[13]

{13} M. E. Lesk and E. Schmidt, "Lex--a lexical analyzer generator," Unix Programmer's Manual, vol. 2B, 1979.]]

[14]

{14} L. Logrippo, D. Simon, and H. Ural, "Executable description of the OSI transport service in Prolog," in Proc. 4th IFIP Workshop Protocol Spec. Test. Verif., pp. 279-294, June 1984.]]

Digital Library

[15]

{15} S. C. Nash, "Automated implementation of SNA communication protocols, "in Proc. IEEE Int. Conf. Commun., pp. 1316-1322, June 1983.]]

[16]

{16} N. Nounou and Y. Yemini, "Development tools for communication protocols: An overview," in Proc. IEEE Global Telecommun. Conf., Nov. 1984.]]

[17]

{17} T. F. Piatkowski, "Protocol engineering," in Proc. IEEE Int. Conf. Commun., Boston, MA, June 1983.]]

[18]

{18} D. P. Sidhu, "Protocol verification via executable logic specifications," IFIP Workshop Protocol Spec. Test. Verif., 1983.]]

[19]

{19} C. A. Sunshine, "Formal techniques for protocol specification and verification," Computer, vol. 12, pp. 20-27, 1979.]]

Digital Library

[20]

{20} C. A. Vissers, R. L. Tenney, and G. Bochmann, "Formal description techniques," Proc. IEEE 71, pp. 1356-1364, Dec. 1983.]]

[21]

{21} Y. Yemini and N. Nounou, "CUPID: a protocol development environment," in Proc. 3rd IFIP Workshop Protocol Spec. Test. Verif., May 1983.]]

[22]

{22} "Specification of a transport protocol for computer communications, volume 3: Class 4 protocol," Nat. Bureau Stand., Rep. ICST/HLNP- 83-3, 1983.]]

[23]

{23} 4.2BSD UNIX Programmer's Manual, Comput. Syst. Res. Group, Dep. Elec. Eng. Comput. Sci., Univ. California, Berkeley, Aug. 1983.]]

[24]

{24} "Basic reference model for Open Systems Interconnection," International Standards Organization 7498, 1983.]]

Cited By

Yen JGovindan RRaghavan BFeamster NLutu A(2021)Tools for disambiguating RFCsProceedings of the 2021 Applied Networking Research Workshop10.1145/3472305.3472314(85-91)Online publication date: 24-Jul-2021
https://dl.acm.org/doi/10.1145/3472305.3472314
Yen JLévai TYe QRen XGovindan RRaghavan BKuipers FCaesar M(2021)Semi-automated protocol disambiguation and code generationProceedings of the 2021 ACM SIGCOMM 2021 Conference10.1145/3452296.3472910(272-286)Online publication date: 9-Aug-2021
https://dl.acm.org/doi/10.1145/3452296.3472910
Leonini LRivière ÉFelber PRexford JSirer E(2009)SPLAYProceedings of the 6th USENIX symposium on Networked systems design and implementation10.5555/1558977.1558990(185-198)Online publication date: 22-Apr-2009
https://dl.acm.org/doi/10.5555/1558977.1558990
Show More Cited By

Recommendations

Efficient Automated Protocol Implementation Using RTAG
Improving the efficiency of automated protocol implementations using a configurable FDT compiler

The integration of efficient implementation techniques, which have been proven in manual coding, into FDT compilers is difficult because of the semantic constraints of the FDTs and the lack of language means to flexibly adapt to a given implementation ...
Efficient implementation of the orlandi protocol
ACNS'10: Proceedings of the 8th international conference on Applied cryptography and network security

We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is secure against up to n-1 static, active adversaries. An efficient implementation ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 14, Issue 3

March 1988

128 pages

ISSN:0098-5589

Issue’s Table of Contents

Copyright © Copyright © 1988 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 March 1988

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yen JGovindan RRaghavan BFeamster NLutu A(2021)Tools for disambiguating RFCsProceedings of the 2021 Applied Networking Research Workshop10.1145/3472305.3472314(85-91)Online publication date: 24-Jul-2021
https://dl.acm.org/doi/10.1145/3472305.3472314
Yen JLévai TYe QRen XGovindan RRaghavan BKuipers FCaesar M(2021)Semi-automated protocol disambiguation and code generationProceedings of the 2021 ACM SIGCOMM 2021 Conference10.1145/3452296.3472910(272-286)Online publication date: 9-Aug-2021
https://dl.acm.org/doi/10.1145/3452296.3472910
Leonini LRivière ÉFelber PRexford JSirer E(2009)SPLAYProceedings of the 6th USENIX symposium on Networked systems design and implementation10.5555/1558977.1558990(185-198)Online publication date: 22-Apr-2009
https://dl.acm.org/doi/10.5555/1558977.1558990
Killian CAnderson JBraud RJhala RVahdat A(2007)MaceACM SIGPLAN Notices10.1145/1273442.125075542:6(179-188)Online publication date: 10-Jun-2007
https://dl.acm.org/doi/10.1145/1273442.1250755
Killian CAnderson JBraud RJhala RVahdat AFerrante JMcKinley K(2007)MaceProceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1250734.1250755(179-188)Online publication date: 15-Jun-2007
https://dl.acm.org/doi/10.1145/1250734.1250755
Loo BCondie THellerstein JManiatis PRoscoe TStoica IHerbert ABirman K(2005)Implementing declarative overlaysProceedings of the twentieth ACM symposium on Operating systems principles10.1145/1095810.1095818(75-90)Online publication date: 23-Oct-2005
https://dl.acm.org/doi/10.1145/1095810.1095818
Loo BCondie THellerstein JManiatis PRoscoe TStoica I(2005)Implementing declarative overlaysACM SIGOPS Operating Systems Review10.1145/1095809.109581839:5(75-90)Online publication date: 20-Oct-2005
https://dl.acm.org/doi/10.1145/1095809.1095818
Kohler EKaashoek MMontgomery D(1999)A readable TCP in the Prolac protocol languageACM SIGCOMM Computer Communication Review10.1145/316194.31620029:4(3-13)Online publication date: 30-Aug-1999
https://dl.acm.org/doi/10.1145/316194.316200
Kohler EKaashoek MMontgomery DChapin LSterbenz JParulkar GTurner J(1999)A readable TCP in the Prolac protocol languageProceedings of the conference on Applications, technologies, architectures, and protocols for computer communication10.1145/316188.316200(3-13)Online publication date: 30-Aug-1999
https://dl.acm.org/doi/10.1145/316188.316200
Huang YRavishankar C(1994)Designing an Agent Synthesis System for Cross-RPC CommunicationIEEE Transactions on Software Engineering10.1109/32.26892020:3(188-198)Online publication date: 1-Mar-1994
https://dl.acm.org/doi/10.1109/32.268920
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents