Sciweavers

758 search results - page 55 / 152
» Timing Analysis of Optimised Code
Sort
View
LCTRTS
2004
Springer
14 years 3 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski
ICSE
2005
IEEE-ACM
14 years 10 months ago
Use of relative code churn measures to predict system defect density
Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to...
Nachiappan Nagappan, Thomas Ball
VTC
2006
IEEE
14 years 4 months ago
Semi-Analytical Model of Interference in CDMA-TDD Using Random Time Slot Hopping
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
Ellina Foutekova, Christine Evers, Harald Haas
RTCSA
2008
IEEE
14 years 4 months ago
CREAM: A Generic Build-Time Component Framework for Distributed Embedded Systems
A component framework plays an important role in CBSD as it determines how software components are developed, packaged, assembled and deployed. A desirable component framework for...
Chetan Raj, Jiyong Park, Jungkeun Park, Seongsoo H...
ECRTS
2007
IEEE
14 years 4 months ago
Predictable Paging in Real-Time Systems: A Compiler Approach
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
Isabelle Puaut, Damien Hardy