Computer Science – Programming Languages
Scientific paper
2008-11-05
Computer Science
Programming Languages
Scientific paper
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.
Blass Andreas
Gurevich Yuri
No associations
LandOfFree
Persistent Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Persistent Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Persistent Queries will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-629980