4940 search results - page 411 / 988 » On the Complexity of Universal Programs |
170
click to vote
CP
2004
Springer
16 years 7 days ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
177
click to vote
ICFEM
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
156
click to vote
GPCE
2009
Springer
15 years 11 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...
154
click to vote
HASKELL
2007
ACM
15 years 10 months ago
2007
ACM
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
190
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...