| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424146 | Electronic Notes in Theoretical Computer Science | 2009 | 21 Pages |
Abstract
This paper describes the systematic use of fixpoints for the relational semantics of unboundedly nondeterministic sequential programs. The focus is on analysing the expressiveness of various semantic definitions and of powerdomains including or excluding an ‘error’ element ⊥.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
