43264 search results - page 8240 / 8653 » Comparing models of computation |
134
Voted
DBPL
1991
Springer
15 years 7 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
124
Voted
ECAIW
1994
Springer
15 years 7 months ago
1994
Springer
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...
110
Voted
TACS
1991
Springer
15 years 7 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
124
click to vote
AFRICACRYPT
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
103
Voted
FASE
2010
Springer
15 years 6 months ago
2010
Springer
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...