A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
This work takes a fresh look at the run-time verification of communicating systems using session types, in theory and in practice. ... On the practical side, we show that our monitoring theory is indeed realisable: building upon our formal model, we develop a Scala toolkit for the automatic generation of session monitors. ... In Armin Biere and David Parker, editors, Tools and Algorithms for the Construction and Analysis of Systems -26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences ...arXiv:2105.06291v1 fatcat:wpy4l4tf3rhqhhqgyzbohtrcbu
The RPNI algorithm (Oncina, Garcia 1992) constructs deterministic finite automata from finite sets of negative and positive example words. ... Based on these algorithms, we can define the extension of RPNI to infinite words. ... European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part II, volume 12079 of Lecture Notes in Computer Science, pages 325-343 ...arXiv:2108.03735v1 fatcat:seizumcjkza5fdhgpkfntpsfki