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...
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | Thesis |
| שפה: | English |
| יצא לאור: |
2022
|
| נושאים: |