Umansky, Ilya (1995) Completeness of Larch/C++ specifications for black-box reuse. Masters thesis, Concordia University.
Preview |
Text (application/pdf)
5MBMM05141.pdf |
Abstract
Develops a methodology to verify the completeness of formal specification intended for a black-box reuse. Identifies the algorithm to apply the methodology semi-automatically with the help of Larch Theorem Prover.
| Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering |
|---|---|
| Item Type: | Thesis (Masters) |
| Authors: | Umansky, Ilya |
| Pagination: | ix, 131 leaves ; 29 cm. |
| Institution: | Concordia University |
| Degree Name: | M. Comp. Sc. |
| Program: | Computer Science and Software Engineering |
| Date: | 1995 |
| Thesis Supervisor(s): | Alagar, V. S |
| Identification Number: | QA 76.76 R47U46 1995 |
| ID Code: | 2767 |
| Deposited By: | Concordia University Library |
| Deposited On: | 27 Aug 2009 19:20 |
| Last Modified: | 13 Jul 2020 19:53 |
| Related URLs: |
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page
Download Statistics
Download Statistics