1144 search results - page 168 / 229 » Logic programming for combinatorial problems |
132
click to vote
IEE
2008
15 years 2 months ago
2008
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
137
click to vote
SECON
2007
IEEE
15 years 8 months ago
2007
IEEE
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
129
click to vote
ICFEM
2004
Springer
15 years 7 months 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...
138
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
104
click to vote
ICFP
2006
ACM
16 years 2 months ago
2006
ACM
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...