On the Complexity of Determinizing Monitors-Reference-Cited by-同舟云学术

On the Complexity of Determinizing Monitors

Published:2017 Issue: Volume: Page:1-13
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Aceto Luca,Achilleos Antonis,Francalanza Adrian,Ingólfsdóttir Anna,Kjartansson Sævar Örn

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-60134-2_1

Reference27 articles.

1. Aceto, L., Achilleos, A., Francalanza, A., Ingólfsdóttir, A., Kjartansson, S.Ö.: Determinizing monitors for HML with recursion. arXiv preprint arXiv:1611.10212 (2016)

2. Lecture Notes in Computer Science;H Barringer,2012

3. Berkovich, S., Bonakdarpour, B., Fischmeister, S.: Runtime verification with minimal intrusion through parallelism. Formal Methods Syst. Des. 46(3), 317–348 (2015)

4. Björklund, H., Martens, W.: The tractability frontier for NFA minimization. J. Comput. Syst. Sci. 78(1), 198–210 (2012)

5. Lecture Notes in Computer Science;L Bocchi,2013

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A theory of monitors;Information and Computation;2021-12

2. A process calculus approach to detection and mitigation of PLC malware;Theoretical Computer Science;2021-10

3. An operational guide to monitorability with applications to regular properties;Software and Systems Modeling;2021-02-05

4. Computer says no: Verdict explainability for runtime monitors using a local proof system;Journal of Logical and Algebraic Methods in Programming;2021-02

5. Better Late Than Never or: Verifying Asynchronous Components at Runtime;Formal Techniques for Distributed Objects, Components, and Systems;2021