Log In Sign Up

Learning Concise Models from Long Execution Traces

by   Natasha Yogananda Jeppu, et al.

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.


page 1

page 2

page 3

page 4


Learning from Shader Program Traces

Deep networks for image processing typically learn from RGB pixels. This...

Model Synthesis for Communication Traces of System-on-Chip Designs

Concise and abstract models of system-level behaviors are invaluable in ...

Learning to Encode and Classify Test Executions

The challenge of automatically determining the correctness of test execu...

Rigorous Assessment of Model Inference Accuracy using Language Cardinality

Models such as finite state automata are widely used to abstract the beh...

Active Learning of Abstract System Models from Traces using Model Checking [Extended]

We present a new active model-learning approach to generating abstractio...

Mining Message Flows using Recurrent Neural Networks for System-on-Chip Designs

Comprehensive specifications are essential for various activities across...

Automatic Translation of tock-CSP into Timed Automata

The process algebra tock-CSP provides textual notations for modelling di...