A proof rule for fair termination of guarded commands
نویسندگان
چکیده
منابع مشابه
Checking Java Programs via Guarded Commands
This paper defines a simple guarded-command–like language and its semantics. The language is used as an intermediate language in generating verification conditions for Java. The paper discusses why it is a good idea to generate verification conditions via an intermediate language, rather than directly. Publication history. This paper appears in Formal Techniques for Java Programs, workshop proc...
متن کاملProbabilistic guarded commands mechanized in HOL
The probabilistic guarded-command language pGCL [15] contains both demonic and probabilistic nondeterminism, which makes it suitable for reasoning about distributed random algorithms [14]. Proofs are based on weakest precondition semantics, using an underlying logic of real(rather than Boolean-) valued functions. We present a mechanization of the quantitative logic for pGCL [16] using the HOL t...
متن کاملProbabilistic Termination Versus Fair Termination
In this paper we show that probabilistic termination of concurrent program is in many cases much simpler than the "f~" one. For a wide class of definitions of probabilistic termination we may express termination by rrf arithmetic formula, whereas the "fair" termination can be expressed only by rrf secqnd order arithmetic formula. Proof of "fair" termination usually needs induction on recursive ...
متن کاملA Formalized Proof of Strong Normalization for Guarded Recursive Types
We consider a simplified version of Nakano’s guarded fixed-point types in a representation by infinite type expressions, defined coinductively. Smallstep reduction is parametrized by a natural number “depth” that expresses under how many guards we may step during evaluation. We prove that reduction is strongly normalizing for any depth. The proof involves a typed inductive notion of strong norm...
متن کاملRule Termination Analysis based on a Rule
Rule processing can be subject to innnite loops-that is, rules may trigger one another indee-nitely. In database systems, this behaviour can be catastrophic; e.g., looping rules would certainly inhibit concurrency and saturate memory thus slowing down system throughput. In general it is unde-cidable to determine in advance if rules are guaranteed to terminate. If analysis algorithms are applied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1985
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80014-0