176 search results - page 26 / 36 » Scoping Constructs in Logic Programming: Implementation Prob... |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
POPL
2000
ACM
15 years 2 months ago
2000
ACM
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
DNA
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...