Sciweavers

1485 search results - page 191 / 297
» Whole Program Paths
Sort
View
POPL
1996
ACM
14 years 1 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
LCPC
2000
Springer
14 years 18 days ago
Improving Offset Assignment for Embedded Processors
Embedded systems consisting of the application program ROM, RAM, the embedded processor core, and any custom hardware on a single wafer are becoming increasingly common in applicat...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
AMAST
2008
Springer
13 years 11 months ago
A Hybrid Approach for Safe Memory Management in C
In this paper, we present a novel approach that establishes a synergy between static and dynamic analyses for detecting memory errors in C code. We extend the standard C type syste...
Syrine Tlili, Zhenrong Yang, Hai Zhou Ling, Mourad...
IEE
2010
136views more  IEE 2010»
13 years 7 months ago
Assume-guarantee verification of software components in SOFA 2 framework
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
Pavel Parizek, Frantisek Plasil
ISOLA
2010
Springer
13 years 7 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