Back to Results
First PageMeta Content
Mathematics / Algebra / Theoretical computer science / Finite automata / Linear algebra / Finite-state transducer / Dynamic programming / Edit distance / Trace / Finite-state machine / Shortest path problem / Levenshtein distance


Suggesting Edits to Explain Failing Traces Giles Reger University of Manchester, UK Abstract. Runtime verification involves checking whether an execution trace produced by a running system satisfies a specification. Howe
Add to Reading List

Document Date: 2016-07-20 13:08:32


Open Document

File Size: 157,06 KB

Share Result on Facebook
UPDATE