Software assurance by bounded exhaustive testing
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Software Assurance by Bounded Exhaustive Testing
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Modeling languages and the software tools which supportthem are essential to engineering. However, as theselanguages become more sophisticated, it becomes difficultto assure both the validity of their semantic specificationsand the dependability of their program implementations.To ameliorate this problem we propose to develop sharedsemantic domains and corresponding implementations forfamilies of related modeling languages. The idea is toamortize investments at the intermediate level across multiplelanguage definitions and implementations. To assessthe practicality of this approach for modeling languages,we applied it to two languages for reliability modeling andanalysis. In earlier work, we developed the intermediate semanticdomain of failure automata (FA), which we used toformalize the semantics of dynamic fault trees (DFTs). Inthis paper, we show that a variant of the original FA canserve as a common semantic domain for both DFTs and reliabilityblock diagrams (RBDs). Our experiences suggestthat the use of a common semantic domain and a sharedanalyzer for expressions at this level can ease the task offormalizing and implementing modeling languages, reducingdevelopment costs and improving their dependability.