2233 search results - page 436 / 447 » On the Complexity of Theory Curbing |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Successful interaction between autonomous agents is contingent on those agents making decisions consistent with the expectations of their peers -- these expectations are based on ...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...