More scalable LTL model checking via discovering design-space dependencies \((D^3)\)
From MaRDI portal
Publication:2324218
DOI10.1007/978-3-319-89960-2_17zbMath1423.68279OpenAlexW2798155353MaRDI QIDQ2324218
Kristin Yvonne Rozier, Rohit Dureja
Publication date: 16 September 2019
Full work available at URL: https://doi.org/10.1007/978-3-319-89960-2_17
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Incremental design-space model checking via reusable reachable state approximations ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking ⋮ Satisfiability checking for mission-time \textsf{LTL} (MLTL)
