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...
Autor principal: | Yogananda Jeppu, N |
---|---|
Altres autors: | Melham, T |
Format: | Thesis |
Idioma: | English |
Publicat: |
2022
|
Matèries: |
Ítems similars
-
Active learning of abstract system models from traces using model checking
per: Yogananda Jeppu, N, et al.
Publicat: (2022) -
Abstractions and formal verification of max-plus linear systems
per: Syifaul Mufid, M
Publicat: (2021) -
Learning concise models from long execution traces
per: Yogananda Jeppu, N, et al.
Publicat: (2020) -
Symbolic techniques for parameterised verification
per: Hong, CD
Publicat: (2022) -
Modern formal methods and applications /
per: Gabbar, Hossam A
Publicat: (2006)