Name
Abstract | ||
|---|---|---|
Partial, total and general correctness and further models of sequential computations differ in their treatment of finite, infinite and aborting executions. Algebras structure this diversity of models to avoid the repeated development of similar theories and to clarify their range of application. We introduce algebras that uniformly describe correctness statements, correctness calculi, pre-post specifications and loop refinement rules in five kinds of computation models. This extends previous work that unifies iteration, recursion and program transformations for some of these models. Our new description includes a relativised domain operation, which ignores parts of a computation, and represents bound functions for claims of termination by sequences of tests. We verify all results in Isabelle heavily using its automated theorem provers. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31113-0_11 | MPC |
Keywords | Field | DocType |
sequential computation,correctness statement,new description,loop refinement rule,automated theorem provers,algebras structure,computation model,general correctness,aborting execution,correctness calculus | Discrete mathematics,Computer science,Correctness,Automated theorem provers,Recursion,Computation | Conference |
Citations | PageRank | References |
4 | 0.42 | 32 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Walter Guttmann | 1 | 196 | 16.53 |