Sciweavers

250 search results - page 31 / 50
» Static Probabilistic Timing Analysis for Multi-path Programs
Sort
View
WG
1993
Springer
15 years 2 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
113
Voted
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
15 years 4 months ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
129
Voted
ICSE
2011
IEEE-ACM
14 years 2 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
114
Voted
TACS
1994
Springer
15 years 2 months ago
Separate Abstract Interpretation for Control-Flow Analysis
Abstract Interpretation for Control-Flow Analysis Yan Mei Tang and Pierre Jouvelot CRI, Ecole des Mines de Paris, France Effect systems and abstract interpretation are two methods ...
Yan Mei Tang, Pierre Jouvelot
SIGSOFT
2003
ACM
15 years 11 months ago
Deadline analysis of interrupt-driven software
Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others)....
Dennis Brylow, Jens Palsberg