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...
Glavni avtor: | Yogananda Jeppu, N |
---|---|
Drugi avtorji: | Melham, T |
Format: | Thesis |
Jezik: | English |
Izdano: |
2022
|
Teme: |
Podobne knjige/članki
-
Active learning of abstract system models from traces using model checking
od: Yogananda Jeppu, N, et al.
Izdano: (2022) -
Abstractions and formal verification of max-plus linear systems
od: Syifaul Mufid, M
Izdano: (2021) -
Learning concise models from long execution traces
od: Yogananda Jeppu, N, et al.
Izdano: (2020) -
Symbolic techniques for parameterised verification
od: Hong, CD
Izdano: (2022) -
Modern formal methods and applications /
od: Gabbar, Hossam A
Izdano: (2006)