247 search results - page 32 / 50 » Scalable propagation-based call graph construction algorithm... |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
CC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
ASWEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
ICST
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a method of component testing based on algebraic specifications. An algorithm for generating checkable test cases is proposed. A prototype testing tool called ...