The following pages link to (Q4817542):
Displaying 23 items.
- An extended framework for passive asynchronous testing (Q347402) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Quantitative model-checking of controlled discrete-time Markov processes (Q515573) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Runtime verification with minimal intrusion through parallelism (Q888419) (← links)
- Safety property-driven stubborn sets (Q1708658) (← links)
- On satisficing in quantitative games (Q2044188) (← links)
- Runtime enforcement of hyperproperties (Q2147207) (← links)
- Time-triggered runtime verification (Q2248067) (← links)
- Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
- Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates (Q3297675) (← links)
- Discriminative Model Checking (Q3512513) (← links)
- Modeling and Verification of High-Assurance Properties of Safety-Critical Systems (Q4551641) (← links)
- Model Checking Safety-Critical Systems Using Safecharts (Q4564162) (← links)
- Finite Models vs Tree Automata in Safety Verification (Q5111907) (← links)
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations (Q5169969) (← links)
- Efficient loop conditions for bounded model checking hyperproperties (Q6535341) (← links)
- How hard is finding shortest counter-example lassos in model checking? (Q6535953) (← links)
- Prenex universal first-order safety properties (Q6551713) (← links)
- Tighter construction of tight Büchi automata (Q6629461) (← links)
- Deciding hyperproperties combined with functional specifications (Q6649493) (← links)
