Sciweavers

718 search results - page 73 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
ICALP
2009
Springer
16 years 2 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
BMCBI
2004
146views more  BMCBI 2004»
15 years 2 months ago
The InDeVal insertion/deletion evaluation tool: a program for finding target regions in DNA sequences and for aiding in sequence
Background: The program InDeVal was originally developed to help researchers find known regions of insertion/deletion activity (with the exception of isolated single-base indels) ...
Sierra D. Stoneberg Holt, Jason A. Holt
DIAGRAMS
2006
Springer
15 years 4 months ago
From Diagrams to Models by Analogical Transfer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
Patrick W. Yaner, Ashok K. Goel
115
Voted
CC
2007
Springer
109views System Software» more  CC 2007»
15 years 8 months ago
Layout Transformations for Heap Objects Using Static Access Patterns
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...
Jinseong Jeon, Keoncheol Shin, Hwansoo Han
LISP
2008
96views more  LISP 2008»
15 years 2 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal