| D. P. Anderson. Automated protocol implementation with RTAG. IEEE Trans. Softw. Eng., 14(3):291--300, 1988. |
....signals. Chung and Sidhu have reported semiautomatic (meaning partially hand written) implementations of Estelle specifications with reasonable performance [SCB90] but do not report experience with large protocols. We find both LOTOS and Estelle specifications extremely difficult to read. RTAG [And88] is based on a different formal model: context free attribute grammars. RTAG generally seems more readable than LOTOS and Estelle, a feature that led us to base Prolac s predecessor on grammars. This still survives in Prolac s rule terminology. However, RTAG s performance is problematic due to ....
David P. Anderson. Automated protocol implementation with RTAG. IEEE Transactions on Software Engineering, 14(3):291--300, March 1988.
....model, interlocking finite state machines, and the problems this causes: complexity, unfamiliarity, unreadability, and difficulty of modification or extension. The Esterel TCP did not include connection establishment, and appears not to include important extensions like congestion avoidance. RTAG [2] is based on a different formal model: contextfree attribute grammars. RTAG is more readable than LOTOS and Estelle, but large RTAG specifications, like large attribute grammars generally, become hard to read since the namespace is flat. An early version of Prolac resembled RTAG, but readability ....
David P. Anderson. Automated protocol implementation with RTAG. IEEE Transactions on Software Engineering, 14(3):291--300, March 1988.
....sequential execution. High performance Esterel compilers are being developed [CDO96] however, full implementation of a large protocol is not reported. In terms of language, Esterel suffers from many of the same problems as Estelle due to their common extended finite state machine model. RTAG [And88] is based on a context free attribute grammar. RTAG provides a relatively natural syntax with equivalent modeling power to extended finite state machines. Efficient compilers are reported in the literature [HA89] although efficient turns out to mean arguably efficient enough for research use , ....
David P. Anderson. Automated protocol implementation with RTAG. IEEETransactions on Software Engineering, 14(3):291--300, March 1988.
....also uses this approach to resolve heterogeneities in data types and representations, it also allows programmers to synthesize RPC agents to interconnect programs using different RPC protocols. This feature is absent in remote interface synthesis solutions. The work on specification compilers [24, 25, 26, 27] has been focused on generating correct implementations from the formal protocol specifications like in languages LOTOS and Estelle. However, the portions of a protocol implementation that can be generated depend on the environment and the specification language used, and the efficiency of ....
D. P. Anderson. Automated Protocol Implementation with RTAG. IEEE Transactions on Software Engineering, 14(3):291--300, March 1988.
No context found.
D. P. Anderson. Automated protocol implementation with RTAG. IEEE Trans. Softw. Eng., 14(3):291--300, 1988.
No context found.
D. P. Anderson. Automated protocol implementation with RTAG. IEEE Trans. Softw. Eng., 14(3):291--300, 1988.
No context found.
David P. Anderson. Automated protocol implementation with RTAG. IEEE Transactions on Software Engineering, 14(3):291--300, March 1988.
No context found.
Anderson, D.P., "Automated protocol implementation with RTAG." IEEE Transactions on Software Engineering V. SE-14, N.3 (Mar. 1988), pp. 291-300.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC