1017 search results - page 59 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
162
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
FOSSACS
2001
Springer
15 years 2 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
TLDI
2003
ACM
15 years 2 months ago
2003
ACM
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...
POPL
1992
ACM
15 years 1 months ago
1992
ACM
Jade is a language designed to support coarse-grain parallelism on both shared and distributed addressspace machines. Jade is data-oriented: a Jade programmer simply augments a se...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...