The Completeness problem in LESD

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97253

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor	Universitat Politècnica de Catalunya. GPLN - Grup de Processament del Llenguatge Natural
dc.contributor.author	Tuells, Antoni
dc.contributor.author	Castell Ariño, Núria
dc.date	1993-12
dc.identifier.citation	Tuells, A., Castell, N. "The Completeness problem in LESD". 1993.
dc.identifier.uri	http://hdl.handle.net/2117/97253
dc.language.iso	eng
dc.relation	LSI-93-51-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Completeness
dc.subject	LESD project
dc.subject	Aerospace software specifications
dc.title	The Completeness problem in LESD
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	This report presents an explanation, a classification and some solutions to the completeness problem in the LESD project. The aim of this project is to develop a set of software tools able to help users to write good quality aerospace software specifications. Completeness is one of the quality standards (together with consistency and verifiability) we are dealing with at present in LESD.