Persistent Queries
Programming Languages
2008-11-07 v1 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.0811.0819,
title = {Persistent Queries},
author = {Andreas Blass and Yuri Gurevich},
journal= {arXiv preprint arXiv:0811.0819},
year = {2008}
}