Sciweavers

5832 search results - page 35 / 1167
» Software complexity and maintainability
Sort
View
IPPS
2010
IEEE
14 years 9 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
MICRO
2005
IEEE
136views Hardware» more  MICRO 2005»
15 years 5 months ago
Automatic Thread Extraction with Decoupled Software Pipelining
Until recently, a steadily rising clock rate and other uniprocessor microarchitectural improvements could be relied upon to consistently deliver increasing performance for a wide ...
Guilherme Ottoni, Ram Rangan, Adam Stoler, David I...
STACS
2009
Springer
15 years 6 months ago
The Dynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
MODELS
2007
Springer
15 years 6 months ago
A Generic Approach for Automatic Model Composition
Analyzing and modelling a software system with separate views is a good practice to deal with complexity and maintainability. When adopting such a modular approach for modelling, i...
Franck Fleurey, Benoit Baudry, Robert B. France, S...
KBSE
2008
IEEE
15 years 6 months ago
Using Cluster Analysis to Improve the Design of Component Interfaces
For large software systems, interface structure has an important impact on their maintainability and build performance. For example, for complex systems written in C, recompilatio...
Rahmat Adnan, Bas Graaf, Arie van Deursen, Joost Z...