1716 search results - page 94 / 344 » Proving Conditional Termination |
ISCC
2003
IEEE
14 years 2 months ago
2003
IEEE
The advent of the cooperating IP-enabled heterogeneous radio networks will offer, under the “Beyond 3G” vision, ubiquitous services. In this new challenging context, a novel a...
FASE
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data ha...
CSFW
1997
IEEE
14 years 1 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
CCL
1994
Springer
14 years 28 days 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...