3845 search results - page 506 / 769 » Belief Logic Programming |
145
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
183
click to vote
CP
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
245
click to vote
WAC
2004
Springer
16 years 6 hour ago
2004
Springer
We describe the motivation and design of a novel embedded systems architecture for large networks of small devices, tha canonical example being wireless sensor networks. The archit...
191
click to vote
WLP
2004
Springer
16 years 1 hour ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
188
click to vote
TLDI
2003
ACM
15 years 12 months ago
2003
ACM
We extend Cyclone, a type-safe polymorphic language at vel of abstraction, with threads and locks. Data races can violate type safety in Cyclone. An extended type system staticall...