The following pages link to (Q4884237):
Displaying 19 items.
- Consistency and refinement for interval Markov chains (Q444461) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- An abstract interpretation toolkit for \(\mu\)CRL (Q883139) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- Comparing disjunctive modal transition systems with an one-selecting variant (Q953529) (← links)
- Abstractions of data types (Q2491212) (← links)
- On finite-state approximants for probabilistic computation tree logic (Q2576951) (← links)
- On the Complexity of Semantic Self-minimization (Q2810966) (← links)
- Predicate Abstraction for Dense Real-Time Systems1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096 and by NASA Langley Research Center under contract B09060051 and Cooperative Agreement NCC-1-399 (Q2842588) (← links)
- (Q2842869) (← links)
- Inferring Synchronization under Limited Observability (Q3617756) (← links)
- Falsifying Safety Properties Through Games on Over-approximating Models (Q4982087) (← links)
- EXPTIME-complete Decision Problems for Modal and Mixed Specifications (Q5170664) (← links)
- Smaller Abstractions for ∀CTL* without Next (Q5187833) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- More Precise Partition Abstractions (Q5452605) (← links)
- Complexity of Decision Problems for Mixed and Modal Specifications (Q5458354) (← links)
