| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422467 | Electronic Notes in Theoretical Computer Science | 2008 | 21 Pages |
Abstract
In recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refinement mappings. The present paper gives an overview of several extensions of the theory and of a number of recent applications to practical verifications. It concludes with a sketch of the results on semantic completeness, and a discussion of the relationship between semantic completeness and methodological convenience.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
