1912 search results - page 170 / 383 » On the evaluation of argumentation formalisms |
185
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
200
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
167
click to vote
OOPSLA
2007
Springer
16 years 19 days ago
2007
Springer
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch which includes and subsumes multimethods (see for example [3]), but which ...
190
click to vote
PPDP
2007
Springer
16 years 19 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
190
click to vote
ICAC
2005
IEEE
16 years 4 days ago
2005
IEEE
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...