نتایج جستجو برای: termination

تعداد نتایج: 29355  

Journal: :Electr. Notes Theor. Comput. Sci. 2009
Étienne Payet Fausto Spoto

Non-termination analysis proves that programs, or parts of a program, do not terminate. This is important since non-termination is often an unexpected behaviour of computer programs and exposes a bug in their code. While research has found ways of proving non-termination of logic programs and of term rewriting systems, this is hardly the case for imperative programs. In this paper, we describe ...

ژورنال: حقوق پزشکی 2011
حبیبی نوده, فاطمه, رفیعی, محمدتقی,

Termination of marriage is a unilateral legal act which according to it one of parties terminates voluntarily the marriage contract. The Iranian Civil Code in compliance with the famous opinion of Islamic jurists has granted the right to revoke marriage to man in case of diseases such as Qaran( protrusion of the womb), leprosy, vitiligo, Efza( connection of the vaginal and anal passages), disab...

2014
Ton Chanh Le Cristian Gherghina Aquinas Hobor Wei-Ngan Chin

We propose a unified logical framework for specifying and proving both termination and non-termination of various programs. Our framework is based on a resource logic which captures both upper and lower bounds on resources used by the programs. By an abstraction, we evolve this resource logic for execution length into a temporal logic with three predicates to reason about termination, non-termi...

Journal: :Inf. Comput. 2008
Salvador Lucas José Meseguer

The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a theoretical approach to systematically transform, ...

Journal: :Revista de derecho 2023

This paper seeks to study the criteria and methodology used by Uruguayan national doctrine jurisprudence when analyzing abusiveness in exercise of unilateral termination distribution contracts. Based on this, foundations termination, just causes standard good faith will be analyzed.

2001
Alexander Serebrenik

Numerical computations form an essential part of almost any real-world program. Clearly, in order for a termination analyser to be of practical use it should contain a mechanism for inferring termination of such computations. However, this topic attracted less attention of the research community. In works of Der-showitz et al. 5] and Ruggieri 9] such termination analysis techniques were present...

Journal: :Computers in biology and medicine 2010
Pawel Kuklik Christopher X. Wong Anthony Brooks Jan J. Zebrowski Prashanthan Sanders

Atrial fibrillation is the most common type of arrhythmia to affect humans. One of the treatment modalities for atrial fibrillation is an electrical cardioversion. Electrical cardioversion can result in one of three outcomes: an immediate termination of arrhythmic activity, a delayed termination or unsuccessful termination. The mechanism of delayed termination is unknown. Here we present a mode...

Journal: :Psychotherapy 2017
Avantika Bhatia Charles J Gelso

The termination phase of treatment is recognized as a significant aspect of the therapy process and yet remains vastly understudied in psychotherapy literature. In the present study, therapists' perspectives were used to examine how 3 elements of the therapy relationship (working alliance, real relationship, and transference) during the termination phase relate to perceived client sensitivity t...

Journal: :Circulation journal : official journal of the Japanese Circulation Society 2003
Akira Fujiki Masao Sakabe Kunihiro Nishida Koichi Mizumaki Hiroshi Inoue

The aim of this study was to investigate the mechanism of spontaneous termination of atrial fibrillation (AF) by comparing it with drug-induced termination on the basis of changes in fibrillation cycle length (FCL). Fast Fourier transform analysis was carried out on the electrocardiogram (ECG) records of 27 patients with paroxysmal AF without organic heart disease. In 8 patients with drug-induc...

Journal: :J. Symb. Comput. 2002
Jürgen Giesl Thomas Arts Enno Ohlebusch

Recently, Arts and Giesl developed the dependency pair approach which allows automated termination and innermost termination proofs for many term rewriting systems (TRSs) for which such proofs were not possible before. The motivation for this approach was that virtually all previous techniques for automated termination proofs of TRSs were based on simplification orderings. In practice, however,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید