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 |
Μορφή: | Thesis |
Γλώσσα: | 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)