747 search results - page 63 / 150 » Theory and Construction of Molecular Computers |
TCS
2010
13 years 7 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
SIGLEX
1991
14 years 8 days ago
1991
This paper argues for a two-level theory of semantics as opposed to a one-level theory, based on the example of the system of temporal and durationM connectives. Instead of identi...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
ICTAI
2006
IEEE
14 years 2 months ago
2006
IEEE
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...