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...
Prif Awdur: | Yogananda Jeppu, N |
---|---|
Awduron Eraill: | Melham, T |
Fformat: | Traethawd Ymchwil |
Iaith: | English |
Cyhoeddwyd: |
2022
|
Pynciau: |
Eitemau Tebyg
-
Active learning of abstract system models from traces using model checking
gan: Yogananda Jeppu, N, et al.
Cyhoeddwyd: (2022) -
Abstractions and formal verification of max-plus linear systems
gan: Syifaul Mufid, M
Cyhoeddwyd: (2021) -
Learning concise models from long execution traces
gan: Yogananda Jeppu, N, et al.
Cyhoeddwyd: (2020) -
Symbolic techniques for parameterised verification
gan: Hong, CD
Cyhoeddwyd: (2022) -
Modern formal methods and applications /
gan: Gabbar, Hossam A
Cyhoeddwyd: (2006)