๐ฎ
๐ฎ
The Ethereal
Learning Concise Models from Long Execution Traces
January 15, 2020 ยท The Ethereal ยท ๐ Design Automation Conference
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Natasha Yogananda Jeppu, Tom Melham, Daniel Kroening, John O'Leary
arXiv ID
2001.05230
Category
cs.FL: Formal Languages
Cross-listed
cs.SE
Citations
26
Venue
Design Automation Conference
Last Checked
1 month ago
Abstract
Abstract models of system-level behaviour have applications in design exploration, analysis, testing and verification. We describe a new algorithm for automatically extracting useful models, as automata, from execution traces of a HW/SW system driven by software exercising a use-case of interest. Our algorithm leverages modern program synthesis techniques to generate predicates on automaton edges, succinctly describing system behaviour. It employs trace segmentation to tackle complexity for long traces. We learn concise models capturing transaction-level, system-wide behaviour--experimentally demonstrating the approach using traces from a variety of sources, including the x86 QEMU virtual platform and the Real-Time Linux kernel.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Formal Languages
๐ฎ
๐ฎ
The Ethereal
Supervisor Synthesis to Thwart Cyber Attack with Bounded Sensor Reading Alterations
๐ฎ
๐ฎ
The Ethereal
An Abstraction-Based Framework for Neural Network Verification
๐ฎ
๐ฎ
The Ethereal
Recurrent Neural Networks as Weighted Language Recognizers
๐ฎ
๐ฎ
The Ethereal
TeSSLa: Temporal Stream-based Specification Language
๐ฎ
๐ฎ
The Ethereal