Sciweavers

412 search results - page 37 / 83
» Innovations in computational type theory using Nuprl
Sort
View
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 8 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
GRC
2007
IEEE
14 years 2 months ago
Towards Mobile Internet: Location Privacy Threats and Granular Computation Challenges
The bulk of contents out on the Internet continue to grow at an astounding pace. As computing and communications become ubiquitous, we are entering the Mobile Internet Computing e...
Ling Liu
DIMVA
2010
13 years 9 months ago
Organizing Large Scale Hacking Competitions
Computer security competitions and challenges are a way to foster innovation and educate students in a highly-motivating setting. In recent years, a number of different security co...
Nicholas Childers, Bryce Boe, Lorenzo Cavallaro, L...
POPL
2003
ACM
14 years 8 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
CCS
2004
ACM
14 years 1 months ago
Comparing the expressive power of access control models
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
Mahesh V. Tripunitara, Ninghui Li