Sciweavers

61 search results - page 10 / 13
» Program Analysis via Graph Reachability
Sort
View
LICS
2003
IEEE
14 years 26 days ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
SIGSOFT
2002
ACM
14 years 8 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
GD
2008
Springer
13 years 8 months ago
Rapid Multipole Graph Drawing on the GPU
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
Apeksha Godiyal, Jared Hoberock, Michael Garland, ...
SCAM
2003
IEEE
14 years 26 days ago
XOgastan: XML-Oriented gcc AST Analysis and Transformations
Software maintenance, program analysis and transformation tools almost always rely on static source code analysis as the first and fundamental step to gather information. In the ...
Giuliano Antoniol, Massimiliano Di Penta, Gianluca...
EM
2010
155views Management» more  EM 2010»
13 years 7 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...