Learning symbolic abstractions from system execution traces
<p>This dissertation shows that symbolic abstractions for a system can be inferred from a set of system execution traces using a combination of Boolean satisfiability and program synthesis. In addition, the degree of completeness of an inferred abstraction can be evaluated by employing equival...
Главный автор: | Yogananda Jeppu, N |
---|---|
Другие авторы: | Melham, T |
Формат: | Диссертация |
Язык: | English |
Опубликовано: |
2022
|
Предметы: |
Схожие документы
-
Active learning of abstract system models from traces using model checking
по: Yogananda Jeppu, N, и др.
Опубликовано: (2022) -
Abstractions and formal verification of max-plus linear systems
по: Syifaul Mufid, M
Опубликовано: (2021) -
Learning concise models from long execution traces
по: Yogananda Jeppu, N, и др.
Опубликовано: (2020) -
Symbolic techniques for parameterised verification
по: Hong, CD
Опубликовано: (2022) -
Modern formal methods and applications /
по: Gabbar, Hossam A
Опубликовано: (2006)