Computational Foundry Seminar Series

 

DATE: Tuesday 24th October 2017 

LOCATION: CoFo Seminar Room, 909 Talbot Building

TITLE: Noncomputability in analysis

AUTHORS: Arno Pauly 

ABSTRACT: to follow

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

DATE: Tuesday 17th October 2017 

LOCATION: CoFo Seminar Room, 909 Talbot Building

TITLE: Safety-complete Test Suites

AUTHORS: Wen-ling Huang and Jan Peleska (presentation by Jan Peleska) 

ABSTRACT: This presentation is about property-oriented testing. A novel safety-related variant of complete test suites for finite state machines is introduced. Under certain hypotheses which are similar to the ones used in the well-known complete testing methods like W-Method, Wp-Method, HSI-Method, or H-Method, the new method guarantees to uncover every safety violation, while erroneous outputs without safety-relevance may remain undetected. In well-defined situations that can be precisely pre-determined from the reference model, this leads to a substantial reduction of test cases in comparison to the size of the analogous W, WP, HSI, H-test suites. We advocate this new test strategy for situations, where exhaustive testing of the complete system is too expensive. In these cases, strong guarantees with respect to fault coverage should only be given for the errors representing safety violations, while it is considered as acceptable if less critical errors remain undetected. An original version of this material has been published at the ICTSS 2017 conference; in this talk, we present a refined test suite based on the H-method which can be shown to always produce less or equally many test cases as when applying the original H-method. We sketch how this strategy can be extended to safety-complete equivalence class testing for systems with infinite input domains but finitely many internal states and finite output domains.