Using run-time data for program comprehension

2004 ◽  
Author(s):  
T. Gschwind ◽  
J. Oberleitner ◽  
M. Pinzger
Keyword(s):  
Program Comprehension ◽  
Time Data ◽  
Run Time

Run time data structures

1982 ◽  
Vol 12 (4) ◽  
pp. 394-394
Author(s):  
Roger B. Dannenberg
Keyword(s):  
Data Structures ◽  
Time Data ◽  
Run Time

Accurate and Robust Malware Detection: Running XGBoost on Run-Time Data from Performance Counters

2021 ◽  
pp. 1-1
Author(s):  
Rana Elnaggar ◽  
Lorenzo Servadei ◽  
Shubham Mathur ◽  
Robert Wille ◽  
Wolfgang Ecker ◽  
...  
Keyword(s):  
Malware Detection ◽  
Time Data ◽  
Performance Counters ◽  
Run Time

Model-based generation of run-time data collection systems exploiting AutomationML

2018 ◽  
Vol 66 (10) ◽  
pp. 819-833 ◽  
Author(s):  
Alexandra Mazak ◽  
Arndt Lüder ◽  
Sabine Wolny ◽  
Manuel Wimmer ◽  
Dietmar Winkler ◽  
...  
Keyword(s):  
Data Collection ◽  
Production System ◽  
Production Systems ◽  
Time Data ◽  
Technology Knowledge ◽  
Model Driven ◽  
Processing Data ◽  
Need Support ◽  
Run Time ◽  
Traditional Approaches

Abstract Production system operators need support for collecting and pre-processing data on production systems consisting of several system components, as foundation for optimization and defect detection. Traditional approaches based on hard-coded programming of such run-time data collection systems take time and effort, and require both domain and technology knowledge. In this article, we introduce the AML-RTDC approach, which combines the strengths of AutomationML (AML) data modeling and model-driven engineering, to reduce the manual effort for realizing the run-time data collection (RTDC) system. We evaluate the feasibility of the AML-RTDC approach with a demonstration case about a lab-sized production system and a use case based on real-world requirements.

scholarly journals From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata

2001 ◽  
Vol 8 (11) ◽  
Author(s):  
Alexandre David ◽  
M. Oliver Möller
Keyword(s):  
Model Checking ◽  
Timed Automata ◽  
Formal Semantics ◽  
Cardiac Pacemaker ◽  
Transition System ◽  
Response Analysis ◽  
Data Types ◽  
Time Data ◽  
Run Time

<p>We present a hierarchical version of timed automata, equipped with data types,<br />hand-shake synchronization, and local variables. We describe the formal semantics of this hierarchical timed automata (HTA) formalism in terms of a transition system. We report on the implementation of a flattening algorithm, that translates our formalism to a network of Uppaal timed automata. We establish a correspondence between symbolic states of an HTA and its translations, and thus are able to make use of Uppaal’s simulator and model checking engine.<br />This technique is exemplified with a cardiac pacemaker model. Here, the overhead<br />introduced by the translation is tolerable. We give run-time data for deadlock checking, timed reachability, and timed response analysis.</p>

Sign in / Sign up

Export Citation Format

Share Document