91 search results - page 10 / 19 » Abstract State Machines and Computationally Complete Query L... |
102
click to vote
ASM
2000
ASM
15 years 6 months ago
2000
ASM
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
128
Voted
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
117
Voted
ICDT
1999
ACM
15 years 6 months ago
1999
ACM
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
101
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
115
click to vote
ENTCS
2007
15 years 1 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...