410 search results - page 53 / 82 » Making norms concrete |
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
ACNS
2004
Springer
13 years 11 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...
ITS
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we discuss how computer supported collaborative learning (CSCL) can be deployed to develop new skills and habits in students at university level. These considerations...