Breadcrumb

 
 

Completeness of Larch/C++ specifications for black-box reuse

Title:

Completeness of Larch/C++ specifications for black-box reuse

Umansky, Ilya (1995) Completeness of Larch/C++ specifications for black-box reuse. Masters thesis, Concordia University.

[img]
Preview
PDF
5Mb

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 > Faculty 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:Theses (M.Comp.Sc.)
Program:Computer Science and Software Engineering
Date:1995
Thesis Supervisor(s):Alagar, V. S
ID Code:2767
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 15:20
Last Modified:08 Dec 2010 10:28
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

Document Downloads

More statistics for this item...

Concordia University - Footer