Toward Sequentializing Overparallelized Protocol Code
Sung-Shik T.Q. Jongmans (CWI), Farhad Arbab (CWI)

TL;DR
This paper discusses the challenges in compiling protocol specifications using constraint automata, highlighting two unexpected problems and proposing solutions to improve the process.
Contribution
It identifies and analyzes two novel problems in automata-based protocol compilation, offering insights applicable beyond Reo connector compilation.
Findings
Two unexpected problems in automata-based compilation
Effective solutions proposed for these problems
Insights applicable beyond Reo connectors
Abstract
In our ongoing work, we use constraint automata to compile protocol specifications expressed as Reo connectors into efficient executable code, e.g., in C. We have by now studied this automata based compilation approach rather well, and have devised effective solutions to some of its problems. Because our approach is based on constraint automata, the approach, its problems, and our solutions are in fact useful and relevant well beyond the specific case of compiling Reo. In this short paper, we identify and analyze two such rather unexpected problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Software Testing and Debugging Techniques
