Sciweavers

487 search results - page 38 / 98
» The Java System Dependence Graph
Sort
View
RSA
2002
81views more  RSA 2002»
13 years 10 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
ICPADS
1998
IEEE
14 years 3 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
IWIA
2005
IEEE
14 years 4 months ago
Forensic Analysis of File System Intrusions Using Improved Backtracking
Intrusion detection systems alert the system administrators of intrusions but, in most cases, do not provide details about which system events are relevant to the intrusion and ho...
Sriranjani Sitaraman, Subbarayan Venkatesan
SPIN
2010
Springer
13 years 9 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
ICSM
2007
IEEE
14 years 5 months ago
Design recovery and maintenance of build systems
The build system forms an indispensable part of any software project. It needs to evolve in parallel with the source code in order to build, test and install the software. Unfortu...
Bram Adams, Herman Tromp, Kris De Schutter, Wolfga...