Automated Synthesis of Protocol Converters with BALM-II

@inproceedings{Castagnetti2015AutomatedSO,
  title={Automated Synthesis of Protocol Converters with BALM-II},
  author={Giovanni Castagnetti and Matteo Piccolo and Tiziano Villa and Nina Vladimirovna Yevtushenko and Robert K. Brayton and Alan Mishchenko},
  booktitle={SEFM Workshops},
  year={2015}
}
We address the problem of the automatic design of automata to translate between different protocols, and we reduce it to the solution of equations defined over regular languages and finite automata FA/finite state machines FSMs. The largest solution of the defined language equations includes all protocol converters that solve the problem; this is a strong advantage over computational techniques that deliver only one or a few solutions, which might lead to suboptimal implementations e.g., as… 
The Quotient in Preorder Theories
TLDR
This paper shows that many existing theories in computer science are preordered heaps, and it is shown that they are able to derive a quotient for them, subsuming existing solutions when available in the literature.

References

SHOWING 1-10 OF 44 REFERENCES
Sequential synthesis by language equation solving
TLDR
This work casts the problem of designing a component that combined with a known part of a system, called the context, conforms to a given overall specification as solving abstract equations over languages and studies the most general solutions under the synchronous and parallel composition operators.
A Formal Approach To The Protocol Converter Problem
TLDR
It is shown that the most general, correct converter for a pair of protocols, can be described as the greatest fixed point of a function for updating buffer states, and this characterization yields a natural algorithm for automatic synthesis of a provably correct converter by iterative computation of the fixed point.
Formal Model of a Protocol Converter
TLDR
A theoretical model of a converter that will enable two given arbitrary protocols to communicate and allows protocols to be nondeterministic, and it is ensured only valid data is sent to the converter.
Solution of parallel language equations for logic synthesis
The problem of designing a component that, combined with a known part of a system, conforms to a given overall specification arises in several applications ranging from logic synthesis to the design
Protocol converter synthesis
TLDR
Results are presented on automatic synthesis of a converter between two protocols and it is shown how converter logic which is bandwidth-optimal can be synthesised for datapaths with an arbitrary number of data ports each of which has arbitrary-size first-in first-out (FIFO) storage.
Solving Parallel Equations with BALM-II
In this report we describe how to solve parallel language equations over regular languages / automata and finite state machines (FSMs), using the software package BALM-II, which is an extended
A Model Checking Approach to Protocol Conversion
SoC Design Approach Using Convertibility Verification
TLDR
A prototype implementation of the proposed algorithm is developed and used to verify that it can handle many classical protocol mismatch problems along with SoC problems, and is shown to be sound and complete.
Protocol Transducer Synthesis using Divide and Conquer approach
TLDR
This paper proposes a method for automatic protocol transducer synthesis which is applicable to complex protocols and demonstrates the method by synthesizing transducers which translate between the real and complicated protocols with advanced features such as non-blocking transactions and out-of-order transactions.
The Unknown Component Problem: Theory and Applications
The Problem of the Unknown Component: Theory and Applications addresses the issue of designing a component that, combined with a known part of a system, conforms to an overall specification. The
...
...