Sciweavers

840 search results - page 139 / 168
» XML: From Practice to Theory
Sort
View
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
13 years 12 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
IASTEDSEA
2004
13 years 9 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij
JSAC
2006
102views more  JSAC 2006»
13 years 7 months ago
A deterministic frequency-domain model for the indoor power line transfer function
The characterization of the transfer function of the power line (PL) channel is a nontrivial task that requires a truly interdisciplinary approach. Until recently, a common attribu...
S. Galli, Thomas C. Banwell
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
POPL
2007
ACM
14 years 8 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi