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...
Egile nagusia: | Yogananda Jeppu, N |
---|---|
Beste egile batzuk: | Melham, T |
Formatua: | Thesis |
Hizkuntza: | English |
Argitaratua: |
2022
|
Gaiak: |
Antzeko izenburuak
-
Active learning of abstract system models from traces using model checking
nork: Yogananda Jeppu, N, et al.
Argitaratua: (2022) -
Abstractions and formal verification of max-plus linear systems
nork: Syifaul Mufid, M
Argitaratua: (2021) -
Learning concise models from long execution traces
nork: Yogananda Jeppu, N, et al.
Argitaratua: (2020) -
Symbolic techniques for parameterised verification
nork: Hong, CD
Argitaratua: (2022) -
Modern formal methods and applications /
nork: Gabbar, Hossam A
Argitaratua: (2006)