Interactive presentation: Automatic model generation for black box real-time systems

Embedded systems are often assembled from black box components. System-level analyses, including verification and timing analysis, typically assume the system description, such as RTL or source code, as an input. There is therefore a need to automatically generate formal models of black box components to facilitate analysis. We propose a new method to generate models of real-time embedded systems based on machine learning from execution traces, under a given hypothesis about the system's model of computation. Our technique is based on a novel formulation of the model generation problem as learning a dependency graph that indicates partial ordering between tasks. Tests based on an industry case study demonstrate that the learning algorithm can scale up and that the deduced system model accurately reflects dependencies between tasks in the original design. These dependencies help us formally prove properties of the system and also extract data dependencies that are not explicitly stated in the specifications of black box components.

[1]  Hans A. Hansson,et al.  Automatic Generation and Validation of Models of Legacy Software , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).

[2]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  Exploring Trade-off’s Between Centralized versus Decentralized Automotive Architectures Using a Virtual Integration Environment , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[4]  Thomas Huining Feng,et al.  Automatic Model Generation for Black Box Real-Time Systems , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[5]  Edward A. Lee,et al.  A DENOTATIONAL FRAMEWORK FOR COMPARING MODELS OF COMPUTATION , 1997 .

[6]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[7]  Pedro M. Domingos,et al.  Learning programs from traces using version space algebra , 2003, K-CAP '03.

[8]  C. Pinello,et al.  Architecture Exploration for Time-Critical and Cost-Sensitive Distributed Systems , 2007 .

[9]  Ronald L. Rivest,et al.  Diversity-based inference of finite automata , 1994, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[11]  Edward A. Lee,et al.  A framework for comparing models of computation , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Paul Pop,et al.  Analysis and Synthesis of Communication-Intensive Heterogeneous Real-Time Systems , 2003 .