Sciweavers

559 search results - page 48 / 112
» On Computing the Canonical Features of Software Systems
Sort
View
LCTRTS
2000
Springer
15 years 1 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
JCP
2007
94views more  JCP 2007»
14 years 9 months ago
Low-Complexity Analysis of Repetitive Regularities for Biometric Applications
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
Lei Wang, Niral Patel
VEE
2006
ACM
115views Virtualization» more  VEE 2006»
15 years 3 months ago
Live updating operating systems using virtualization
Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, i...
Haibo Chen, Rong Chen, Fengzhe Zhang, Binyu Zang, ...
CHI
2005
ACM
15 years 10 months ago
Automatic generation of high coverage usability tests
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
Renée C. Bryce
CC
2001
Springer
146views System Software» more  CC 2001»
15 years 2 months ago
Alias Analysis by Means of a Model Checker
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
Vincenzo Martena, Pierluigi San Pietro