939 search results - page 142 / 188 » Semantic Abstraction and Quantum Computation |
GG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
POPL
1990
ACM
14 years 1 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
JOT
2008
13 years 10 months ago
2008
As Service-Oriented Computing is gaining mainstream adoption, Services are emerging as core-building blocks of today's applications. In particular, web services have become t...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
ASIAN
2004
Springer
14 years 3 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...