Name
Abstract | ||
|---|---|---|
Assertional s-rings are introduced to provide an algebraic setting in which the finite and infinite behavior of nondeterministic
programs can be expressed and reasoned about. This includes expressing the fair infinite behavior of nondeterministic iterative
programs, and reasoning about termination under various fairness assumptions. We also address the question of when the reasoning
techniques are semantically complete.
|
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0304-3975(93)90173-Q | Theoretical Computer Science |
Keywords | Field | DocType |
semantic model,total correctness | Algebraic number,Gödel's completeness theorem,Nondeterministic algorithm,Computer science,Correctness,Theoretical computer science,Boolean algebra | Conference |
Volume | Issue | ISSN |
107 | 2 | Theoretical Computer Science |
ISBN | Citations | PageRank |
0-387-97375-3 | 1 | 0.41 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael G Main | 1 | 448 | 78.08 |
| David L. Black | 2 | 134 | 29.13 |