2303 search results - page 388 / 461 » The Cryptographic Abstract Machine |
130
click to vote
TLCA
1997
Springer
15 years 10 months ago
1997
Springer
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...
164
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
149
click to vote
APL
1993
ACM
15 years 10 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
151
click to vote
BIRTHDAY
1994
Springer
15 years 10 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
175
click to vote
CSL
1992
Springer
15 years 10 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...