Sciweavers

2920 search results - page 537 / 584
» Finite information logic
Sort
View
SIGSOFT
2002
ACM
14 years 10 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
WWW
2010
ACM
14 years 4 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
PLDI
2009
ACM
14 years 4 months ago
A weakest precondition approach to active attacks analysis
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
Musard Balliu, Isabella Mastroeni
PLDI
2005
ACM
14 years 3 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster
PDCAT
2005
Springer
14 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu