Sciweavers

716 search results - page 66 / 144
» Semilinear Program Feasibility
Sort
View
ICSE
2010
IEEE-ACM
15 years 2 months ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers
ESOP
2001
Springer
15 years 2 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 2 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
ISCA
1997
IEEE
120views Hardware» more  ISCA 1997»
15 years 2 months ago
Run-Time Adaptive Cache Hierarchy Management via Reference Analysis
Improvements in main memory speeds have not kept pace with increasing processor clock frequency and improved exploitation of instruction-level parallelism. Consequently, the gap b...
Teresa L. Johnson, Wen-mei W. Hwu
ISSTA
1996
ACM
15 years 1 months ago
Predicting Dependability by Testing
In assessing the quality of software, we would like to make engineering judgements similar to those based on statistical quality control. Ideally, we want to support statements li...
Richard G. Hamlet