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...
Yazar: | Yogananda Jeppu, N |
---|---|
Diğer Yazarlar: | Melham, T |
Materyal Türü: | Tez |
Dil: | English |
Baskı/Yayın Bilgisi: |
2022
|
Konular: |
Benzer Materyaller
-
Active learning of abstract system models from traces using model checking
Yazar:: Yogananda Jeppu, N, ve diğerleri
Baskı/Yayın Bilgisi: (2022) -
Abstractions and formal verification of max-plus linear systems
Yazar:: Syifaul Mufid, M
Baskı/Yayın Bilgisi: (2021) -
Learning concise models from long execution traces
Yazar:: Yogananda Jeppu, N, ve diğerleri
Baskı/Yayın Bilgisi: (2020) -
Symbolic techniques for parameterised verification
Yazar:: Hong, CD
Baskı/Yayın Bilgisi: (2022) -
Modern formal methods and applications /
Yazar:: Gabbar, Hossam A
Baskı/Yayın Bilgisi: (2006)