1716 search results - page 80 / 344 » Proving Conditional Termination |
JUCS
2010
13 years 7 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
FAC
2010
13 years 6 months ago
2010
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
LPAR
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
CSFW
2010
IEEE
14 years 21 days ago
2010
IEEE
In recent years it has been shown that dynamic monitoring can be used to soundly enforce information flow policies. For programs distributed in source or bytecode form, the use o...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...