Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 39023 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Mirian Hossein Abadi, Hassan
- Abstract:
- Due to the high level abstraction inherent in most formal specifications and the need to formally specify and develop nondeterministic systems, such as concurrent, probabilistic, and game-like ones, nondeterminism comes into formal specifications inevitably. As it will be shown in this thesis, after developing programs constructively from implicitly nondeterministic specifications, which have been written in the CZ (constructive Z) specification language, only one of the allowable, specified behaviors will appear in final programs. In this way, the implementer will be provided with only one of the possible implementations that is not necessarily the best one. When the nondeterminism involved in initial specifications is because of nondeterministic behavior, existing in specified systems, the above mentioned problem becomes more serious since finally constructed programs are not nondeterministic. In other words, by implicitly nondeterminism in CZ specifications, we cannot constructively develop nondeterministic programs form their formal specifications in CZ. Also, without having special notations for specifying nondeterminism explicitly, there is no way to formally specify and develop some known modalities of nondeterminism, such as singular, plural, strict, angelic, and demonic, each of which has a certain usage in real applications. To solve the above mentioned problems, in this thesis, we will present a CZ-based specification formalism by which one can explicitly specify various modalities of nondeterminism. Using this formalism, the specification writer can bring nondeterministic constructs with various modalities of nondeterminism into her/his formal specifications and then constructively extract programs from correctness proofs of formal specifications behaving according to the initially specified nondeterminism. The practicability of the new formalism will be shown by using it for formally specifying and developing some known, nondeterministic systems, such as concurrent, probabilistic, and game-like ones
- Keywords:
- Formal Specification ; Formal Program Development ; Set Theory ; Z Specification Language ; Constructive Mathematics ; Uncertainty ; CZ Language ; Martin-Lof Theory
Digital Object List
-
محتواي پايان نامه
- view
Bookmark