Logical analysis of demonic nondeterministic programs
نویسندگان
چکیده
منابع مشابه
Logical Analysis of Demonic Nondeterministic Programs
A logical framework is presented for representing and reasoning about nondeterministic programs that may not terminate. We propose a logic PDL(; ;, ||, d(∗)) which is an extension of dynamic logic such that the program constructors related to demonic operations are introduced in its language. A complete and sound Hilbert-style proof system is given and it is shown that PDL(; ;, ||, d(∗)) is dec...
متن کاملDemonic Testing of Concurrent Programs
Testing presents a daunting challenge for concurrent programs, as non-deterministic scheduling defeats reproducibility. The problem is even harder if, rather than testing entire systems, one tries to test individual components, for example to assess them for thread-safety. We present demonic testing, a technique combining the tangible results of unit testing with the rigour of formal rely-guara...
متن کاملImplementations of Nondeterministic Programs
Non-determinism is widely recognized as a valuable tool for program development [Dijkstra 1976]. It appears also as the natural environment for the , evolution of systems of parallel processes; sequential implementation of such systems through non-deterministically simulating their distributed behaviour can be an effective programming technique [Guerreiro 1981, 1983b]. Furthermore, the concept ...
متن کاملRestricted demonic choice for modular probabilistic programs
It is argued that one approach to modularity in programs containing both demonic and probabilistic choice is to allow variations on the former: `restricted demonic choice', written u L , is not allowed to use the value of variables named in the set L as it resolves its nondeterminism; ordinary demonic choice u is then just the special case u fg in which the set of hidden variables is empty. The...
متن کاملPartial correctness for probabilistic demonic programs
Recent work in sequential program semantics has produced both an operational (He et al., Sci. Comput. Programming 28(2, 3) (1997) 171–192) and an axiomatic (Morgan et al., ACM Trans. Programming Languages Systems 18(3) (1996) 325–353; Seidel et al., Tech Report PRG-TR-6-96, Programming Research group, February 1996) treatment of total correctness for probabilistic demonic programs, extending Ko...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00190-5