Counterexample validation and interpolation-based refinement for forest automata
In the context of shape analysis, counterexample validation and abstraction refinement are
complex and so far not sufficiently resolved problems. We provide a novel solution to both of …
complex and so far not sufficiently resolved problems. We provide a novel solution to both of …
[PDF][PDF] Automata in Software Verification and Testing
M HRUŠKA - 2023 - theses.cz
This thesis focuses on applications of automata theory to software quality. In the first part, we
focus on shape analysis which can be used for formal verification of programs manipu lating …
focus on shape analysis which can be used for formal verification of programs manipu lating …