Sciweavers

178 search results - page 25 / 36
» Dependability Arguments with Trusted Bases
Sort
View
FOSSACS
2004
Springer
14 years 24 days ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
ENTCS
2007
97views more  ENTCS 2007»
13 years 7 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban
WIMOB
2007
IEEE
14 years 1 months ago
Analysis of Group Key Management Protocols for Secure Multicasting in Vehicular Software Distribution Network
—In this paper we investigate the issues in designing key management architecture for secure multicasting in remote software distribution to advance vehicles. We consider the Veh...
Irina Hossain, Syed Masud Mahmud
ACSAC
1999
IEEE
13 years 11 months ago
Security Relevancy Analysis on the Registry of Windows NT 4.0
Many security breaches are caused by inappropriate inputs crafted by people with malicious intents. To enhance the system security, we need either to ensure that inappropriate inp...
Wenliang Du, Praerit Garg, Aditya P. Mathur
ICML
2009
IEEE
14 years 8 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis