Sciweavers

890 search results - page 139 / 178
» Programming language methods in computer security
Sort
View
ICALP
2005
Springer
14 years 3 months ago
The Polyranking Principle
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
FOSSACS
2004
Springer
14 years 3 months 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
IADIS
2003
13 years 11 months ago
Evaluation of Web Sites a Theoretical Framework
We sketch a theoretical framework for the construction of evaluation schemes for web sites. The framework is based on the structure quite explicitly found in mathematics, physics ...
Terje Aaberge, Ivar Petter Grøtte, Ingjerd ...
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 4 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
UM
2009
Springer
14 years 4 months ago
Predicting Customer Models Using Behavior-Based Features in Shops
Abstract. Recent sensor technologies have enabled the capture of users’ behavior data. Given the large amount of data currently available from sensor-equipped environments, it is...
Junichiro Mori, Yutaka Matsuo, Hitoshi Koshiba, Ke...