Results 11  20
of
16,434
Cute: a concolic unit testing engine for c
 IN ESEC/FSE13: PROCEEDINGS OF THE 10TH EUROPEAN
, 2005
"... In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the pro ..."
Abstract

Cited by 467 (21 self)
 Add to MetaCart
to represent and track constraints that capture the behavior of a symbolic execution of a unit with memory graphs as inputs. Moreover, an efficient constraint solver is proposed to facilitate incremental generation of such test inputs. Finally, CUTE, a tool implementing the method is described together
Temperatureaware microarchitecture
 In Proceedings of the 30th Annual International Symposium on Computer Architecture
, 2003
"... With power density and hence cooling costs rising exponentially, processor packaging can no longer be designed for the worst case, and there is an urgent need for runtime processorlevel techniques that can regulate operating temperature when the package’s capacity is exceeded. Evaluating such techn ..."
Abstract

Cited by 469 (51 self)
 Add to MetaCart
With power density and hence cooling costs rising exponentially, processor packaging can no longer be designed for the worst case, and there is an urgent need for runtime processorlevel techniques that can regulate operating temperature when the package’s capacity is exceeded. Evaluating such techniques, however, requires a thermal model that is practical for architectural studies. This paper describes HotSpot, an accurate yet fast model based on an equivalent circuit of thermal resistances and capacitances that correspond to microarchitecture blocks and essential aspects of the thermal package. Validation was performed using finiteelement simulation. The paper also introduces several effective methods for dynamic thermal management (DTM): “temperaturetracking” frequency scaling, localized toggling, and migrating computation to spare hardware units. Modeling temperature at the microarchitecture level also shows that power metrics are poor predictors of temperature, and that sensor imprecision has a substantial impact on the performance of DTM. 1.
Model Checking for Programming Languages using VeriSoft
 IN PROCEEDINGS OF THE 24TH ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1997
"... Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification of ..."
Abstract

Cited by 442 (13 self)
 Add to MetaCart
then introduce a new search technique that is suitable for exploring the state spaces of such systems. This algorithm has been implemented in VeriSoft, a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary C code. As an example of application
Coverage Problems in Wireless Adhoc Sensor Networks
 in IEEE INFOCOM
, 2001
"... Wireless adhoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new systembuilding challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as ..."
Abstract

Cited by 434 (9 self)
 Add to MetaCart
search algorithms, we establish the main highlight of the paper  optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks. I.
CHARM: An efficient algorithm for closed itemset mining
, 2002
"... The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper we present CHARM, an efficient algorithm for mining all frequent closed itemsets. It enumerates closed sets usin ..."
Abstract

Cited by 317 (14 self)
 Add to MetaCart
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper we present CHARM, an efficient algorithm for mining all frequent closed itemsets. It enumerates closed sets
Algorithm DFS(S): begin
, 2003
"... 1 2dimensional posets 2 Enumeration of ideals for a general poset 2.1 BFS traversal 2.2 DFS traversal Algorithm DFS is a recursive algorithm and is invoked with a global state S.Invoking the algorithm with a global state S means that global state S is visited.For each successor of S0 of S, the pred ..."
Abstract
 Add to MetaCart
1 2dimensional posets 2 Enumeration of ideals for a general poset 2.1 BFS traversal 2.2 DFS traversal Algorithm DFS is a recursive algorithm and is invoked with a global state S.Invoking the algorithm with a global state S means that global state S is visited.For each successor of S0 of S
Efficient planarity testing
 J. ASSOC. COMPUT. MACH
, 1974
"... This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm uses depthfirst sear ..."
Abstract

Cited by 280 (5 self)
 Add to MetaCart
first search and has O(V) time and space bounds, where V is the number of vertices in G. An ALGOS implementation of the algorithm successfully tested graphs with as many as 900 vertices in less than 12 seconds.
Engineering DFSBased Graph Algorithms
, 2007
"... Depthfirst search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient implementations of DFSbased graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speedups by a factor of t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Depthfirst search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient implementations of DFSbased graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speedups by a factor
Leases: An Efficient FaultTolerant Mechanism for Distributed File Cache Consistency
, 1989
"... Caching introduces the overbead and complexity of ensuring consistency, reducing some of its performance benefits. In a distributed system, caching must deal,wit.h the additional complications of communication and host failures. Leases are proposed as a timebased mechanism that provides efficien ..."
Abstract

Cited by 339 (1 self)
 Add to MetaCart
Caching introduces the overbead and complexity of ensuring consistency, reducing some of its performance benefits. In a distributed system, caching must deal,wit.h the additional complications of communication and host failures. Leases are proposed as a timebased mechanism that provides
PartialOrder Methods for the Verification of Concurrent Systems  An Approach to the StateExplosion Problem
, 1995
"... Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract

Cited by 362 (11 self)
 Add to MetaCart
Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy
Results 11  20
of
16,434