The complexity of TRMCS-like spiral specification

TitleThe complexity of TRMCS-like spiral specification
Publication TypeConference Paper
Year of Publication2000
AuthorsMenzies, T.
Conference NameSoftware Specification and Design, 2000. 10th International Workshop on
Pagination183 -190
Keywordscomplexity, computational complexity, configuration management, distributed information system, dynamic document, formal specification, medical information systems, NP-complete, random probing, spiral specification, telemedicine, Teleservices and Remote Medical Care System, TRMCS
Abstract

Modern software is often constructed using ldquo;spiral specification rdquo;; i.e. the specification is a dynamic document that is altered by experience with the current version of the system. Mathematically, many of the sub-tasks within spiral specification belong to the NP-complete class of tasks. In the traditional view of computer science, such tasks are fundamentally intractable and only solvable using incomplete, approximate methods that can be undependable. This traditional view suggests that we should routinely expect spiral specification to always be performed very poorly. This paper is an antidote to such pessimism. Contrary to the traditional view, we can expect that spiral specification can usually be performed adequately, providing that analysts augment their current tools with random probing

URLhttp://dx.doi.org/10.1109/IWSSD.2000.891157
DOI10.1109/IWSSD.2000.891157

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia