Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1350759,
author = {Bendík, Jaroslav and Beneš, Nikola and Barnat, Jiří and Černá, Ivana},
address = {Berlin},
booktitle = {Software Engineering and Formal Methods - 14th International Conference, SEFM 2016},
doi = {http://dx.doi.org/10.1007/978-3-319-41591-8_9},
editor = {Rocco De Nicola, Eva K{\"{u}}hn},
keywords = {Requirements analysis Formal verification Safety analysis},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin},
isbn = {978-3-319-41590-1},
pages = {121-136},
publisher = {Lecture Notes in Computer Sciences in Computer Science, 9763},
title = {Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis},
url = {http://dx.doi.org/10.1007/978-3-319-41591-8_9p://dx.doi.org/10.1007/978-3-319-41591-8_9},
year = {2016}
}
TY - JOUR
ID - 1350759
AU - Bendík, Jaroslav - Beneš, Nikola - Barnat, Jiří - Černá, Ivana
PY - 2016
TI - Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis
PB - Lecture Notes in Computer Sciences in Computer Science, 9763
CY - Berlin
SN - 9783319415901
KW - Requirements analysis Formal verification Safety analysis
UR - http://dx.doi.org/10.1007/978-3-319-41591-8_9p://dx.doi.org/10.1007/978-3-319-41591-8_9
N2 - The motivation for this study comes from various sources such as parametric formal verification, requirements engineering, and safety analysis. In these areas, there are often situations in which we are given a set of configurations and a property of interest with the goal of computing all the configurations for which the property is valid. Checking the validity of each single configuration may be a costly process. We are thus interested in reducing the number of such validity queries. In this work, we assume that the configuration space is equipped with a partial ordering that is preserved by the property to be checked. In such a case, the set of all valid configurations can be effectively represented by the set of all maximum valid (or minimum invalid) configurations w.r.t. the ordering. We show an algorithm to compute such boundary elements. We explain how this general setting applies to consistency and redundancy checking of requirements and to finding minimum cut-sets for safety analysis. We further discuss various heuristics and evaluate their efficiency, measured primarily by the number of validity queries, on a preliminary set of experiments.
ER -
BENDÍK, Jaroslav, Nikola BENEŠ, Jiří BARNAT a Ivana ČERNÁ. Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis. In Rocco De Nicola, Eva K$\{\backslash$''$\{$u$\}\}$hn. \textit{Software Engineering and Formal Methods - 14th International Conference, SEFM 2016}. Berlin: Lecture Notes in Computer Sciences in Computer Science, 9763, 2016, s.~121-136. ISBN~978-3-319-41590-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-41591-8\_{}9.
|
