417 search results - page 31 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
SIGSOFT
2003
ACM
14 years 9 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
OOPSLA
2001
Springer
14 years 28 days ago
2001
Springer
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
ESEC
1997
Springer
14 years 20 days ago
1997
Springer
The idea of a combined reference model- and view-based specification approach has been proposed recently in the software engineering community. In this paper we present a specifica...
ICSE
2003
IEEE-ACM
14 years 8 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
INFOCOM
2011
IEEE
13 years 6 days ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...