5863 search results - page 169 / 1173 » Calculating Functional Programs |
164
click to vote
WMPI
2004
ACM
15 years 11 months ago
2004
ACM
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
279
click to vote
CANDC
2005
ACM
15 years 6 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
132
Voted
ENTCS
2008
15 years 6 months ago
2008
Abstract
179
click to vote
JSC
2010
15 years 4 months ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
160
click to vote
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...