1716 search results - page 43 / 344 » Proving Conditional Termination |
ICTAC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We investigate the issue of typing confidentiality in a languagebased information-flow security approach, aiming at improving some previously proposed type systems, esp...
ICFP
2007
ACM
14 years 8 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
PEPM
2010
ACM
13 years 10 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
TOPLAS
2008
13 years 8 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
ANCS
2006
ACM
14 years 2 months ago
2006
ACM
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...