2432 search results - page 233 / 487 » Cryptographic logical relations |
177
click to vote
ICTCS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
176
click to vote
EJC
2010
15 years 6 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
194
click to vote
FORMATS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
169
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
174
click to vote
DEBU
2008
15 years 6 months ago
2008
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...