Standard

Seamless requirements. / Naumchev, A.; Meyer, Bertrand.

в: Computer Languages, Systems & Structures, Том 49, 01.09.2017, стр. 119-132.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

Naumchev, A & Meyer, B 2017, 'Seamless requirements', Computer Languages, Systems & Structures, Том. 49, стр. 119-132. https://doi.org/10.1016/j.cl.2017.04.001

APA

Naumchev, A., & Meyer, B. (2017). Seamless requirements. Computer Languages, Systems & Structures, 49, 119-132. https://doi.org/10.1016/j.cl.2017.04.001

Vancouver

Naumchev A, Meyer B. Seamless requirements. Computer Languages, Systems & Structures. 2017 сент. 1;49:119-132. doi: 10.1016/j.cl.2017.04.001

Author

Naumchev, A. ; Meyer, Bertrand. / Seamless requirements. в: Computer Languages, Systems & Structures. 2017 ; Том 49. стр. 119-132.

BibTeX

@article{2ee2cc5050034f0ab7430413178b4347,
title = "Seamless requirements",
abstract = "Popular notations for functional requirements specifications frequently ignore developers{\textquoteright} needs, target specific development models, or require translation of requirements into tests for verification; the results can give out-of-sync or downright incompatible artifacts. Seamless requirements, a new approach to specifying functional requirements, contributes to developers{\textquoteright} understanding of requirements and to software quality regardless of the process, while the process itself becomes lighter due to the absence of tests in the presence of formal verification. A development case illustrates these benefits, and a discussion compares seamless requirements to other approaches.",
author = "A. Naumchev and Bertrand Meyer",
note = "Naumchev, A. Seamless requirements / A. Naumchev, B. Meyer // Computer Languages, Systems & Structures. – 2017. – Vol. 49. – P. 119-132. – DOI 10.1016/j.cl.2017.04.001.",
year = "2017",
month = sep,
day = "1",
doi = "10.1016/j.cl.2017.04.001",
language = "English",
volume = "49",
pages = "119--132",
journal = "Computer Languages, Systems & Structures",
issn = "1477-8424",
publisher = "Elsevier Science Publishing Company, Inc.",

}

RIS

TY - JOUR

T1 - Seamless requirements

AU - Naumchev, A.

AU - Meyer, Bertrand

N1 - Naumchev, A. Seamless requirements / A. Naumchev, B. Meyer // Computer Languages, Systems & Structures. – 2017. – Vol. 49. – P. 119-132. – DOI 10.1016/j.cl.2017.04.001.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - Popular notations for functional requirements specifications frequently ignore developers’ needs, target specific development models, or require translation of requirements into tests for verification; the results can give out-of-sync or downright incompatible artifacts. Seamless requirements, a new approach to specifying functional requirements, contributes to developers’ understanding of requirements and to software quality regardless of the process, while the process itself becomes lighter due to the absence of tests in the presence of formal verification. A development case illustrates these benefits, and a discussion compares seamless requirements to other approaches.

AB - Popular notations for functional requirements specifications frequently ignore developers’ needs, target specific development models, or require translation of requirements into tests for verification; the results can give out-of-sync or downright incompatible artifacts. Seamless requirements, a new approach to specifying functional requirements, contributes to developers’ understanding of requirements and to software quality regardless of the process, while the process itself becomes lighter due to the absence of tests in the presence of formal verification. A development case illustrates these benefits, and a discussion compares seamless requirements to other approaches.

UR - https://elibrary.ru/item.asp?id=31038008

U2 - 10.1016/j.cl.2017.04.001

DO - 10.1016/j.cl.2017.04.001

M3 - Article

VL - 49

SP - 119

EP - 132

JO - Computer Languages, Systems & Structures

JF - Computer Languages, Systems & Structures

SN - 1477-8424

ER -

ID: 65525652