Author of the publication

Testing Equivalence vs. Runtime Monitoring.

, , , , and . Models, Languages, and Tools for Concurrent and Distributed Programming, volume 11665 of Lecture Notes in Computer Science, page 28-44. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Completeness Problem for Modal Logic.. LFCS, volume 10703 of Lecture Notes in Computer Science, page 1-21. Springer, (2018)The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum., , , and . CoRR, (2024)Modal Logics with Hard Diamond-Free Fragments.. LFCS, volume 9537 of Lecture Notes in Computer Science, page 1-13. Springer, (2016)Complexity through Translations for Modal Logic with Recursion., , , , and . GandALF, volume 370 of EPTCS, page 34-48. (2022)Determinizing monitors for HML with recursion., , , , and . J. Log. Algebraic Methods Program., (2020)The Cost of Monitoring Alone., , , , and . From Reactive Systems to Cyber-Physical Systems, volume 11500 of Lecture Notes in Computer Science, page 259-275. Springer, (2019)Parameterized Modal Satisfiability., , and . Algorithmica, 64 (1): 38-55 (2012)Parameterized Modal Satisfiability, , and . CoRR, (2009)NEXP-Completeness and Universal Hardness Results for Justification Logic.. CSR, volume 9139 of Lecture Notes in Computer Science, page 27-52. Springer, (2015)Parameterized Modal Satisfiability., , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 369-380. Springer, (2010)