Sciweavers

34 search results - page 4 / 7
» Change Impact Graphs: Determining the Impact of Prior Code C...
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Planning for Fast Connectivity Updates
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
Mihai Patrascu, Mikkel Thorup
ENTCS
2002
181views more  ENTCS 2002»
13 years 5 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
SIGSOFT
2010
ACM
13 years 3 months ago
Organizational volatility and its effects on software defects
The key premise of an organization is to allow more efficient production, including production of high quality software. To achieve that, an organization defines roles and reporti...
Audris Mockus
CODES
2007
IEEE
13 years 11 months ago
Reliable multiprocessor system-on-chip synthesis
This article presents a multiprocessor system-on-chip synthesis (MPSoC) algorithm that optimizes system mean time to failure. Given a set of directed acyclic periodic graphs of co...
Changyun Zhu, Zhenyu (Peter) Gu, Robert P. Dick, L...
ACSAC
2005
IEEE
13 years 11 months ago
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
Steven Noel, Sushil Jajodia