Persistent Queries
| dc.creator | Blass, Andreas | |
| dc.creator | Gurevich, Yuri | |
| dc.date | 2008-11-05 | |
| dc.date.accessioned | 2026-07-07T10:16:19Z | |
| dc.date.available | 2026-07-07T10:16:19Z | |
| dc.description | We propose a syntax and semantics for interactive abstract state machines to deal with the following situation. A query is issued during a certain step, but the step ends before any reply is received. Later, a reply arrives, and later yet the algorithm makes use of this reply. By a persistent query, we mean a query for which a late reply might be used. Syntactically, our proposal involves issuing, along with a persistent query, a location where a late reply is to be stored. Semantically, it involves only a minor modification of the existing theory of interactive small-step abstract state machines. | |
| dc.identifier | https://arxiv.org/abs/0811.0819 | |
| dc.identifier | http://arxiv.org/abs/0811.0819 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173469 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.title | Persistent Queries | |
| dc.type | text |