632 search results - page 50 / 127 » Proving Invariants of Functional Programs |
199
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
221
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
79
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
ECOOP
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
116
Voted
IPL
2008
15 years 17 days ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...