437 search results - page 62 / 88 » Proving Termination by Divergence |
CCL
1994
Springer
14 years 10 hour ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
HOA
1993
14 years 3 hour ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
APLAS
2007
ACM
13 years 12 months ago
2007
ACM
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
APLAS
2007
ACM
13 years 12 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...