Sciweavers

4287 search results - page 86 / 858
» Assessing Architectural Complexity
Sort
View
DSD
2002
IEEE
86views Hardware» more  DSD 2002»
15 years 6 months ago
Using Formal Tools to Study Complex Circuits Behaviour
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
Paul Amblard, Fabienne Lagnier, Michel Lévy
100
Voted
SPAA
2010
ACM
14 years 11 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
120
Voted
EUROSYS
2006
ACM
15 years 10 months ago
Reducing TCB complexity for security-sensitive applications: three case studies
The large size and high complexity of securitysensitive applications and systems software is a primary cause for their poor testability and high vulnerability. One approach to all...
Lenin Singaravelu, Calton Pu, Hermann Härtig,...
103
Voted
IWPC
2002
IEEE
15 years 6 months ago
Architecture Recovery of Dynamically Linked Applications: A Case Study
Most previously published case studies in architecture recovery have been performed on statically linked software systems. Due to the increase in use of middleware technologies, s...
Igor Ivkovic, Michael W. Godfrey
121
Voted
ICSM
2002
IEEE
15 years 6 months ago
Atomic Architectural Component Recovery for Program Understanding and Evolution
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
Rainer Koschke