نتایج جستجو برای: by introducing two counterexamples
تعداد نتایج: 8032901 فیلتر نتایج به سال:
Model checking is a powerful technique for debugging a system description because it generates a counterexample showing a path of the system that fails a property. Instead of the traditional cycle of find bug – fix bug – re-run model checker, often we would like to study multiple bugs before fixing the model to help isolate the cause of the error and to improve the user’s experience by avoiding...
despite the different criticisms on contrastive analysis it has been proved that the results of it(when processed) can be useful in a tefl environment, specially at the level of phonology.this study is an attempt to compare and contrast the sound systems of kurdish and english for pedagogical aims.the consonants,vowels,stress and intonation of the two languages are described by the same model...
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, superset, and subset queries are considered (for the latter one we consider also a variant when the learner tests every conjecture, but the number of negative answers is uniformly bounded). If the answer is negative, t...
According to probabilistic theories of causation, causes raise the probabilities of their effects. Opponents of probabilistic theories of causation offer putative counterexamples. A moment's reflection should lead us to expect such counterexamples to be of two types: (1) causes that appear not to raise the probabilities of their effects; and (2) events that appear to raise the probabilities of ...
this thesis attempts to investigate the effects of prelistening activities on enhancing iranian efl learners` listening comprehension. the present study investigated ways in which learners` background knowledge could be activated in order to enhance their l2 listening comprehension by limiting the number of possible text interpretations prior to listening. the experiments conducted in this stud...
Self-adaptive applications’ executions can be affected by uncertainty factors like unreliable sensing and flawed adaptation and therefore often error-prone. Existing methods can verify the applications suffering uncertainty and report counterexamples. However, such verification results can deviate from reality when the uncertainty specification used in verification is itself imprecise. This thu...
This paper is an introductory survey of available methods for the computation and representation of probabilistic counterexamples for discrete-time Markov chains and probabilistic automata. In contrast to traditional model checking, probabilistic counterexamples are sets of finite paths with a critical probability mass. Such counterexamples are not obtained as a by-product of model checking, bu...
Program equivalence checking is the task of confirming that two programs have same behavior on corresponding inputs. We develop a calculus based symbolic execution and coinduction to check in non-strict functional language. Additionally, we show our can be used derive counterexamples for pairs inequivalent programs, including arise from non-termination. describe fully automated approach finding...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید