Sciweavers

1024 search results - page 2 / 205
» High-Level Execution Time Analysis
Sort
View
LCTRTS
1998
Springer
13 years 11 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
TAPSOFT
1997
Springer
13 years 11 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
ECRTS
2004
IEEE
13 years 11 months ago
Static Determination of Probabilistic Execution Times
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
Laurent David, Isabelle Puaut
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
13 years 11 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
CSMR
2004
IEEE
13 years 11 months ago
High-Level Polymetric Views of Condensed Run-time Information
Understanding the run-time behavior of object-oriented legacy systems is a complex task due to factors such as late binding and polymorphism. Current approaches extract and use in...
Stéphane Ducasse, Michele Lanza, Roland Ber...