Sciweavers

250 search results - page 18 / 50
» Static Probabilistic Timing Analysis for Multi-path Programs
Sort
View
CSUR
1999
114views more  CSUR 1999»
14 years 10 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
ISOLA
2010
Springer
14 years 8 months ago
Context-Sensitivity in IPET for Measurement-Based Timing Analysis
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
Michael Zolda, Sven Bünte, Raimund Kirner
CODES
2002
IEEE
15 years 3 months ago
Worst-case performance analysis of parallel, communicating software processes
In this paper we present a method to perform static timing analysis of SystemC models, that describe parallel, communicating software processes.The paper combines a worstcase exec...
Axel Siebenborn, Oliver Bringmann, Wolfgang Rosens...
JIIS
2002
114views more  JIIS 2002»
14 years 10 months ago
A Dynamic Probabilistic Model to Visualise Topic Evolution in Text Streams
Abstract. We propose a novel probabilistic method, based on latent variable models, for unsupervised topographic visualisation of dynamically evolving, coherent textual information...
Ata Kabán, Mark Girolami
APLAS
2010
ACM
14 years 8 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander