Results 1 - 10 of 1,236

Simplify: A theorem prover for program checking

by David Detlefs, Greg Nelson, James B. Saxe - J. ACM , 2003
"... This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify uses the Nelson-Oppen method to combine decision procedures for several important theories, and also employs a matcher to ..."
Abstract - Cited by 431 (2 self) - Add to MetaCart
This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify uses the Nelson-Oppen method to combine decision procedures for several important theories, and also employs a matcher

Ratio-Based Decisions and the Quantitative Analysis of cDNA Microarray Images

by Yidong Chen, Edward R. Dougherty, Michael L. Bittner , 1997
"... Gene expression can be quantitatively analyzed by hybridizing fluor-tagged mRNA to targets on a cDNA microarray. Comparison of gene expression levels arising from cohybridized samples is achieved by taking ratios of average expression levels for individual genes. A novel method of image segmentation ..."
Abstract - Cited by 366 (28 self) - Add to MetaCart
, and an iterative procedure for signal calibration is developed. 1997 Society of Photo-Optical Instrumentation Engineers. [S1083-3668(97)00504-2] Keywords cDNA; microarray; gene expression; image segmentation; Mann--Whitney target detection; ratio density, ratio confidence interval.

Symbolic Model Checking Using SAT Procedures instead of BDDs

by A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, Y. Zhu - DAC 99 , 1999
"... In this paper, we study the application of propositional decision procedures in hardware verification. In particular, we apply bounded model checking, as introduced in [1], to equivalence and invariant checking. We present several optimizations that reduce the size of generated propositional formula ..."
Abstract - Cited by 329 (28 self) - Add to MetaCart
In this paper, we study the application of propositional decision procedures in hardware verification. In particular, we apply bounded model checking, as introduced in [1], to equivalence and invariant checking. We present several optimizations that reduce the size of generated propositional

The New Routing Algorithm for the ARPANET

by John M. McQuillan, Ira Richer, Eric C. Rosen - IEEE TRANSACTIONS ON COMMUNICATIONS , 1980
"... The new ARPANET routing algorithm is an improvement test results. This paper is a summary of our conclusions only; over the old procedure in that it uses fewer network resources, operates on for more complete descriptions of our research findings, see more realistic estimates of network conditions, ..."
Abstract - Cited by 300 (2 self) - Add to MetaCart
, reacts faster to important our internai reports on this project [3]-[5]. network changes, and does not suffer from long-term loops or oscillations. In the new procedure, each node in the network maintains a database 11. PROBLEMS WITH THE ORIGINAL ALGORITHM describing the complete network topology

Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks

by Ivan Stojmenovic, Xu Lin - IEEE Transactions on Parallel and Distributed Systems
"... AbstractÐIn a localized routing algorithm, each node makes forwarding decisions solely based on the position of itself, its neighbors, and its destination. In distance, progress, and direction-based approaches (reported in the literature), when node A wants to send or forward message m to destinatio ..."
Abstract - Cited by 154 (18 self) - Add to MetaCart
AbstractÐIn a localized routing algorithm, each node makes forwarding decisions solely based on the position of itself, its neighbors, and its destination. In distance, progress, and direction-based approaches (reported in the literature), when node A wants to send or forward message m

Self-Adaptive Software: Landscape and Research Challenges

by Mazeiar Salehie, Ladan Tahvildari - ACM Transactions on Autonomous and Adaptive Systems , 2009
"... Software systems dealing with distributed applications in changing environments normally require human supervision to continue operation in all conditions. These (re-)configuring, troubleshooting, and in general maintenance tasks lead to costly and time-consuming procedures during the operating phas ..."
Abstract - Cited by 166 (7 self) - Add to MetaCart
.g., increasing requests from users). Such a system is required to monitor itself and its context, detect significant changes, decide how to react, and act to execute such decisions. These processes depend on adaptation properties (called self-* properties), domain characteristics (context information or models

Autopilot: Adaptive control of distributed applications

by Randy L. Ribler, Jeffrey S. Vetter, Huseyin Simitci, Daniel A. Reed , 2000
"... With increasing development of applications for heterogeneous, distributed computing grids, the focus of performance analysis has shifted from a posteriori optimization on homogeneous parallel systems to application tuning for heterogeneous resources with time varying availability. This shift has pr ..."
Abstract - Cited by 157 (12 self) - Add to MetaCart
profound implications for performance instrumentation and analysis techniques. Autopilot is a new infrastructure for dynamic performance tuning of heterogeneous computational grids based on closed loop control. This paper describes the Autopilot model of distributed sensors, actuators, and decision

An on-the-fly tableau-based decision procedure for PDL-satisfiability

by Rajeev Goré, Florian Widmann - ELECTR. NOTES THEOR. COMPUT. SCI , 2009
"... We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound method to track unfulfilled eventualities “on the fly” which allows us to detect “bad loops” sooner rather than in multiple subsequen ..."
Abstract - Cited by 16 (1 self) - Add to MetaCart
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound method to track unfulfilled eventualities “on the fly” which allows us to detect “bad loops” sooner rather than in multiple

Loops under Strategies... Continued

by Rene Thiemann, Christian Sternagel, Peter Schneider-kamp
"... While there are many approaches for automatically proving termination of term rewrite systems, up to now there exist only few techniques to disprove their termination automatically. Almost all of these techniques try to find loops, where the existence of a loop implies non-termination of the rewrite ..."
Abstract - Add to MetaCart
-termination of the rewrite system. However, most programming languages use specific evaluation strategies, whereas loop detection techniques usually do not take strategies into account. So even if a rewrite system has a loop, it may still be terminating under certain strategies. Therefore, our goal is to develop decision

Detecting Coarse-Grain Parallelism Using an Interprocedural Parallelizing Compiler

by Mary W. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-wei Liao, Monica S. Lam , 1995
"... This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates a comprehensive and integrated collection of analyses, including privatization and reduction recognition for both array ..."
Abstract - Cited by 103 (23 self) - Add to MetaCart
of parallelism than previously possible. Specifically, it can parallelize loops that span numerous procedures and hundreds of lines of codes, frequently requiring modifications to array data structures such as privatization and reduction transformations. Measurements from several standard benchmark suites
Results 1 - 10 of 1,236