Pages that link to "Item:Q2402551"
From MaRDI portal
The following pages link to Monitorability for the Hennessy-Milner logic with recursion (Q2402551):
Displaying 19 items.
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- A theory of monitors (Q2051767) (← links)
- On bidirectional runtime enforcement (Q2117010) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Monitoring hyperproperties with circuits (Q2165208) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- Formal analysis and offline monitoring of electronic exams (Q2402552) (← links)
- (Q5009452) (← links)
- (Q5028448) (← links)
- Monitor Logics for Quantitative Monitor Automata (Q5111228) (← links)
- Consistently-detecting monitors (Q5111620) (← links)
- Monitoring for Silent Actions (Q5136296) (← links)
- Bidirectional Runtime Enforcement of First-Order Branching-Time Properties (Q5883741) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897771) (← links)
- Introduction to the special issue on runtime verification (Q5920079) (← links)
- On first-order runtime enforcement of branching-time properties (Q6090988) (← links)
- On probabilistic monitorability (Q6113983) (← links)