| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438414 | Theoretical Computer Science | 2007 | 24 Pages |
Abstract
A complete and decidable Hoare-style calculus for iteration-free probabilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
