Results 1 - 10 of 970

Conflict-Directed Graph Coverage

by Daniel Schwartz-Narbonne , Martin Schäf , Dejan Jovanović , Philipp Rümmer , Thomas Wies
"... Abstract. Many formal method tools for increasing software reliability apply Satisfiability Modulo Theories (SMT) solvers to enumerate feasible paths in a program subject to certain coverage criteria. Examples include inconsistent code detection tools and concolic test case generators. These tools ..."
Abstract - Add to MetaCart
, we open the black box and devise a new algorithm for this problem domain that we call conflict-directed graph coverage. Our algorithm relies on two core components of an SMT solver, namely conflict-directed learning and deduction by propagation, and applies domain-specific modifications for reasoning

Coverage Problems in Wireless Ad-hoc Sensor Networks

by Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani B. Srivastava - in IEEE INFOCOM , 2001
"... Wireless ad-hoc 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 system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as ..."
Abstract - Cited by 441 (9 self) - Add to MetaCart
by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph

Coverage in Wireless Ad-hoc Sensor Networks

by Xiang-Yang Li, Peng-Jun Wan, Ophir Frieder , 2002
"... Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking [1]. One of the fundamental problems in sensor networks is the calculation of the coverage. In [1], it is assumed that the sensor has the uniform sensing ability. In this pape ..."
Abstract - Cited by 162 (11 self) - Add to MetaCart
. Moreover, we show that the search space of the best coverage problem can be confined to the relative neighborhood graph, which can be constructed locally.

Graph Coverage

by Barry Van Veen, Rick Van Der Zwet, Graph Coverage
"... Introduction into graph coverage Theoretical definition of graphs Theoretical definitions of graph coverage Practical applications of how graphs can be obtained from source codeGraph definition ..."
Abstract - Add to MetaCart
Introduction into graph coverage Theoretical definition of graphs Theoretical definitions of graph coverage Practical applications of how graphs can be obtained from source codeGraph definition

Finding Regular Simple Paths In Graph Databases

by Alberto O. Mendelzon, Peter T. Wood , 1989
"... We consider the following problem: given a labelled directed graph G and a regular expression R, find all pairs of nodes connected by a simple path such that the concatenation of the labels along the path satisfies R. The problem is motivated by the observation that many recursive queries in relatio ..."
Abstract - Cited by 141 (5 self) - Add to MetaCart
We consider the following problem: given a labelled directed graph G and a regular expression R, find all pairs of nodes connected by a simple path such that the concatenation of the labels along the path satisfies R. The problem is motivated by the observation that many recursive queries

Global Register Allocation at Link Time

by David W. Wall - Fast Printed Circuit Board Routing.’’ WRL Research Report 86/3 , 1986
"... In previous work in global register allocation, the compiler colors a conflict graph constructed from liveness dataflow information, in order to allocate the same register to many variables that are not simultane-ously live. If two procedures are in separately com-piled modules, however, the compile ..."
Abstract - Cited by 182 (13 self) - Add to MetaCart
In previous work in global register allocation, the compiler colors a conflict graph constructed from liveness dataflow information, in order to allocate the same register to many variables that are not simultane-ously live. If two procedures are in separately com-piled modules, however

Cache-Conscious Data Placement

by Brad Calder, Chandra Krintz, Simmi John, Todd Austin - in Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems , 1998
"... As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been used to improve instruction cache performance by mapping code with temporal locality to different cache blocks in the vir ..."
Abstract - Cited by 163 (4 self) - Add to MetaCart
in the virtual address space eliminating cache conflicts. These code placement techniques can be applied directly to the problem of placing data for improved data cache performance. In this paper we present a general framework for Cache Conscious Data Placement. This is a compiler directed approach that creates

Coverage, Exploration and Deployment by a Mobile Robot and Communication Network

by Maxim A. Batalin, Gaurav S. Sukhatme - Telecommunication Systems Journal, Special Issue on Wireless Sensor Networks , 2003
"... We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant motion by the robot(s) is needed to cover the environment. We present an e#cient minimalist algorithm which assumes that ..."
Abstract - Cited by 109 (12 self) - Add to MetaCart
are presented which show the collaboration between the deployed network and mobile robot(s) for the tasks of coverage/exploration, network deployment and maintenance (repair), and mobile robot(s) recovery (homing behavior). We present a theoretical basis for our algorithm on graphs and show the results

Coverage Criteria for GUI Testing

by Atif M. Memon, Mary Lou Soffa, Martha E. Pollack - In Proceedings of the 8th European Software Engineering Conference (ESEC) and 9th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE-9 , 2001
"... The widespread recognition of the usefulness of graphical user interfaces (GUIs) has established their importance as critical components of today's software. GUIs have characteristics different from traditional software, and conventional testing techniques do not apply directly to GUI software. ..."
Abstract - Cited by 68 (19 self) - Add to MetaCart
tree and inter-component coverage criteria are used to evaluate the adequacy of test sequences that cross components. Algorithms are described to construct event-flow graphs and an integration tree for a given GUI, and to evaluate the coverage of a given test suite with respect to the new coverage

Spatially-distributed coverage optimization and control with limited-range interactions

by Jorge Cortés, Sonia Martínez, Francesco Bullo - ESAIM Control, Optimisation Calculus Variations , 2005
"... Abstract. This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing/communication radius. Based on the geometry of Voronoi partitions and proximity grap ..."
Abstract - Cited by 96 (28 self) - Add to MetaCart
graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect to appropriate proximity graphs. Numerical simulations illustrate the results.
Results 1 - 10 of 970