23201 search results - page 123 / 4641 » Rewriting Systems with Data |
151
click to vote
CAV
2001
Springer
15 years 10 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
145
click to vote
DKE
2006
15 years 5 months ago
2006
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
176
click to vote
IANDC
2011
15 years 15 days ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
302
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
127
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
Dataspace management has been recently identified as a new agenda for information management [17, 22] and information integration [23]. In sharp contrast to standard information ...