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...
Main Author: | Yogananda Jeppu, N |
---|---|
Other Authors: | Melham, T |
Format: | Thesis |
Language: | English |
Published: |
2022
|
Subjects: |
Similar Items
-
Active learning of abstract system models from traces using model checking
by: Yogananda Jeppu, N, et al.
Published: (2022) -
Abstractions and formal verification of max-plus linear systems
by: Syifaul Mufid, M
Published: (2021) -
Learning concise models from long execution traces
by: Yogananda Jeppu, N, et al.
Published: (2020) -
Symbolic techniques for parameterised verification
by: Hong, CD
Published: (2022) -
Modern formal methods and applications /
by: Gabbar, Hossam A
Published: (2006)