Sciweavers

1226 search results - page 207 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
SBMF
2009
Springer
105views Formal Methods» more  SBMF 2009»
15 years 6 months ago
Verifying Compiled File System Code
Abstract. This paper presents a case study on retrospective verication of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
Jan Tobias Mühlberg, Gerald Lüttgen
NOCS
2007
IEEE
15 years 6 months ago
Towards Open Network-on-Chip Benchmarks
Measuring and comparing performance, cost, and other features of advanced communication architectures for complex multi core/multiprocessor systems on chip is a significant challe...
Cristian Grecu, André Ivanov, Partha Pratim...
MFCS
2005
Springer
15 years 5 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
PROMS
2001
Springer
109views Multimedia» more  PROMS 2001»
15 years 4 months ago
Model-Based Service Creation in the Friends Project
—This paper presents a model-based approach to service creation. We observe that the complexity of software services increases. To manage this complexity, and to quickly create s...
Wouter B. Teeuw, Dick A. C. Quartel
DCOSS
2008
Springer
15 years 1 months ago
Decoding Code on a Sensor Node
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
Pascal von Rickenbach, Roger Wattenhofer