[PDF][PDF] Efficient gateway synthesis from formal specifications
DM Kristol, D Lee, AN Netravali… - ACM SIGCOMM Computer …, 1991 - dl.acm.org
DM Kristol, D Lee, AN Netravali, KK Sabnani
ACM SIGCOMM Computer Communication Review, 1991•dl.acm.orgAT&T Bell Laboratories Murray Hill, NJ 07974 that computes protocol This urocedure has a
polynomial number of computation steps; on the other hand, all other procedures reported in
the literature require an exponential number of computation steps. A major step in our
procedure is the computation of the largest common subset of services. This largest common
subset is used to compute the converter. Conditions under which the converter can be
stateless are also described. As an example, we compute a converter for interconnecting a …
polynomial number of computation steps; on the other hand, all other procedures reported in
the literature require an exponential number of computation steps. A major step in our
procedure is the computation of the largest common subset of services. This largest common
subset is used to compute the converter. Conditions under which the converter can be
stateless are also described. As an example, we compute a converter for interconnecting a …
AT&T Bell Laboratories Murray Hill, NJ 07974 that computes protocol This urocedure has a polynomial number of computation steps; on the other hand, all other procedures reported in the literature require an exponential number of computation steps. A major step in our procedure is the computation of the largest common subset of services. This largest common subset is used to compute the converter. Conditions under which the converter can be stateless are also described. As an example, we compute a converter for interconnecting a half-duplex protocol with a full-duplex protocol from their formal specifications.
ACM Digital LibraryShowing the best result for this search. See all results