A key step in analyzing and reasoning about the performance of realtime systems is the derivation of the worst case execution time of a program or program fragment. Modern computer systems with pipelined processors, caches, DMA, etc., can complicate this process. We demonstrate that pipelining need not be considered to be a barrier to the computation of useful worst case execution time bounds o...

Introduction: The execution of composed educational programs for generalpractitioners is one of the most common methods of continuing medicaleducation. This research project aims to evaluate one of these programs.Methods: For this purpose, a pre- and post-test design was developed. Thesubjects consisted of 45 participants. They were tested (by a 76 MCQ knowledge test) in two stages: before and ...

execution of every planned program in cities has different process. process involves inhabitant's preferences, capacity of area or neighborhood, scale of people participation. after these strategies plans will prepared and executors apply them. planning in city scale considering potentials of area and participation of people is very important stage to eliminate undesirable appearances of c...

A program’s execution consistent with the user-specified program order simplifies many aspects of computer design, e.g., programming and resource management. This has greatly benefited uniprocessor system adoption. Parallel systems do not enforce an ordered program execution, complicating system design. Hence, I ask, can parallel execution of programs on multiprocessors be made program-order co...

Execution Originally a program flow analysis for sequential programs [Gustafsson et al, 2006] Finds constraints on program flow through a kind of symbolic execution – “abstract execution” (AE) AE executes the program with abstract states, representing sets of real (“concrete”) states Can be seen as a a kind of value analysis (abstract interpretation) We have extended it with time [Gustafsson et...

In this paper we present co-transformation, a novel approach to the mapping of execution information from the source code of a program to the object code for the purpose of worst-case execution time (WCET) analysis. Our approach is designed to handle the problems introduced by optimizing compilers, i.e. that the structure of the object code is very different from the structure of the source cod...

Programmers have always been curious about what their programs are doing, especially when the behavior is not what they are expecting. Since program execution is intricate and involved, visualization has long been used to provided the programmer with appropriate insights into program execution. This paper looks at the evolution of visual representations of program execution, showing how they ha...

We present Mantis, a framework for predicting the performance of Android applications on given inputs automatically, accurately, and efficiently. A key insight underlying Mantis is that program execution runs often contain features that correlate with performance and are automatically computable efficiently. Mantis synergistically combines techniques from program analysis and machine learning. ...