506 search results - page 62 / 102 » Where Is the Value in a Program Verifier |
125
click to vote
UM
2007
Springer
15 years 10 months ago
2007
Springer
Predictive user models often require a phase of effortful supervised training where cases are tagged with labels that represent the status of unobservable variables. We formulate a...
142
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
132
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
143
click to vote
LFP
1992
15 years 5 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
147
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...