2 edition of Termination of nondeterministic programs. found in the catalog.
Termination of nondeterministic programs.
J. W. de Bakker
|Contributions||Mathematisch Centrum. Afdeling Informatica.|
Arons et al.  reduce almost-sure termination to termination of nondeterministic programs by means of a planner. On the hardness of analyzing probabilistic programs Article. Technical correspondence: on nondeterministic programs Technical correspondence: on nondeterministic programs Landwehr, Carl E. technical. corresponclence On Nondeterministic Programs  A group at the Naval Research Laboratory has been studying the behavior of nondeterministic programs. We have been guided in this study by Dijkstra's A Discipline of .
sure termination in the non-deterministic case, and the same holds for ranking supermartingales. (Section 2) • We extend the ranking supermartingale approach of Chakarov and Sankaranarayanan  to the bounded non-deterministic case, arriving at a sound and complete characterization of ter-minating programs. (Section 5). A nondeterministic programming language is a language which can specify, at certain points in the program (called "choice points"), various alternatives for program an if-then statement, the method of choice between these alternatives is not directly specified by the programmer; the program must decide at run time between the alternatives, via some general method applied to all.
Nondeterminism in Logics of Programs (Preliminary Report) by David Harel and Vaughan R. Pratt Laboratory for Coinputer Science Massachusetts Institute of Technology Cambrid~e, Mass. Abstract.-, We investigate the principles underlying reasoning about nondeterministic programs, and present a logic to support this kind of reasoning. termination of nondeterministic and concurrent quantum programs was examined byLi et al.  andYu and Ying as a reachability problem of quantum Markov systems. Synthesis of Ranking Functions: The idea of using ranking function in proving termination of classical programs is traced back to the seminal paper [Floyd].
State of competition in the airline industry
Necrology of the English congregation of the order of Saint Benedict from 1600 to 1883
War food order 135
Team Usa Basketball Stkr Book
Bureau of Land Management office directory
United Methodist Western Pennsylvania Conference
Ghosts and legends of the Lake District
Protect your life
History of agricultural education in Ontario
Acts of the Legislature of Massachusetts, incorporating the proprietors of the Middlesex Canal.
Who goes there!
uniflagellate phycomycete zoospore
The Shannons of Broadway
We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs.
For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination Cited by: programs  is generalized to the case of nondeterministic quantum programs. This quantum zero-one law enables us to discov er an algorithmically checkable termination condition for.
Bibliographic details on Termination of Nondeterministic Recursive Probabilistic Programs. Add a list of references from and to record detail pages. load references from and DANS is an institute of KNAW and NWO. Driven by data.
Go to page top Go back to contents Go back to site navigationAuthor: J.W. deBakker. We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded.
First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic by: Abstract: We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers).Cited by: Equivalence and Termination of Nondeterministic Programs Aleksandar Dimovski Faculty of Information-Communication Tech., FON University, Skopje,MKD Abstract.
In this paper we address the problem of deciding may- and must-equivalence and termination of nondeterministic ﬂnite programs from second-order recursion-free Erratic Idealized Algol. Abstract: We define a language-independent model of nondeterministic quantum programs in which a quantum program consists of a finite set of quantum processes.
These processes are represented by quantum Markov chains over the common state space. An execution of a nondeterministic quantum program is modeled by a sequence of actions of individual : Yangjia Li, Nengkun Yu, Mingsheng Ying. A combination of these results leads to a necessary and sufficient condition for termination of nondeterministic quantum programs.
Based on this condition, an algorithm is found for checking termination of nondeterministic quantum programs within a fixed finite-dimensional state : Yangjia Li, Nengkun Yu and Mingsheng Ying. tension of the termination question for probabilistic programs is the almost-sure termination question which asks whether a program terminates with probabil-ity 1.
Another fundamental question is about ﬁnite termination (aka positive almost-sure termination [22,8]) which asks whether the expected termination time is ﬁnite. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs.
Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We consider nondeterministic probabilistic programs with the most basic liveness property of termination.
We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments.
Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and on the other hand is a counterpart of polynomial ranking-functions for proving termination Cited by: Though the main interest and motivation for the consideration of fair termination stems from concurrency, almost all of the recent results are formulated in terms of nondeterministic programs, as discussed in previous chapters.
The main reason for this is the elegance of formalisms for structured nondeterminism, such as Guarded Commands. In this chapter, we present extensions of the methods to concurrency, trying to preserve as much as possible the structured : Nissim Francez.
One of the major challenges in computer science is to put programming on a firmer mathematical basis, in order to improve the correctness of programs. This paper describes a concrete implementation of a semantic-based approach for verifying termination of open nondeterministic programs Cited by: 3.
Termination of nondeterministic quantum programs Termination of nondeterministic quantum programs Li, Yangjia; Yu, Nengkun; Ying, Mingsheng We define a language-independent model of nondeterministic quantum programs in which a quantum program consists of a finite set of quantum processes. These processes are represented by quantum Markov.
We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded.
First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs.
We introduce the notion of linear ranking super-martingale (LRSM) for quantum programs (with nondeterministic choices, namely angelic and demonic choices).
Several termination theorems are established showing that the existence of the LRSMs of a quantum program implies its : LiYangjia, YingMingsheng.
Part of the Lecture Notes in Computer Science book series (LNCS, volume ) Abstract In this paper we address the problem of deciding may- and must-equivalence and termination of nondeterministic finite programs from second-order recursion-free Erratic Idealized by: 7.
expressible to handle termination of non-deterministic programs. As usual for type systems of this kind, soundness is an imperative requirement that ensures the veracity of the verification result, while completeness says that, at least in theory, the verification system is as precise as possible.
Conditional expectations of this type can, e.g., stand for the maximal expected termination time of probabilistic programs with non-determinism, under the condition that the program eventually. A combination of these results leads to a necessary and sufficient condition for termination of nondeterministic quantum programs.
Based on this condition, an algorithm is found for checking termination of nondeterministic quantum programs within a Cited by: TRex refines the approximations in alternation by composing three different program analyses: (1) local termination provers that can quickly handle intricate loops, but not whole programs, (2) non.CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract.
In this paper we address the problem of deciding may- and must-equivalence and termination of nondeterministic finite programs from second-order recursion-free Erratic Idealized Algol. We use game semantics to compositionally extract finite models of programs, and the CSP process algebra as a concrete.