Sciweavers

73 search results - page 11 / 15
» First Steps in the Verified Software Grand Challenge
Sort
View
POPL
2009
ACM
14 years 9 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
ISORC
2003
IEEE
14 years 1 months ago
Embedded Linux Outlook in the PostPC Industry
This paper presents an analysis of the future of Embedded Linux in the PostPC industry. This analysis is carried out by first examining the current forces at work in the PostPC ma...
Seongsoo Hong
ASE
2002
160views more  ASE 2002»
13 years 8 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
BMCBI
2008
148views more  BMCBI 2008»
13 years 8 months ago
Automating dChip: toward reproducible sharing of microarray data analysis
Background: During the past decade, many software packages have been developed for analysis and visualization of various types of microarrays. We have developed and maintained the...
Cheng Li
ISORC
2007
IEEE
14 years 2 months ago
QUICKER: A Model-Driven QoS Mapping Tool for QoS-Enabled Component Middleware
This paper provides three contributions to the study of quality of service (QoS) configuration in component-based DRE systems. First, we describe the challenges associated with m...
Amogh Kavimandan, Krishnakumar Balasubramanian, Ni...