Sciweavers

927 search results - page 58 / 186
» Practical Limits on Software Dependability: A Case Study
Sort
View
RANDOM
1998
Springer
13 years 12 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
SIGSOFT
2005
ACM
14 years 1 months ago
Reuse and variability in large software applications
Reuse has always been a major goal in software engineering, since it promises large gains in productivity, quality and time to market reduction. Practical experience has shown tha...
Jacky Estublier, Germán Vega
SLE
2009
Springer
14 years 6 days ago
Multi-view Composition Language for Software Product Line Requirements
Composition of requirements models in Software Product Line (SPL) development enables stakeholders to derive the requirements of target software products and, very important, to re...
Mauricio Alférez, João Santos, Ana M...
SPLC
2008
13 years 9 months ago
An Exploratory Study of Information Retrieval Techniques in Domain Analysis
Domain analysis involves not only looking at standard requirements documents (e.g., use case specifications) but also at customer information packs, market analyses, etc. Looking ...
Vander Alves, Christa Schwanninger, Luciano Barbos...
IPPS
2010
IEEE
13 years 5 months ago
Evaluating database-oriented replication schemes in Software Transactional Memory systems
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applic...
Roberto Palmieri, Francesco Quaglia, Paolo Romano,...