38 search results - page 5 / 8 » Termination Analysis with Calling Context Graphs |
WCRE
2007
IEEE
14 years 1 months ago
2007
IEEE
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
ECLIPSE
2005
ACM
13 years 9 months ago
2005
ACM
Eclipse has the potential to become a widely-used platform for implementation and dissemination of various static analyses for Java. In order to realize this potential, it is impo...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
ICSM
2007
IEEE
14 years 1 months ago
2007
IEEE
Uncovering, modelling, and understanding architectural level dependencies of software systems is a key task for software maintainers. However, current dependency analysis techniqu...