Name
Abstract | ||
|---|---|---|
In this article we investigate the relationships between the classical notions of weakest precondition and weakest liberal precondition, and provide several results, namely that in general, weakest liberal precondition is neither stronger nor weaker than weakest precondition, however, given a deterministic and terminating sequential while program and a postcondition, they are equivalent. Hence, in such situation, it does not matter which definition is used. |
Year | Venue | DocType |
|---|---|---|
2015 | arXiv: Programming Languages | Journal |
Volume | Citations | PageRank |
abs/1512.04013 | 0 | 0.34 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Santosa | 1 | 146 | 13.36 |