10870 search results - page 371 / 2174 » Model Checking Programs |
134
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
139
click to vote
PADL
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. We describe a monad for checked, explicitly typed exceptions, which provides as a simple Haskell library what for other languages is a native feature. Multi parameter typ...
164
click to vote
ICALP
1997
Springer
15 years 11 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
168
click to vote
IJCAI
1993
15 years 8 months ago
1993
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
190
click to vote
JFP
2002
15 years 6 months ago
2002
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they...