192 search results - page 20 / 39 » Nondeterminism in Constructive Z |
92
Voted
JCT
2011
14 years 8 months ago
2011
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
183
click to vote
POPL
1995
ACM
15 years 5 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
115
click to vote
JAPLL
2008
15 years 1 months ago
2008
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
103
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
109
Voted
FM
2005
Springer
15 years 7 months ago
2005
Springer
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...