1715 search results - page 140 / 343 » Domain-Specific Program Checking |
79
Voted
CORR
2007
Springer
15 years 18 days 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...
107
Voted
SPIN
2010
Springer
14 years 11 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
75
Voted
PADL
2010
Springer
15 years 9 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...
ICALP
1997
Springer
15 years 4 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....
105
Voted
IJCAI
1993
15 years 1 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...