scientific article; zbMATH DE number 898449
From MaRDI portal
Publication:4884237
Recommendations
Cited in
(28)- Partitioned PLTL model-checking for refined transition systems
- GSTE is partitioned model checking
- Combining search space partition and abstraction for LTL model checking
- Abstractions of data types
- On finite-state approximants for probabilistic computation tree logic
- Playing with abstraction and representation
- On the complexity of semantic self-minimization
- Predicate abstraction for dense real-time systems
- Bounded model checking for timed automata
- Abstraction and abstraction refinement
- Inferring Synchronization under Limited Observability
- Consistency and refinement for interval Markov chains
- scientific article; zbMATH DE number 1796131 (Why is no real title available?)
- scientific article; zbMATH DE number 2110619 (Why is no real title available?)
- Refining and compressing abstract model checking
- Falsifying safety properties through games on over-approximating models
- EXPTIME-complete decision problems for modal and mixed specifications
- Smaller Abstractions for ∀CTL* without Next
- Extracting program logics from abstract interpretations defined by logical relations
- Abstraction in fixpoint logic
- More Precise Partition Abstractions
- Complexity of Decision Problems for Mixed and Modal Specifications
- Tools and Algorithms for the Construction and Analysis of Systems
- Deriving escape analysis by abstract interpretation
- An abstract interpretation toolkit for CRL
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- On model checking multiple hybrid views
- Comparing disjunctive modal transition systems with an one-selecting variant
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884237)