506 search results - page 34 / 102 » Where Is the Value in a Program Verifier |
179
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
138
click to vote
LPAR
2001
Springer
15 years 8 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
163
click to vote
JMLR
2008
15 years 4 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
140
Voted
MP
2006
15 years 4 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
112
click to vote
GPCE
2009
Springer
15 years 9 months ago
2009
Springer
Programs can be composed from features. We want to verify automatically that all legal combinations of features can be composed safely without errors. Prior work on this problem a...